TSTP Solution File: FLD068-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD068-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:30:47 EDT 2023
% Result : Unsatisfiable 0.99s 0.62s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 56 ( 22 unt; 3 nHn; 56 RR)
% Number of literals : 120 ( 0 equ; 63 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',existence_of_inverse_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',a_is_defined) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',commutativity_addition) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',compatibility_of_order_relation_and_addition) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',totality_of_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',well_definedness_of_additive_inverse) ).
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',totality_of_order_relation) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',b_is_defined) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',not_less_or_equal_4) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',existence_of_identity_addition) ).
cnf(antisymmetry_of_order_relation,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',antisymmetry_of_order_relation) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',less_or_equal_3) ).
cnf(associativity_addition_1,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',associativity_addition_1) ).
cnf(associativity_addition_2,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',associativity_addition_2) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p',well_definedness_of_additive_identity) ).
cnf(c_0_15,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_16,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_17,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_18,hypothesis,
sum(additive_inverse(a),a,additive_identity),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_20,hypothesis,
sum(a,additive_inverse(a),additive_identity),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_addition ).
cnf(c_0_22,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_23,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_24,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_25,hypothesis,
( less_or_equal(X1,additive_identity)
| ~ less_or_equal(X2,a)
| ~ sum(X2,additive_inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( sum(X1,additive_inverse(X2),add(X1,additive_inverse(X2)))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
( less_or_equal(X1,b)
| less_or_equal(b,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ less_or_equal(a,b),
not_less_or_equal_4 ).
cnf(c_0_29,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_30,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_31,negated_conjecture,
less_or_equal(additive_identity,add(b,additive_inverse(a))),
less_or_equal_3 ).
cnf(c_0_32,hypothesis,
( less_or_equal(add(X1,additive_inverse(a)),additive_identity)
| ~ less_or_equal(X1,a)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16])]) ).
cnf(c_0_33,hypothesis,
less_or_equal(b,a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_16]),c_0_28]) ).
cnf(c_0_34,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_35,hypothesis,
sum(additive_identity,a,a),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_36,axiom,
( sum(X1,X2,X3)
| ~ sum(X4,X5,X1)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X6,X3) ),
associativity_addition_2 ).
cnf(c_0_37,negated_conjecture,
( sum(additive_identity,add(b,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(b,additive_inverse(a)),additive_identity) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,hypothesis,
less_or_equal(add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_33])]) ).
cnf(c_0_39,hypothesis,
( sum(X1,X2,a)
| ~ sum(X3,a,X2)
| ~ sum(X1,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( sum(X1,additive_inverse(X2),X3)
| ~ defined(X4)
| ~ defined(X2)
| ~ sum(X5,add(X4,additive_inverse(X2)),X3)
| ~ sum(X5,X4,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_41,negated_conjecture,
sum(additive_identity,add(b,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_42,hypothesis,
sum(additive_identity,b,b),
inference(spm,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_43,hypothesis,
( sum(X1,additive_identity,a)
| ~ sum(X1,additive_inverse(a),additive_identity) ),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_44,negated_conjecture,
( sum(X1,additive_inverse(a),additive_identity)
| ~ sum(additive_identity,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_24]),c_0_16])]) ).
cnf(c_0_45,hypothesis,
( sum(X1,X2,b)
| ~ sum(X3,b,X2)
| ~ sum(X1,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_34,c_0_42]) ).
cnf(c_0_46,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_47,hypothesis,
sum(b,additive_identity,b),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_48,hypothesis,
( sum(X1,additive_identity,a)
| ~ sum(additive_identity,b,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,hypothesis,
( sum(X1,b,b)
| ~ sum(X1,additive_identity,additive_identity) ),
inference(spm,[status(thm)],[c_0_45,c_0_42]) ).
cnf(c_0_50,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_51,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_23]) ).
cnf(c_0_52,hypothesis,
( less_or_equal(X1,b)
| ~ less_or_equal(X2,b)
| ~ sum(X2,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_47]) ).
cnf(c_0_53,hypothesis,
sum(b,additive_identity,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_54,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_55,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : FLD068-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.04/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 23:12:13 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.evvKFnxhoK/E---3.1_17206.p
% 0.99/0.62 # Version: 3.1pre001
% 0.99/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.62 # Starting sh5l with 300s (1) cores
% 0.99/0.62 # new_bool_1 with pid 17363 completed with status 0
% 0.99/0.62 # Result found by new_bool_1
% 0.99/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.62 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.99/0.62 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.62 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.99/0.62 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 17369 completed with status 0
% 0.99/0.62 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.99/0.62 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.99/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.99/0.62 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.99/0.62 # Starting new_bool_3 with 300s (1) cores
% 0.99/0.62 # Starting new_bool_1 with 300s (1) cores
% 0.99/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.99/0.62 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.99/0.62 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.99/0.62 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.99/0.62 # Preprocessing time : 0.001 s
% 0.99/0.62 # Presaturation interreduction done
% 0.99/0.62
% 0.99/0.62 # Proof found!
% 0.99/0.62 # SZS status Unsatisfiable
% 0.99/0.62 # SZS output start CNFRefutation
% See solution above
% 0.99/0.62 # Parsed axioms : 30
% 0.99/0.62 # Removed by relevancy pruning/SinE : 7
% 0.99/0.62 # Initial clauses : 23
% 0.99/0.62 # Removed in clause preprocessing : 0
% 0.99/0.62 # Initial clauses in saturation : 23
% 0.99/0.62 # Processed clauses : 1695
% 0.99/0.62 # ...of these trivial : 6
% 0.99/0.62 # ...subsumed : 726
% 0.99/0.62 # ...remaining for further processing : 963
% 0.99/0.62 # Other redundant clauses eliminated : 0
% 0.99/0.62 # Clauses deleted for lack of memory : 0
% 0.99/0.62 # Backward-subsumed : 71
% 0.99/0.62 # Backward-rewritten : 17
% 0.99/0.62 # Generated clauses : 5175
% 0.99/0.62 # ...of the previous two non-redundant : 4433
% 0.99/0.62 # ...aggressively subsumed : 0
% 0.99/0.62 # Contextual simplify-reflections : 65
% 0.99/0.62 # Paramodulations : 5159
% 0.99/0.62 # Factorizations : 16
% 0.99/0.62 # NegExts : 0
% 0.99/0.62 # Equation resolutions : 0
% 0.99/0.62 # Total rewrite steps : 1153
% 0.99/0.62 # Propositional unsat checks : 0
% 0.99/0.62 # Propositional check models : 0
% 0.99/0.62 # Propositional check unsatisfiable : 0
% 0.99/0.62 # Propositional clauses : 0
% 0.99/0.62 # Propositional clauses after purity: 0
% 0.99/0.62 # Propositional unsat core size : 0
% 0.99/0.62 # Propositional preprocessing time : 0.000
% 0.99/0.62 # Propositional encoding time : 0.000
% 0.99/0.62 # Propositional solver time : 0.000
% 0.99/0.62 # Success case prop preproc time : 0.000
% 0.99/0.62 # Success case prop encoding time : 0.000
% 0.99/0.62 # Success case prop solver time : 0.000
% 0.99/0.62 # Current number of processed clauses : 852
% 0.99/0.62 # Positive orientable unit clauses : 94
% 0.99/0.62 # Positive unorientable unit clauses: 0
% 0.99/0.62 # Negative unit clauses : 2
% 0.99/0.62 # Non-unit-clauses : 756
% 0.99/0.62 # Current number of unprocessed clauses: 2712
% 0.99/0.62 # ...number of literals in the above : 9586
% 0.99/0.62 # Current number of archived formulas : 0
% 0.99/0.62 # Current number of archived clauses : 111
% 0.99/0.62 # Clause-clause subsumption calls (NU) : 80499
% 0.99/0.62 # Rec. Clause-clause subsumption calls : 57180
% 0.99/0.62 # Non-unit clause-clause subsumptions : 849
% 0.99/0.62 # Unit Clause-clause subsumption calls : 1057
% 0.99/0.62 # Rewrite failures with RHS unbound : 0
% 0.99/0.62 # BW rewrite match attempts : 92
% 0.99/0.62 # BW rewrite match successes : 2
% 0.99/0.62 # Condensation attempts : 0
% 0.99/0.62 # Condensation successes : 0
% 0.99/0.62 # Termbank termtop insertions : 73495
% 0.99/0.62
% 0.99/0.62 # -------------------------------------------------
% 0.99/0.62 # User time : 0.136 s
% 0.99/0.62 # System time : 0.007 s
% 0.99/0.62 # Total time : 0.143 s
% 0.99/0.62 # Maximum resident set size: 1608 pages
% 0.99/0.62
% 0.99/0.62 # -------------------------------------------------
% 0.99/0.62 # User time : 0.139 s
% 0.99/0.62 # System time : 0.007 s
% 0.99/0.62 # Total time : 0.146 s
% 0.99/0.62 # Maximum resident set size: 1696 pages
% 0.99/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------