TSTP Solution File: FLD070-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD070-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:17 EDT 2023
% Result : Timeout 269.89s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 43 ( 20 unt; 2 nHn; 43 RR)
% Number of literals : 81 ( 0 equ; 38 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',transitivity_of_equality) ).
cnf(add_equals_c_4,negated_conjecture,
equalish(add(a,b),c),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',add_equals_c_4) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',commutativity_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',b_is_defined) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',symmetry_of_equality) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',compatibility_of_equality_and_order_relation) ).
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.GbnnzEkqhW/E---3.1_1148.p',totality_of_order_relation) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',c_is_defined) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',transitivity_of_order_relation) ).
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/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_6,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',less_or_equal_6) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',existence_of_identity_addition) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',less_or_equal_5) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(additive_identity,c),
file('/export/starexec/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p',not_less_or_equal_7) ).
cnf(c_0_15,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_16,negated_conjecture,
equalish(add(a,b),c),
add_equals_c_4 ).
cnf(c_0_17,negated_conjecture,
( equalish(X1,c)
| ~ equalish(X1,add(a,b)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_19,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_20,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_21,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_22,negated_conjecture,
equalish(add(b,a),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_24,negated_conjecture,
equalish(c,add(b,a)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_26,negated_conjecture,
( less_or_equal(add(b,a),X1)
| ~ less_or_equal(c,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_25]) ).
cnf(c_0_28,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_29,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_30,negated_conjecture,
less_or_equal(add(b,a),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_31,axiom,
( less_or_equal(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ less_or_equal(X1,X3) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_32,negated_conjecture,
less_or_equal(additive_identity,b),
less_or_equal_6 ).
cnf(c_0_33,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_34,negated_conjecture,
( less_or_equal(X1,c)
| ~ less_or_equal(X1,add(b,a)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( less_or_equal(add(additive_identity,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( less_or_equal(X1,X2)
| ~ less_or_equal(add(additive_identity,X1),X2)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
less_or_equal(add(additive_identity,a),c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19])]) ).
cnf(c_0_38,negated_conjecture,
less_or_equal(a,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_19])]) ).
cnf(c_0_39,negated_conjecture,
( less_or_equal(X1,c)
| ~ less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
less_or_equal(additive_identity,a),
less_or_equal_5 ).
cnf(c_0_41,negated_conjecture,
~ less_or_equal(additive_identity,c),
not_less_or_equal_7 ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : FLD070-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 23:24:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.GbnnzEkqhW/E---3.1_1148.p
% 269.89/300.09 # Version: 3.1pre001
% 269.89/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 269.89/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 269.89/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 269.89/300.09 # Starting new_bool_3 with 300s (1) cores
% 269.89/300.09 # Starting new_bool_1 with 300s (1) cores
% 269.89/300.09 # Starting sh5l with 300s (1) cores
% 269.89/300.09 # sh5l with pid 1230 completed with status 0
% 269.89/300.09 # Result found by sh5l
% 269.89/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 269.89/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 269.89/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 269.89/300.09 # Starting new_bool_3 with 300s (1) cores
% 269.89/300.09 # Starting new_bool_1 with 300s (1) cores
% 269.89/300.09 # Starting sh5l with 300s (1) cores
% 269.89/300.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 269.89/300.09 # Search class: FGUNF-FFMM21-SFFFFFNN
% 269.89/300.09 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 269.89/300.09 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 269.89/300.09 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 1234 completed with status 0
% 269.89/300.09 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 269.89/300.09 # Preprocessing class: FSMSSMSSSSSNFFN.
% 269.89/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 269.89/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 269.89/300.09 # Starting new_bool_3 with 300s (1) cores
% 269.89/300.09 # Starting new_bool_1 with 300s (1) cores
% 269.89/300.09 # Starting sh5l with 300s (1) cores
% 269.89/300.09 # SinE strategy is gf500_gu_R04_F100_L20000
% 269.89/300.09 # Search class: FGUNF-FFMM21-SFFFFFNN
% 269.89/300.09 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 269.89/300.09 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 118s (1) cores
% 269.89/300.09 # Preprocessing time : 0.001 s
% 269.89/300.09
% 269.89/300.09 # Proof found!
% 269.89/300.09 # SZS status Unsatisfiable
% 269.89/300.09 # SZS output start CNFRefutation
% See solution above
% 269.89/300.09 # Parsed axioms : 34
% 269.89/300.09 # Removed by relevancy pruning/SinE : 0
% 269.89/300.09 # Initial clauses : 34
% 269.89/300.09 # Removed in clause preprocessing : 0
% 269.89/300.09 # Initial clauses in saturation : 34
% 269.89/300.09 # Processed clauses : 290
% 269.89/300.09 # ...of these trivial : 35
% 269.89/300.09 # ...subsumed : 14
% 269.89/300.09 # ...remaining for further processing : 241
% 269.89/300.09 # Other redundant clauses eliminated : 0
% 269.89/300.09 # Clauses deleted for lack of memory : 0
% 269.89/300.09 # Backward-subsumed : 0
% 269.89/300.09 # Backward-rewritten : 7
% 269.89/300.09 # Generated clauses : 1504
% 269.89/300.09 # ...of the previous two non-redundant : 1019
% 269.89/300.09 # ...aggressively subsumed : 0
% 269.89/300.09 # Contextual simplify-reflections : 0
% 269.89/300.09 # Paramodulations : 1502
% 269.89/300.09 # Factorizations : 2
% 269.89/300.09 # NegExts : 0
% 269.89/300.09 # Equation resolutions : 0
% 269.89/300.09 # Total rewrite steps : 945
% 269.89/300.09 # Propositional unsat checks : 0
% 269.89/300.09 # Propositional check models : 0
% 269.89/300.09 # Propositional check unsatisfiable : 0
% 269.89/300.09 # Propositional clauses : 0
% 269.89/300.09 # Propositional clauses after purity: 0
% 269.89/300.09 # Propositional unsat core size : 0
% 269.89/300.09 # Propositional preprocessing time : 0.000
% 269.89/300.09 # Propositional encoding time : 0.000
% 269.89/300.09 # Propositional solver time : 0.000
% 269.89/300.09 # Success case prop preproc time : 0.000
% 269.89/300.09 # Success case prop encoding time : 0.000
% 269.89/300.09 # Success case prop solver time : 0.000
% 269.89/300.09 # Current number of processed clauses : 234
% 269.89/300.09 # Positive orientable unit clauses : 85
% 269.89/300.09 # Positive unorientable unit clauses: 0
% 269.89/300.09 # Negative unit clauses : 2
% 269.89/300.09 # Non-unit-clauses : 147
% 269.89/300.09 # Current number of unprocessed clauses: 762
% 269.89/300.09 # ...number of literals in the above : 1864
% 269.89/300.09 # Current number of archived formulas : 0
% 269.89/300.09 # Current number of archived clauses : 7
% 269.89/300.09 # Clause-clause subsumption calls (NU) : 1858
% 269.89/300.09 # Rec. Clause-clause subsumption calls : 1557
% 269.89/300.09 # Non-unit clause-clause subsumptions : 14
% 269.89/300.09 # Unit Clause-clause subsumption calls : 109
% 269.89/300.09 # Rewrite failures with RHS unbound : 0
% 269.89/300.09 # BW rewrite match attempts : 7
% 269.89/300.09 # BW rewrite match successes : 7
% 269.89/300.09 # Condensation attempts : 0
% 269.89/300.09 # Condensation successes : 0
% 269.89/300.09 # Termbank termtop insertions : 18381
% 269.89/300.09
% 269.89/300.09 # -------------------------------------------------
% 269.89/300.09 # User time : 0.016 s
% 269.89/300.09 # System time : 0.004 s
% 269.89/300.09 # Total time : 0.021 s
% 269.89/300.09 # Maximum resident set size: 1756 pages
% 269.89/300.09
% 269.89/300.09 # -------------------------------------------------
% 269.89/300.09 # User time : 0.017 s
% 269.89/300.09 # System time : 0.007 s
% 269.89/300.09 # Total time : 0.024 s
% 269.89/300.09 # Maximum resident set size: 1700 pages
% 269.89/300.09 % E---3.1 exiting
% 269.89/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------