Sat, 31 Jul 2010 21:14:20 +0200 Make registrations generic data.
ballarin [Sat, 31 Jul 2010 21:14:20 +0200] rev 38107
Make registrations generic data.
Fri, 30 Jul 2010 15:03:42 +0200 merged
blanchet [Fri, 30 Jul 2010 15:03:42 +0200] rev 38106
merged
Fri, 30 Jul 2010 00:02:25 +0200 don't choke on synonyms when parsing SPASS's Flotter output + renamings;
blanchet [Fri, 30 Jul 2010 00:02:25 +0200] rev 38105
don't choke on synonyms when parsing SPASS's Flotter output + renamings; the output format isn't documented so it was hard to guess that a single clause could be associated with several names...
Thu, 29 Jul 2010 23:37:10 +0200 fix Mirabelle timeout
blanchet [Thu, 29 Jul 2010 23:37:10 +0200] rev 38104
fix Mirabelle timeout
Thu, 29 Jul 2010 23:24:07 +0200 make Mirabelle happy
blanchet [Thu, 29 Jul 2010 23:24:07 +0200] rev 38103
make Mirabelle happy
Thu, 29 Jul 2010 23:11:35 +0200 fix bug in the newly introduced "bound concealing" code
blanchet [Thu, 29 Jul 2010 23:11:35 +0200] rev 38102
fix bug in the newly introduced "bound concealing" code
Thu, 29 Jul 2010 22:57:36 +0200 handle division by zero gracefully (used to raise Unordered later on)
blanchet [Thu, 29 Jul 2010 22:57:36 +0200] rev 38101
handle division by zero gracefully (used to raise Unordered later on)
Thu, 29 Jul 2010 22:43:46 +0200 use "explicit_apply" in the minimizer whenever it might make a difference to prevent freak failures;
blanchet [Thu, 29 Jul 2010 22:43:46 +0200] rev 38100
use "explicit_apply" in the minimizer whenever it might make a difference to prevent freak failures; this replaces the previous, somewhat messy solution of adding "extra" clauses
Thu, 29 Jul 2010 22:13:15 +0200 fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
blanchet [Thu, 29 Jul 2010 22:13:15 +0200] rev 38099
fix Meson's definition of first-orderness to prevent errors later on elsewhere (e.g. in Metis)
Thu, 29 Jul 2010 21:20:24 +0200 handle schematic vars the same way in Sledgehammer as in Metis, to avoid unreplayable proofs
blanchet [Thu, 29 Jul 2010 21:20:24 +0200] rev 38098
handle schematic vars the same way in Sledgehammer as in Metis, to avoid unreplayable proofs
Thu, 29 Jul 2010 20:15:50 +0200 revert exception throwing in FOL_SOLVE, since they're not caught anyway
blanchet [Thu, 29 Jul 2010 20:15:50 +0200] rev 38097
revert exception throwing in FOL_SOLVE, since they're not caught anyway
Thu, 29 Jul 2010 20:02:02 +0200 avoid "ATP Error: Error: blah" style messages
blanchet [Thu, 29 Jul 2010 20:02:02 +0200] rev 38096
avoid "ATP Error: Error: blah" style messages
Thu, 29 Jul 2010 19:58:43 +0200 avoid "_def_raw" theorems
blanchet [Thu, 29 Jul 2010 19:58:43 +0200] rev 38095
avoid "_def_raw" theorems
Thu, 29 Jul 2010 19:26:42 +0200 better error and minimizer output
blanchet [Thu, 29 Jul 2010 19:26:42 +0200] rev 38094
better error and minimizer output
Thu, 29 Jul 2010 19:03:46 +0200 deal with chained facts more gracefully
blanchet [Thu, 29 Jul 2010 19:03:46 +0200] rev 38093
deal with chained facts more gracefully
Thu, 29 Jul 2010 18:45:41 +0200 speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
blanchet [Thu, 29 Jul 2010 18:45:41 +0200] rev 38092
speed up the minimizer by using the time taken for the first iteration as a timeout for the following iterations, and fix a subtle bug in "string_for_failure"
Thu, 29 Jul 2010 17:45:22 +0200 work around atomization failures
blanchet [Thu, 29 Jul 2010 17:45:22 +0200] rev 38091
work around atomization failures
Thu, 29 Jul 2010 16:54:46 +0200 fiddle with the fudge factors, to get similar results as before
blanchet [Thu, 29 Jul 2010 16:54:46 +0200] rev 38090
fiddle with the fudge factors, to get similar results as before
Thu, 29 Jul 2010 16:41:32 +0200 perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
blanchet [Thu, 29 Jul 2010 16:41:32 +0200] rev 38089
perform the presimplification done by Metis.make_nnf in Sledgehammer again, to deal with "If" and similar constructs
Thu, 29 Jul 2010 16:11:02 +0200 fix bug with "=" vs. "fequal" introduced by last change (dddb8ba3a1ce)
blanchet [Thu, 29 Jul 2010 16:11:02 +0200] rev 38088
fix bug with "=" vs. "fequal" introduced by last change (dddb8ba3a1ce)
Thu, 29 Jul 2010 15:50:26 +0200 generate correct names for "$true" and "$false";
blanchet [Thu, 29 Jul 2010 15:50:26 +0200] rev 38087
generate correct names for "$true" and "$false"; this was lost somewhere in the non-clausification
Thu, 29 Jul 2010 15:37:27 +0200 don't assume canonical rule format
blanchet [Thu, 29 Jul 2010 15:37:27 +0200] rev 38086
don't assume canonical rule format
Thu, 29 Jul 2010 14:53:55 +0200 avoid "clause" and "cnf" terminology where it no longer makes sense
blanchet [Thu, 29 Jul 2010 14:53:55 +0200] rev 38085
avoid "clause" and "cnf" terminology where it no longer makes sense
Thu, 29 Jul 2010 14:42:09 +0200 "axiom_clauses" -> "axioms" (these are no longer clauses)
blanchet [Thu, 29 Jul 2010 14:42:09 +0200] rev 38084
"axiom_clauses" -> "axioms" (these are no longer clauses)
Thu, 29 Jul 2010 14:39:43 +0200 remove the "extra_clauses" business introduced in 19a5f1c8a844;
blanchet [Thu, 29 Jul 2010 14:39:43 +0200] rev 38083
remove the "extra_clauses" business introduced in 19a5f1c8a844; it isn't working reliably because of: * relevance_override * it is ignored anyway by TPTP generator A better solution would/will be to ensure monotonicity: extra axioms not used in an ATP proof shouldn't make the rest of the problem provable
Thu, 29 Jul 2010 18:16:35 +0200 adapting output for first solution
bulwahn [Thu, 29 Jul 2010 18:16:35 +0200] rev 38082
adapting output for first solution
Thu, 29 Jul 2010 17:27:59 +0200 removing pointless type information in internal prolog terms
bulwahn [Thu, 29 Jul 2010 17:27:59 +0200] rev 38081
removing pointless type information in internal prolog terms
Thu, 29 Jul 2010 17:27:58 +0200 cleaning example file; more natural ordering of variable names
bulwahn [Thu, 29 Jul 2010 17:27:58 +0200] rev 38080
cleaning example file; more natural ordering of variable names
(0) -30000 -10000 -3000 -1000 -300 -100 -50 -28 +28 +50 +100 +300 +1000 +3000 +10000 +30000 tip