author  paulson 
Fri, 05 Oct 2007 09:59:21 +0200  
changeset 24855  161eb8381b49 
parent 24827  646bdc51eb7d 
child 24920  2a45e400fdad 
permissions  rwrr 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

1 
(* Title: HOL/Tools/metis_tools.ML 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

2 
Author: Kong W. Susanto and Lawrence C. Paulson, CU Computer Laboratory 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

3 
Copyright Cambridge University 2007 
23447  4 

5 
HOL setup for the Metis prover (version 2.0 from 2007). 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

6 
*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

7 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

8 
signature METIS_TOOLS = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

9 
sig 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

10 
val type_lits: bool Config.T 
24319  11 
val metis_tac: Proof.context > thm list > int > tactic 
12 
val metisF_tac: Proof.context > thm list > int > tactic 

13 
val metisH_tac: Proof.context > thm list > int > tactic 

14 
val setup: theory > theory 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

15 
end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

16 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

17 
structure MetisTools: METIS_TOOLS = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

18 
struct 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

19 

24424  20 
structure Recon = ResReconstruct; 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

21 

24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

22 
val (type_lits, type_lits_setup) = Attrib.config_bool "metis_type_lits" true; 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

23 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

24 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

25 
(* Useful Theorems *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

26 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

27 
val EXCLUDED_MIDDLE' = read_instantiate [("R","False")] notE; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

28 
val EXCLUDED_MIDDLE = rotate_prems 1 EXCLUDED_MIDDLE'; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

29 
val REFL_THM = incr_indexes 2 (Meson.make_meta_clause refl); (*Rename from 0,1*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

30 
val subst_em = zero_var_indexes (subst RS EXCLUDED_MIDDLE); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

31 
val ssubst_em = read_instantiate [("t","?s"),("s","?t")] (sym RS subst_em); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

32 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

33 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

34 
(* Useful Functions *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

35 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

36 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

37 
(* match untyped terms*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

38 
fun untyped_aconv (Const(a,_)) (Const(b,_)) = (a=b) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

39 
 untyped_aconv (Free(a,_)) (Free(b,_)) = (a=b) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

40 
 untyped_aconv (Var((a,_),_)) (Var((b,_),_)) = (a=b) (*the index is ignored!*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

41 
 untyped_aconv (Bound i) (Bound j) = (i=j) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

42 
 untyped_aconv (Abs(a,_,t)) (Abs(b,_,u)) = (a=b) andalso untyped_aconv t u 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

43 
 untyped_aconv (t1$t2) (u1$u2) = untyped_aconv t1 u1 andalso untyped_aconv t2 u2 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

44 
 untyped_aconv _ _ = false; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

45 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

46 
(* Finding the relative location of an untyped term within a list of terms *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

47 
fun get_index lit = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

48 
let val lit = Envir.eta_contract lit 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

49 
fun get n [] = raise Empty 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

50 
 get n (x::xs) = if untyped_aconv lit (Envir.eta_contract (HOLogic.dest_Trueprop x)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

51 
then n else get (n+1) xs 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

52 
in get 1 end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

53 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

54 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

55 
(* HOL to FOL (Isabelle to Metis) *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

56 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

57 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

58 
fun fn_isa_to_met "equal" = "=" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

59 
 fn_isa_to_met x = x; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

60 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

61 
fun metis_lit b c args = (b, (c, args)); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

62 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

63 
fun hol_type_to_fol (ResClause.AtomV x) = Metis.Term.Var x 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

64 
 hol_type_to_fol (ResClause.AtomF x) = Metis.Term.Fn(x,[]) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

65 
 hol_type_to_fol (ResClause.Comp(tc,tps)) = Metis.Term.Fn(tc, map hol_type_to_fol tps); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

66 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

67 
(*These two functions insert type literals before the real literals. That is the 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

68 
opposite order from TPTP linkup, but maybe OK.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

69 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

70 
fun hol_term_to_fol_FO tm = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

71 
case ResHolClause.strip_comb tm of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

72 
(ResHolClause.CombConst(c,_,tys), tms) => 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

73 
let val tyargs = map hol_type_to_fol tys 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

74 
val args = map hol_term_to_fol_FO tms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

75 
in Metis.Term.Fn (c, tyargs @ args) end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

76 
 (ResHolClause.CombVar(v,_), []) => Metis.Term.Var v 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

77 
 _ => error "hol_term_to_fol_FO"; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

78 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

79 
fun hol_term_to_fol_HO (ResHolClause.CombVar(a, ty)) = Metis.Term.Var a 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

80 
 hol_term_to_fol_HO (ResHolClause.CombConst(a, ty, tylist)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

81 
Metis.Term.Fn(fn_isa_to_met a, map hol_type_to_fol tylist) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

82 
 hol_term_to_fol_HO (ResHolClause.CombApp(tm1,tm2)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

83 
Metis.Term.Fn(".", map hol_term_to_fol_HO [tm1,tm2]); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

84 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

85 
fun hol_literal_to_fol true (ResHolClause.Literal (pol, tm)) = (*firstorder*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

86 
let val (ResHolClause.CombConst(p,_,tys), tms) = ResHolClause.strip_comb tm 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

87 
val tylits = if p = "equal" then [] else map hol_type_to_fol tys 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

88 
val lits = map hol_term_to_fol_FO tms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

89 
in metis_lit pol (fn_isa_to_met p) (tylits @ lits) end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

90 
 hol_literal_to_fol false (ResHolClause.Literal (pol, tm)) = (*higherorder*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

91 
case ResHolClause.strip_comb tm of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

92 
(ResHolClause.CombConst("equal",_,_), tms) => 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

93 
metis_lit pol "=" (map hol_term_to_fol_HO tms) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

94 
 _ => metis_lit pol "{}" [hol_term_to_fol_HO tm]; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

95 

24319  96 
fun literals_of_hol_thm thy isFO t = 
97 
let val (lits, types_sorts) = ResHolClause.literals_of_term thy t 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

98 
in (map (hol_literal_to_fol isFO) lits, types_sorts) end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

99 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

100 
fun metis_of_typeLit (ResClause.LTVar (s,x)) = metis_lit false s [Metis.Term.Var x] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

101 
 metis_of_typeLit (ResClause.LTFree (s,x)) = metis_lit true s [Metis.Term.Fn(x,[])]; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

102 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

103 
fun metis_of_tfree tf = Metis.Thm.axiom (Metis.LiteralSet.singleton (metis_of_typeLit tf)); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

104 

24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

105 
fun hol_thm_to_fol ctxt isFO th = 
24319  106 
let val thy = ProofContext.theory_of ctxt 
107 
val (mlits, types_sorts) = 

108 
(literals_of_hol_thm thy isFO o HOLogic.dest_Trueprop o prop_of) th 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

109 
val (tvar_lits,tfree_lits) = ResClause.add_typs_aux types_sorts 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

110 
val tlits = if Config.get ctxt type_lits then map metis_of_typeLit tvar_lits else [] 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

111 
in (Metis.Thm.axiom (Metis.LiteralSet.fromList(tlits@mlits)), tfree_lits) end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

112 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

113 
(* ARITY CLAUSE *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

114 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

115 
fun m_arity_cls (ResClause.TConsLit (c,t,args)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

116 
metis_lit true (ResClause.make_type_class c) [Metis.Term.Fn(t, map Metis.Term.Var args)] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

117 
 m_arity_cls (ResClause.TVarLit (c,str)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

118 
metis_lit false (ResClause.make_type_class c) [Metis.Term.Var str]; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

119 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

120 
(*TrueI is returned as the Isabelle counterpart because there isn't any.*) 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

121 
fun arity_cls (ResClause.ArityClause{kind,conclLit,premLits,...}) = 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

122 
(TrueI, Metis.Thm.axiom (Metis.LiteralSet.fromList (map m_arity_cls (conclLit :: premLits)))); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

123 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

124 
(* CLASSREL CLAUSE *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

125 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

126 
fun m_classrel_cls subclass superclass = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

127 
[metis_lit false subclass [Metis.Term.Var "T"], metis_lit true superclass [Metis.Term.Var "T"]]; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

128 

24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

129 
fun classrel_cls (ResClause.ClassrelClause {axiom_name,subclass,superclass,...}) = 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

130 
(TrueI, Metis.Thm.axiom (Metis.LiteralSet.fromList (m_classrel_cls subclass superclass))); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

131 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

132 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

133 
(* FOL to HOL (Metis to Isabelle) *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

134 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

135 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

136 
datatype term_or_type = Term of Term.term  Type of Term.typ; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

137 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

138 
fun terms_of [] = [] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

139 
 terms_of (Term t :: tts) = t :: terms_of tts 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

140 
 terms_of (Type _ :: tts) = terms_of tts; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

141 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

142 
fun types_of [] = [] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

143 
 types_of (Term (Term.Var((a,idx), T)) :: tts) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

144 
if String.isPrefix "_" a then 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

145 
(*Variable generated by Metis, which might have been a type variable.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

146 
TVar(("'" ^ a, idx), HOLogic.typeS) :: types_of tts 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

147 
else types_of tts 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

148 
 types_of (Term _ :: tts) = types_of tts 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

149 
 types_of (Type T :: tts) = T :: types_of tts; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

150 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

151 
fun apply_list rator nargs rands = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

152 
let val trands = terms_of rands 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

153 
in if length trands = nargs then Term (list_comb(rator, trands)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

154 
else error ("apply_list: wrong number of arguments: " ^ Display.raw_string_of_term rator ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

155 
" expected " ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

156 
Int.toString nargs ^ " received " ^ commas (map Display.raw_string_of_term trands)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

157 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

158 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

159 
(*Instantiate constant c with the supplied types, but if they don't match its declared 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

160 
sort constraints, replace by a general type.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

161 
fun const_of ctxt (c,Ts) = Const (c, dummyT) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

162 

24500  163 
fun infer_types ctxt = 
164 
Syntax.check_terms (ProofContext.set_mode ProofContext.mode_pattern ctxt); 

165 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

166 
(*We use 1 rather than 0 because variable references in clauses may otherwise conflict 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

167 
with variable constraints in the goal...at least, type inference often fails otherwise. 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

168 
SEE ALSO axiom_inf below.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

169 
fun mk_var w = Term.Var((w,1), HOLogic.typeT); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

170 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

171 
(*include the default sort, if available*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

172 
fun mk_tfree ctxt w = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

173 
let val ww = "'" ^ w 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

174 
in TFree(ww, getOpt (Variable.def_sort ctxt (ww,~1), HOLogic.typeS)) end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

175 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

176 
(*Remove the "apply" operator from an HO term*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

177 
fun strip_happ args (Metis.Term.Fn(".",[t,u])) = strip_happ (u::args) t 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

178 
 strip_happ args x = (x, args); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

179 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

180 
(*Maps metis terms to isabelle terms*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

181 
fun fol_term_to_hol_RAW ctxt fol_tm = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

182 
let val thy = ProofContext.theory_of ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

183 
val _ = Output.debug (fn () => "fol_term_to_hol: " ^ Metis.Term.toString fol_tm) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

184 
fun tm_to_tt (Metis.Term.Var v) = 
24424  185 
(case Recon.strip_prefix ResClause.tvar_prefix v of 
186 
SOME w => Type (Recon.make_tvar w) 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

187 
 NONE => 
24424  188 
case Recon.strip_prefix ResClause.schematic_var_prefix v of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

189 
SOME w => Term (mk_var w) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

190 
 NONE => Term (mk_var v) ) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

191 
(*Var from Metis with a name like _nnn; possibly a type variable*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

192 
 tm_to_tt (Metis.Term.Fn ("{}", [arg])) = tm_to_tt arg (*hBOOL*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

193 
 tm_to_tt (t as Metis.Term.Fn (".",_)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

194 
let val (rator,rands) = strip_happ [] t 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

195 
in case rator of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

196 
Metis.Term.Fn(fname,ts) => applic_to_tt (fname, ts @ rands) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

197 
 _ => case tm_to_tt rator of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

198 
Term t => Term (list_comb(t, terms_of (map tm_to_tt rands))) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

199 
 _ => error "tm_to_tt: HO application" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

200 
end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

201 
 tm_to_tt (Metis.Term.Fn (fname, args)) = applic_to_tt (fname,args) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

202 
and applic_to_tt ("=",ts) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

203 
Term (list_comb(Const ("op =", HOLogic.typeT), terms_of (map tm_to_tt ts))) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

204 
 applic_to_tt (a,ts) = 
24424  205 
case Recon.strip_prefix ResClause.const_prefix a of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

206 
SOME b => 
24424  207 
let val c = Recon.invert_const b 
208 
val ntypes = Recon.num_typargs thy c 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

209 
val nterms = length ts  ntypes 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

210 
val tts = map tm_to_tt ts 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

211 
val tys = types_of (List.take(tts,ntypes)) 
24424  212 
val ntyargs = Recon.num_typargs thy c 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

213 
in if length tys = ntyargs then 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

214 
apply_list (const_of ctxt (c, tys)) nterms (List.drop(tts,ntypes)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

215 
else error ("Constant " ^ c ^ " expects " ^ Int.toString ntyargs ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

216 
" but gets " ^ Int.toString (length tys) ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

217 
" type arguments\n" ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

218 
space_implode "\n" (map (ProofContext.string_of_typ ctxt) tys) ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

219 
" the terms are \n" ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

220 
space_implode "\n" (map (ProofContext.string_of_term ctxt) (terms_of tts))) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

221 
end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

222 
 NONE => (*Not a constant. Is it a type constructor?*) 
24424  223 
case Recon.strip_prefix ResClause.tconst_prefix a of 
224 
SOME b => Type (Term.Type(Recon.invert_type_const b, types_of (map tm_to_tt ts))) 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

225 
 NONE => (*Maybe a TFree. Should then check that ts=[].*) 
24424  226 
case Recon.strip_prefix ResClause.tfree_prefix a of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

227 
SOME b => Type (mk_tfree ctxt b) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

228 
 NONE => (*a fixed variable? They are Skolem functions.*) 
24424  229 
case Recon.strip_prefix ResClause.fixed_var_prefix a of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

230 
SOME b => 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

231 
let val opr = Term.Free(b, HOLogic.typeT) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

232 
in apply_list opr (length ts) (map tm_to_tt ts) end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

233 
 NONE => error ("unexpected metis function: " ^ a) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

234 
in case tm_to_tt fol_tm of Term t => t  _ => error "fol_tm_to_tt: Term expected" end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

235 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

236 
fun fol_terms_to_hol ctxt fol_tms = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

237 
let val ts = map (fol_term_to_hol_RAW ctxt) fol_tms 
24494
dc387e3999ec
replaced ProofContext.infer_types by general Syntax.check_terms;
wenzelm
parents:
24424
diff
changeset

238 
val _ = Output.debug (fn () => " calling type inference:") 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

239 
val _ = app (fn t => Output.debug (fn () => ProofContext.string_of_term ctxt t)) ts 
24500  240 
val ts' = infer_types ctxt ts; 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

241 
val _ = app (fn t => Output.debug 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

242 
(fn () => " final term: " ^ ProofContext.string_of_term ctxt t ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

243 
" of type " ^ ProofContext.string_of_typ ctxt (type_of t))) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

244 
ts' 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

245 
in ts' end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

246 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

247 
fun mk_not (Const ("Not", _) $ b) = b 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

248 
 mk_not b = HOLogic.mk_not b; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

249 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

250 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

251 
(* FOL step Inference Rules *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

252 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

253 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

254 
(*for debugging only*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

255 
fun print_thpair (fth,th) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

256 
(Output.debug (fn () => "============================================="); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

257 
Output.debug (fn () => "Metis: " ^ Metis.Thm.toString fth); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

258 
Output.debug (fn () => "Isabelle: " ^ string_of_thm th)); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

259 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

260 
fun lookth thpairs (fth : Metis.Thm.thm) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

261 
valOf (AList.lookup (uncurry Metis.Thm.equal) thpairs fth) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

262 
handle Option => error ("Failed to find a Metis theorem " ^ Metis.Thm.toString fth); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

263 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

264 
fun is_TrueI th = Thm.eq_thm(TrueI,th); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

265 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

266 
fun inst_excluded_middle th thy i_atm = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

267 
let val vx = hd (term_vars (prop_of th)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

268 
val substs = [(cterm_of thy vx, cterm_of thy i_atm)] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

269 
in cterm_instantiate substs th end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

270 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

271 
(* INFERENCE RULE: AXIOM *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

272 
fun axiom_inf ctxt thpairs th = incr_indexes 1 (lookth thpairs th); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

273 
(*This causes variables to have an index of 1 by default. SEE ALSO mk_var above.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

274 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

275 
(* INFERENCE RULE: ASSUME *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

276 
fun assume_inf ctxt atm = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

277 
inst_excluded_middle EXCLUDED_MIDDLE 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

278 
(ProofContext.theory_of ctxt) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

279 
(singleton (fol_terms_to_hol ctxt) (Metis.Term.Fn atm)); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

280 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

281 
(* INFERENCE RULE: INSTANTIATE. Type instantiations are ignored. Attempting to reconstruct 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

282 
them admits new possibilities of errors, e.g. concerning sorts. Instead we try to arrange 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

283 
that new TVars are distinct and that types can be inferred from terms.*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

284 
fun inst_inf ctxt thpairs fsubst th = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

285 
let val thy = ProofContext.theory_of ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

286 
val i_th = lookth thpairs th 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

287 
val i_th_vars = term_vars (prop_of i_th) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

288 
fun find_var x = valOf (List.find (fn Term.Var((a,_),_) => a=x) i_th_vars) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

289 
fun subst_translation (x,y) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

290 
let val v = find_var x 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

291 
val t = fol_term_to_hol_RAW ctxt y 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

292 
in SOME (cterm_of thy v, t) end 
24827  293 
handle Option => 
294 
(Output.debug (fn() => "List.find failed for the variable " ^ x ^ 

295 
" in " ^ string_of_thm i_th); 

296 
NONE) 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

297 
fun remove_typeinst (a, t) = 
24424  298 
case Recon.strip_prefix ResClause.schematic_var_prefix a of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

299 
SOME b => SOME (b, t) 
24424  300 
 NONE => case Recon.strip_prefix ResClause.tvar_prefix a of 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

301 
SOME _ => NONE (*type instantiations are forbidden!*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

302 
 NONE => SOME (a,t) (*internal Metis var?*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

303 
val _ = Output.debug (fn () => " isa th: " ^ string_of_thm i_th) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

304 
val substs = List.mapPartial remove_typeinst (Metis.Subst.toList fsubst) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

305 
val (vars,rawtms) = ListPair.unzip (List.mapPartial subst_translation substs) 
24500  306 
val tms = infer_types ctxt rawtms; 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

307 
val ctm_of = cterm_of thy o (map_types o Logic.incr_tvar) (1 + Thm.maxidx_of i_th) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

308 
val substs' = ListPair.zip (vars, map ctm_of tms) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

309 
val _ = Output.debug (fn() => "subst_translations:") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

310 
val _ = app (fn (x,y) => Output.debug (fn () => string_of_cterm x ^ " > " ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

311 
string_of_cterm y)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

312 
substs' 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

313 
in cterm_instantiate substs' i_th end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

314 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

315 
(* INFERENCE RULE: RESOLVE *) 
24424  316 

317 
(*Like RSN, but we rename apart only the type variables. Vars here typically have an index 

318 
of 1, and the use of RSN would increase this typically to 3. Instantiations of those Vars 

319 
could then fail. See comment on mk_var.*) 

320 
fun resolve_inc_tyvars(tha,i,thb) = 

321 
let val tha = Drule.incr_type_indexes (1 + Thm.maxidx_of thb) tha 

322 
val ths = Seq.list_of (bicompose false (false,tha,nprems_of tha) i thb) 

323 
in 

324 
case distinct Thm.eq_thm ths of 

325 
[th] => th 

326 
 _ => raise THM ("resolve_inc_tyvars: unique result expected", i, [tha,thb]) 

327 
end; 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

328 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

329 
fun resolve_inf ctxt thpairs atm th1 th2 = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

330 
let 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

331 
val thy = ProofContext.theory_of ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

332 
val i_th1 = lookth thpairs th1 and i_th2 = lookth thpairs th2 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

333 
val _ = Output.debug (fn () => " isa th1 (pos): " ^ string_of_thm i_th1) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

334 
val _ = Output.debug (fn () => " isa th2 (neg): " ^ string_of_thm i_th2) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

335 
in 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

336 
if is_TrueI i_th1 then i_th2 (*Trivial cases where one operand is type info*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

337 
else if is_TrueI i_th2 then i_th1 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

338 
else 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

339 
let 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

340 
val i_atm = singleton (fol_terms_to_hol ctxt) (Metis.Term.Fn atm) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

341 
val _ = Output.debug (fn () => " atom: " ^ ProofContext.string_of_term ctxt i_atm) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

342 
val prems_th1 = prems_of i_th1 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

343 
val prems_th2 = prems_of i_th2 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

344 
val index_th1 = get_index (mk_not i_atm) prems_th1 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

345 
handle Empty => error "Failed to find literal in th1" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

346 
val _ = Output.debug (fn () => " index_th1: " ^ Int.toString index_th1) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

347 
val index_th2 = get_index i_atm prems_th2 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

348 
handle Empty => error "Failed to find literal in th2" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

349 
val _ = Output.debug (fn () => " index_th2: " ^ Int.toString index_th2) 
24424  350 
in resolve_inc_tyvars (Meson.select_literal index_th1 i_th1, index_th2, i_th2) end 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

351 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

352 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

353 
(* INFERENCE RULE: REFL *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

354 
fun refl_inf ctxt lit = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

355 
let val thy = ProofContext.theory_of ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

356 
val v_x = hd (term_vars (prop_of REFL_THM)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

357 
val i_lit = singleton (fol_terms_to_hol ctxt) lit 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

358 
in cterm_instantiate [(cterm_of thy v_x, cterm_of thy i_lit)] REFL_THM end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

359 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

360 
fun get_ty_arg_size thy (Const("op =",_)) = 0 (*equality has no type arguments*) 
24424  361 
 get_ty_arg_size thy (Const(c,_)) = (Recon.num_typargs thy c handle TYPE _ => 0) 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

362 
 get_ty_arg_size thy _ = 0; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

363 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

364 
(* INFERENCE RULE: EQUALITY *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

365 
fun equality_inf ctxt isFO thpairs (pos,atm) fp fr = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

366 
let val thy = ProofContext.theory_of ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

367 
val [i_atm,i_tm] = fol_terms_to_hol ctxt [Metis.Term.Fn atm, fr] 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

368 
val _ = Output.debug (fn () => "sign of the literal: " ^ Bool.toString pos) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

369 
fun replace_item_list lx 0 (l::ls) = lx::ls 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

370 
 replace_item_list lx i (l::ls) = l :: replace_item_list lx (i1) ls 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

371 
fun path_finder_FO tm (p::ps) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

372 
let val (tm1,args) = Term.strip_comb tm 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

373 
val adjustment = get_ty_arg_size thy tm1 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

374 
val p' = if adjustment > p then p else padjustment 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

375 
val tm_p = List.nth(args,p') 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

376 
handle Subscript => error ("equality_inf: " ^ Int.toString p ^ " adj " ^ Int.toString adjustment ^ " term " ^ ProofContext.string_of_term ctxt tm) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

377 
in 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

378 
Output.debug (fn () => "path_finder: " ^ Int.toString p ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

379 
" " ^ ProofContext.string_of_term ctxt tm_p); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

380 
if null ps (*FIXME: why not use patternmatching and avoid repetition*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

381 
then (tm_p, list_comb (tm1, replace_item_list (Term.Bound 0) p' args)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

382 
else let val (r,t) = path_finder_FO tm_p ps 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

383 
in (r, list_comb (tm1, replace_item_list t p' args)) end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

384 
end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

385 
fun path_finder_HO tm [] = (tm, Term.Bound 0) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

386 
 path_finder_HO (t$u) (0::ps) = (fn(x,y) => (x, y$u)) (path_finder_HO t ps) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

387 
 path_finder_HO (t$u) (p::ps) = (fn(x,y) => (x, t$y)) (path_finder_HO u ps) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

388 
fun path_finder true tm ps = path_finder_FO tm ps 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

389 
 path_finder false (tm as Const("op =",_) $ _ $ _) (p::ps) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

390 
(*equality: not curried, as other predicates are*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

391 
if p=0 then path_finder_HO tm (0::1::ps) (*select first operand*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

392 
else path_finder_HO tm (p::ps) (*1 selects second operand*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

393 
 path_finder false tm (p::ps) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

394 
path_finder_HO tm ps (*if not equality, ignore head to skip hBOOL*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

395 
fun path_finder_lit ((nt as Term.Const ("Not", _)) $ tm_a) idx = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

396 
let val (tm, tm_rslt) = path_finder isFO tm_a idx 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

397 
in (tm, nt $ tm_rslt) end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

398 
 path_finder_lit tm_a idx = path_finder isFO tm_a idx 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

399 
val (tm_subst, body) = path_finder_lit i_atm fp 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

400 
val tm_abs = Term.Abs("x", Term.type_of tm_subst, body) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

401 
val _ = Output.debug (fn () => "abstraction: " ^ ProofContext.string_of_term ctxt tm_abs) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

402 
val _ = Output.debug (fn () => "i_tm: " ^ ProofContext.string_of_term ctxt i_tm) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

403 
val _ = Output.debug (fn () => "located term: " ^ ProofContext.string_of_term ctxt tm_subst) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

404 
val imax = maxidx_of_term (i_tm $ tm_abs $ tm_subst) (*ill typed but gives right max*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

405 
val subst' = incr_indexes (imax+1) (if pos then subst_em else ssubst_em) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

406 
val _ = Output.debug (fn () => "subst' " ^ string_of_thm subst') 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

407 
val eq_terms = map (pairself (cterm_of thy)) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

408 
(ListPair.zip (term_vars (prop_of subst'), [tm_abs, tm_subst, i_tm])) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

409 
in cterm_instantiate eq_terms subst' end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

410 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

411 
fun step ctxt isFO thpairs (fol_th, Metis.Proof.Axiom _) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

412 
axiom_inf ctxt thpairs fol_th 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

413 
 step ctxt isFO thpairs (_, Metis.Proof.Assume f_atm) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

414 
assume_inf ctxt f_atm 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

415 
 step ctxt isFO thpairs (_, Metis.Proof.Subst(f_subst, f_th1)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

416 
inst_inf ctxt thpairs f_subst f_th1 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

417 
 step ctxt isFO thpairs (_, Metis.Proof.Resolve(f_atm, f_th1, f_th2)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

418 
resolve_inf ctxt thpairs f_atm f_th1 f_th2 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

419 
 step ctxt isFO thpairs (_, Metis.Proof.Refl f_tm) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

420 
refl_inf ctxt f_tm 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

421 
 step ctxt isFO thpairs (_, Metis.Proof.Equality(f_lit, f_p, f_r)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

422 
equality_inf ctxt isFO thpairs f_lit f_p f_r; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

423 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

424 
val factor = Seq.hd o distinct_subgoals_tac; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

425 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

426 
fun real_literal (b, (c, _)) = not (String.isPrefix ResClause.class_prefix c); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

427 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

428 
fun translate isFO _ thpairs [] = thpairs 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

429 
 translate isFO ctxt thpairs ((fol_th, inf) :: infpairs) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

430 
let val _ = Output.debug (fn () => "=============================================") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

431 
val _ = Output.debug (fn () => "METIS THM: " ^ Metis.Thm.toString fol_th) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

432 
val _ = Output.debug (fn () => "INFERENCE: " ^ Metis.Proof.inferenceToString inf) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

433 
val th = Meson.flexflex_first_order (factor (step ctxt isFO thpairs (fol_th, inf))) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

434 
val _ = Output.debug (fn () => "ISABELLE THM: " ^ string_of_thm th) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

435 
val _ = Output.debug (fn () => "=============================================") 
24424  436 
val n_metis_lits = length (filter real_literal (Metis.LiteralSet.toList (Metis.Thm.clause fol_th))) 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

437 
in 
24424  438 
if nprems_of th = n_metis_lits then () 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

439 
else error "Metis: proof reconstruction has gone wrong"; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

440 
translate isFO ctxt ((fol_th, th) :: thpairs) infpairs 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

441 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

442 

24855  443 
(*Determining which axiom clauses are actually used*) 
444 
fun used_axioms axioms (th, Metis.Proof.Axiom _) = SOME (lookth axioms th) 

445 
 used_axioms axioms _ = NONE; 

446 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

447 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

448 
(* Translation of HO Clauses *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

449 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

450 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

451 
fun cnf_th th = hd (ResAxioms.cnf_axiom th); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

452 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

453 
val equal_imp_fequal' = cnf_th (thm"equal_imp_fequal"); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

454 
val fequal_imp_equal' = cnf_th (thm"fequal_imp_equal"); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

455 

24827  456 
val comb_I = cnf_th ResHolClause.comb_I; 
457 
val comb_K = cnf_th ResHolClause.comb_K; 

458 
val comb_B = cnf_th ResHolClause.comb_B; 

459 
val comb_C = cnf_th ResHolClause.comb_C; 

460 
val comb_S = cnf_th ResHolClause.comb_S; 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

461 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

462 
fun dest_Arity (ResClause.ArityClause{premLits,...}) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

463 
map ResClause.class_of_arityLit premLits; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

464 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

465 
fun type_ext thy tms = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

466 
let val subs = ResAtp.tfree_classes_of_terms tms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

467 
val supers = ResAtp.tvar_classes_of_terms tms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

468 
and tycons = ResAtp.type_consts_of_terms thy tms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

469 
val arity_clauses = ResClause.make_arity_clauses thy tycons supers 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

470 
val (supers',arity_clauses) = ResClause.make_arity_clauses thy tycons supers 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

471 
val classrel_clauses = ResClause.make_classrel_clauses thy subs supers' 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

472 
in map classrel_cls classrel_clauses @ map arity_cls arity_clauses 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

473 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

474 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

475 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

476 
(* Logic maps manage the interface between HOL and firstorder logic. *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

477 
(*  *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

478 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

479 
type logic_map = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

480 
{isFO : bool, 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

481 
axioms : (Metis.Thm.thm * Thm.thm) list, 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

482 
tfrees : ResClause.type_literal list}; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

483 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

484 
fun const_in_metis c (pol,(pred,tm_list)) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

485 
let 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

486 
fun in_mterm (Metis.Term.Var nm) = false 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

487 
 in_mterm (Metis.Term.Fn (".", tm_list)) = exists in_mterm tm_list 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

488 
 in_mterm (Metis.Term.Fn (nm, tm_list)) = c=nm orelse exists in_mterm tm_list 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

489 
in c=pred orelse exists in_mterm tm_list end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

490 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

491 
(*transform isabelle clause to metis clause *) 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

492 
fun add_thm ctxt (ith, {isFO, axioms, tfrees}) : logic_map = 
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

493 
let val (mth, tfree_lits) = hol_thm_to_fol ctxt isFO ith 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

494 
fun add_tfree (tf, axs) = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

495 
if member (op=) tfrees tf then axs 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

496 
else (metis_of_tfree tf, TrueI) :: axs 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

497 
val new_axioms = foldl add_tfree [] tfree_lits 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

498 
in 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

499 
{isFO = isFO, 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

500 
axioms = (mth, Meson.make_meta_clause ith) :: (new_axioms @ axioms), 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

501 
tfrees = tfree_lits union tfrees} 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

502 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

503 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

504 
(*transform isabelle type / arity clause to metis clause *) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

505 
fun add_type_thm [] lmap = lmap 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

506 
 add_type_thm ((ith, mth) :: cls) {isFO, axioms, tfrees} = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

507 
add_type_thm cls {isFO = isFO, 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

508 
axioms = (mth, ith) :: axioms, 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

509 
tfrees = tfrees} 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

510 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

511 
(* Function to generate metis clauses, including comb and type clauses *) 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

512 
fun build_map mode thy ctxt cls ths = 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

513 
let val isFO = (mode = ResAtp.Fol) orelse 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

514 
(mode <> ResAtp.Hol andalso ResAtp.is_fol_thms (cls @ ths)) 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

515 
val lmap = foldl (add_thm ctxt) {isFO = isFO, axioms = [], tfrees = []} (cls @ ths) 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

516 
val clause_lists = map (Metis.Thm.clause o #1) (#axioms lmap) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

517 
fun used c = exists (Metis.LiteralSet.exists (const_in_metis c)) clause_lists 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

518 
(*Now check for the existence of certain combinators*) 
24827  519 
val thI = if used "c_COMBI" then [comb_I] else [] 
520 
val thK = if used "c_COMBK" then [comb_K] else [] 

521 
val thB = if used "c_COMBB" then [comb_B] else [] 

522 
val thC = if used "c_COMBC" then [comb_C] else [] 

523 
val thS = if used "c_COMBS" then [comb_S] else [] 

524 
val thEQ = if used "c_fequal" then [fequal_imp_equal', equal_imp_fequal'] else [] 

525 
val lmap' = if isFO then lmap 

526 
else foldl (add_thm ctxt) lmap (thEQ @ thS @ thC @ thB @ thK @ thI) 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

527 
in 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

528 
add_type_thm (type_ext thy (map prop_of (cls @ ths))) lmap' 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

529 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

530 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

531 
fun refute cls = 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

532 
Metis.Resolution.loop (Metis.Resolution.new Metis.Resolution.default cls); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

533 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

534 
fun is_false t = t aconv (HOLogic.mk_Trueprop HOLogic.false_const); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

535 

24855  536 
fun common_thm ths1 ths2 = exists (member Thm.eq_thm ths1) (map Meson.make_meta_clause ths2); 
537 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

538 
(* Main function to start metis prove and reconstruction *) 
24855  539 
fun FOL_SOLVE mode ctxt cls ths0 = 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

540 
let val thy = ProofContext.theory_of ctxt 
24855  541 
val th_cls_pairs = map (fn th => (PureThy.get_name_hint th, ResAxioms.cnf_axiom th)) ths0 
542 
val ths = List.concat (map #2 th_cls_pairs) 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

543 
val _ = if exists(is_false o prop_of) cls then error "problem contains the empty clause" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

544 
else (); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

545 
val _ = Output.debug (fn () => "FOL_SOLVE: CONJECTURE CLAUSES") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

546 
val _ = app (fn th => Output.debug (fn () => string_of_thm th)) cls 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

547 
val _ = Output.debug (fn () => "THEOREM CLAUSES") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

548 
val _ = app (fn th => Output.debug (fn () => string_of_thm th)) ths 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

549 
val {isFO,axioms,tfrees} = build_map mode thy ctxt cls ths 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

550 
val _ = if null tfrees then () 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

551 
else (Output.debug (fn () => "TFREE CLAUSES"); 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

552 
app (fn tf => Output.debug (fn _ => ResClause.tptp_of_typeLit tf)) tfrees) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

553 
val _ = Output.debug (fn () => "CLAUSES GIVEN TO METIS") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

554 
val thms = map #1 axioms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

555 
val _ = app (fn th => Output.debug (fn () => Metis.Thm.toString th)) thms 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

556 
val _ = if isFO 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

557 
then Output.debug (fn () => "goal is firstorder") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

558 
else Output.debug (fn () => "goal is higherorder") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

559 
val _ = Output.debug (fn () => "START METIS PROVE PROCESS") 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

560 
in 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

561 
case refute thms of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

562 
Metis.Resolution.Contradiction mth => 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

563 
let val _ = Output.debug (fn () => "METIS RECONSTRUCTION START: " ^ 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

564 
Metis.Thm.toString mth) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

565 
val ctxt' = fold Variable.declare_constraints (map prop_of cls) ctxt 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

566 
(*add constraints arising from converting goal to clause form*) 
24855  567 
val proof = Metis.Proof.proof mth 
568 
val result = translate isFO ctxt' axioms proof 

569 
and used = List.mapPartial (used_axioms axioms) proof 

570 
val _ = Output.debug (fn () => "METIS COMPLETED...clauses actually used:") 

571 
val _ = app (fn th => Output.debug (fn () => string_of_thm th)) used 

572 
val unused = filter (fn (a,cls) => not (common_thm used cls)) th_cls_pairs 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

573 
in 
24855  574 
if null unused then () 
575 
else warning ("Unused theorems: " ^ commas (map #1 unused)); 

23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

576 
case result of 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

577 
(_,ith)::_ => (Output.debug (fn () => "success: " ^ string_of_thm ith); ith) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

578 
 _ => error "METIS: no result" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

579 
end 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

580 
 Metis.Resolution.Satisfiable _ => error "Metis finds the theorem to be invalid" 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

581 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

582 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

583 
fun metis_general_tac mode ctxt ths i st0 = 
24041
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

584 
let val _ = Output.debug (fn () => 
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

585 
"Metis called with theorems " ^ cat_lines (map string_of_thm ths)) 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

586 
in 
24855  587 
(Meson.MESON ResAxioms.neg_clausify (fn cls => rtac (FOL_SOLVE mode ctxt cls ths) 1) i 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

588 
THEN ResAxioms.expand_defs_tac st0) st0 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

589 
end; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

590 

24041
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

591 
val metis_tac = metis_general_tac ResAtp.Auto; 
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

592 
val metisF_tac = metis_general_tac ResAtp.Fol; 
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

593 
val metisH_tac = metis_general_tac ResAtp.Hol; 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

594 

24041
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

595 
fun method mode = Method.thms_ctxt_args (fn ths => fn ctxt => 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

596 
Method.SIMPLE_METHOD' 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

597 
(setmp ResHolClause.typ_level ResHolClause.T_CONST (*constanttyped*) 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

598 
(setmp ResHolClause.minimize_applies false (*avoid this optimization*) 
24041
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

599 
(CHANGED_PROP o metis_general_tac mode ctxt ths)))); 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

600 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

601 
val setup = 
24309
01f3e1a43c24
turned type_lits into configuration option (with attribute);
wenzelm
parents:
24300
diff
changeset

602 
type_lits_setup #> 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

603 
Method.add_methods 
24041
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

604 
[("metis", method ResAtp.Auto, "METIS for FOL & HOL problems"), 
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

605 
("metisF", method ResAtp.Fol, "METIS for FOL problems"), 
d5845b7c1a24
metis_tac: proper context (ProofContext.init it *not* sufficient);
wenzelm
parents:
23447
diff
changeset

606 
("metisH", method ResAtp.Hol, "METIS for HOL problems"), 
23442
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

607 
("finish_clausify", 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

608 
Method.no_args (Method.SIMPLE_METHOD' (K (ResAxioms.expand_defs_tac refl))), 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

609 
"cleanup after conversion to clauses")]; 
028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

610 

028e39e5e8f3
The Metis prover (slightly modified version from Larry);
wenzelm
parents:
diff
changeset

611 
end; 