TSTP Solution File: FLD064-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD064-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:40:07 EDT 2024
% Result : Unsatisfiable 2.11s 0.73s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of clauses : 46 ( 14 unt; 3 nHn; 46 RR)
% Number of literals : 94 ( 0 equ; 48 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',totality_of_order_relation) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',compatibility_of_equality_and_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',well_definedness_of_additive_identity) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',existence_of_inverse_addition) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',transitivity_of_order_relation) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',symmetry_of_equality) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',a_is_defined) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_2,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',less_or_equal_2) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',well_definedness_of_additive_inverse) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',existence_of_identity_addition) ).
cnf(not_less_or_equal_3,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p',not_less_or_equal_3) ).
cnf(c_0_12,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_13,plain,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
c_0_12 ).
cnf(c_0_14,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_15,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_13]) ).
cnf(c_0_16,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_17,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_18,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_19,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
c_0_14 ).
cnf(c_0_20,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_22,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_17 ).
cnf(c_0_23,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_24,plain,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_25,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
c_0_18 ).
cnf(c_0_26,plain,
( less_or_equal(X1,additive_identity)
| ~ equalish(additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_21 ).
cnf(c_0_28,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_2 ).
cnf(c_0_31,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_32,plain,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X1,X2)
| ~ equalish(additive_identity,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,hypothesis,
equalish(additive_identity,add(a,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( less_or_equal(add(additive_identity,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_31 ).
cnf(c_0_36,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( less_or_equal(add(additive_identity,additive_inverse(X1)),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_39,hypothesis,
less_or_equal(add(additive_identity,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]) ).
cnf(c_0_40,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(fof_simplification,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_0_42,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ equalish(add(additive_identity,additive_inverse(a)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_43,plain,
( equalish(add(additive_identity,additive_inverse(X1)),additive_inverse(X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
~ less_or_equal(additive_inverse(a),additive_identity),
c_0_41 ).
cnf(c_0_45,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : FLD064-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri May 3 13:21:48 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.17/0.45 Running first-order theorem proving
% 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2zuSTW0wX5/E---3.1_29738.p
% 2.11/0.73 # Version: 3.1.0
% 2.11/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.11/0.73 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.73 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.73 # Starting sh5l with 300s (1) cores
% 2.11/0.73 # new_bool_1 with pid 29819 completed with status 0
% 2.11/0.73 # Result found by new_bool_1
% 2.11/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.11/0.73 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.73 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.11/0.73 # Search class: FGUNF-FFMS21-SFFFFFNN
% 2.11/0.73 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.11/0.73 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 2.11/0.73 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 29825 completed with status 0
% 2.11/0.73 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 2.11/0.73 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.11/0.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.11/0.73 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.11/0.73 # Starting new_bool_3 with 300s (1) cores
% 2.11/0.73 # Starting new_bool_1 with 300s (1) cores
% 2.11/0.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.11/0.73 # Search class: FGUNF-FFMS21-SFFFFFNN
% 2.11/0.73 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.11/0.73 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 2.11/0.73 # Preprocessing time : 0.001 s
% 2.11/0.73 # Presaturation interreduction done
% 2.11/0.73
% 2.11/0.73 # Proof found!
% 2.11/0.73 # SZS status Unsatisfiable
% 2.11/0.73 # SZS output start CNFRefutation
% See solution above
% 2.11/0.73 # Parsed axioms : 30
% 2.11/0.73 # Removed by relevancy pruning/SinE : 5
% 2.11/0.73 # Initial clauses : 25
% 2.11/0.73 # Removed in clause preprocessing : 0
% 2.11/0.73 # Initial clauses in saturation : 25
% 2.11/0.73 # Processed clauses : 3560
% 2.11/0.73 # ...of these trivial : 48
% 2.11/0.73 # ...subsumed : 2130
% 2.11/0.73 # ...remaining for further processing : 1382
% 2.11/0.73 # Other redundant clauses eliminated : 0
% 2.11/0.73 # Clauses deleted for lack of memory : 0
% 2.11/0.73 # Backward-subsumed : 369
% 2.11/0.73 # Backward-rewritten : 63
% 2.11/0.73 # Generated clauses : 11705
% 2.11/0.73 # ...of the previous two non-redundant : 8995
% 2.11/0.73 # ...aggressively subsumed : 0
% 2.11/0.73 # Contextual simplify-reflections : 3
% 2.11/0.73 # Paramodulations : 11687
% 2.11/0.73 # Factorizations : 18
% 2.11/0.73 # NegExts : 0
% 2.11/0.73 # Equation resolutions : 0
% 2.11/0.73 # Disequality decompositions : 0
% 2.11/0.73 # Total rewrite steps : 5797
% 2.11/0.73 # ...of those cached : 5618
% 2.11/0.73 # Propositional unsat checks : 0
% 2.11/0.73 # Propositional check models : 0
% 2.11/0.73 # Propositional check unsatisfiable : 0
% 2.11/0.73 # Propositional clauses : 0
% 2.11/0.73 # Propositional clauses after purity: 0
% 2.11/0.73 # Propositional unsat core size : 0
% 2.11/0.73 # Propositional preprocessing time : 0.000
% 2.11/0.73 # Propositional encoding time : 0.000
% 2.11/0.73 # Propositional solver time : 0.000
% 2.11/0.73 # Success case prop preproc time : 0.000
% 2.11/0.73 # Success case prop encoding time : 0.000
% 2.11/0.73 # Success case prop solver time : 0.000
% 2.11/0.73 # Current number of processed clauses : 925
% 2.11/0.73 # Positive orientable unit clauses : 201
% 2.11/0.73 # Positive unorientable unit clauses: 0
% 2.11/0.73 # Negative unit clauses : 12
% 2.11/0.73 # Non-unit-clauses : 712
% 2.11/0.73 # Current number of unprocessed clauses: 5379
% 2.11/0.73 # ...number of literals in the above : 17379
% 2.11/0.73 # Current number of archived formulas : 0
% 2.11/0.73 # Current number of archived clauses : 457
% 2.11/0.73 # Clause-clause subsumption calls (NU) : 76297
% 2.11/0.73 # Rec. Clause-clause subsumption calls : 63319
% 2.11/0.73 # Non-unit clause-clause subsumptions : 1923
% 2.11/0.73 # Unit Clause-clause subsumption calls : 2456
% 2.11/0.73 # Rewrite failures with RHS unbound : 0
% 2.11/0.73 # BW rewrite match attempts : 255
% 2.11/0.73 # BW rewrite match successes : 63
% 2.11/0.73 # Condensation attempts : 0
% 2.11/0.73 # Condensation successes : 0
% 2.11/0.73 # Termbank termtop insertions : 160047
% 2.11/0.73 # Search garbage collected termcells : 87
% 2.11/0.73
% 2.11/0.73 # -------------------------------------------------
% 2.11/0.73 # User time : 0.249 s
% 2.11/0.73 # System time : 0.006 s
% 2.11/0.73 # Total time : 0.255 s
% 2.11/0.73 # Maximum resident set size: 1724 pages
% 2.11/0.73
% 2.11/0.73 # -------------------------------------------------
% 2.11/0.73 # User time : 0.249 s
% 2.11/0.73 # System time : 0.008 s
% 2.11/0.73 # Total time : 0.257 s
% 2.11/0.73 # Maximum resident set size: 1712 pages
% 2.11/0.73 % E---3.1 exiting
% 2.11/0.73 % E exiting
%------------------------------------------------------------------------------