Fri, 18 Nov 2005 07:10:00 +0100 -- terms are fully typed.
mengj [Fri, 18 Nov 2005 07:10:00 +0100] rev 18200
-- terms are fully typed. -- only the top-level boolean terms are predicates.
Fri, 18 Nov 2005 07:08:54 +0100 -- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
mengj [Fri, 18 Nov 2005 07:08:54 +0100] rev 18199
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
Fri, 18 Nov 2005 07:08:18 +0100 -- combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
mengj [Fri, 18 Nov 2005 07:08:18 +0100] rev 18198
-- combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
(0) -10000 -3000 -1000 -300 -100 -30 -10 -3 +3 +10 +30 +100 +300 +1000 +3000 +10000 +30000 tip