TSTP Solution File: FLD067-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:15 EDT 2023
% Result : Timeout 0.42s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 14 unt; 2 nHn; 34 RR)
% Number of literals : 65 ( 0 equ; 31 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',symmetry_of_equality) ).
cnf(add_equals_u_5,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',add_equals_u_5) ).
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.MBDMFYQSoo/E---3.1_858.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.MBDMFYQSoo/E---3.1_858.p',totality_of_order_relation) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',u_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.MBDMFYQSoo/E---3.1_858.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.MBDMFYQSoo/E---3.1_858.p',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',less_or_equal_4) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',existence_of_inverse_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',well_definedness_of_additive_inverse) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',a_is_defined) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/tmp/tmp.MBDMFYQSoo/E---3.1_858.p',not_less_or_equal_6) ).
cnf(c_0_12,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_13,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
add_equals_u_5 ).
cnf(c_0_14,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X2)
| ~ equalish(X3,X1) ),
compatibility_of_equality_and_order_relation ).
cnf(c_0_15,negated_conjecture,
equalish(u,add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_17,negated_conjecture,
( less_or_equal(add(b,additive_inverse(a)),X1)
| ~ less_or_equal(u,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_16]) ).
cnf(c_0_19,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_20,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_21,negated_conjecture,
less_or_equal(add(b,additive_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,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_23,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_24,negated_conjecture,
( less_or_equal(X1,u)
| ~ less_or_equal(X1,add(b,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( less_or_equal(add(a,X1),add(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(add(a,additive_inverse(a)),u)
| ~ defined(additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_29,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_30,plain,
( less_or_equal(additive_identity,X1)
| ~ less_or_equal(add(X2,additive_inverse(X2)),X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
less_or_equal(add(a,additive_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
~ less_or_equal(additive_identity,u),
not_less_or_equal_6 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.38 % Computer : n015.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8042.1875MB
% 0.14/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 2400
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Mon Oct 2 23:31:16 EDT 2023
% 0.14/0.38 % CPUTime :
% 0.24/0.47 Running first-order theorem proving
% 0.24/0.47 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.MBDMFYQSoo/E---3.1_858.p
% 0.42/300.10 # Version: 3.1pre001
% 0.42/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.42/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.42/300.10 # Starting sh5l with 300s (1) cores
% 0.42/300.10 # new_bool_3 with pid 987 completed with status 0
% 0.42/300.10 # Result found by new_bool_3
% 0.42/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.42/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/300.10 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.42/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.10 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 131s (1) cores
% 0.42/300.10 # G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with pid 991 completed with status 0
% 0.42/300.10 # Result found by G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.42/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.42/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.42/300.10 # Search class: FGUNF-FFMM21-SFFFFFNN
% 0.42/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.42/300.10 # Starting G-E--_006_C18_F1_PI_AE_Q4_CS_SP_S2S with 131s (1) cores
% 0.42/300.10 # Preprocessing time : 0.001 s
% 0.42/300.10
% 0.42/300.10 # Proof found!
% 0.42/300.10 # SZS status Unsatisfiable
% 0.42/300.10 # SZS output start CNFRefutation
% See solution above
% 0.42/300.10 # Parsed axioms : 33
% 0.42/300.10 # Removed by relevancy pruning/SinE : 5
% 0.42/300.10 # Initial clauses : 28
% 0.42/300.10 # Removed in clause preprocessing : 0
% 0.42/300.10 # Initial clauses in saturation : 28
% 0.42/300.10 # Processed clauses : 278
% 0.42/300.10 # ...of these trivial : 45
% 0.42/300.10 # ...subsumed : 17
% 0.42/300.10 # ...remaining for further processing : 216
% 0.42/300.10 # Other redundant clauses eliminated : 0
% 0.42/300.10 # Clauses deleted for lack of memory : 0
% 0.42/300.10 # Backward-subsumed : 0
% 0.42/300.10 # Backward-rewritten : 9
% 0.42/300.10 # Generated clauses : 1341
% 0.42/300.10 # ...of the previous two non-redundant : 966
% 0.42/300.10 # ...aggressively subsumed : 0
% 0.42/300.10 # Contextual simplify-reflections : 0
% 0.42/300.10 # Paramodulations : 1339
% 0.42/300.10 # Factorizations : 2
% 0.42/300.10 # NegExts : 0
% 0.42/300.10 # Equation resolutions : 0
% 0.42/300.10 # Total rewrite steps : 757
% 0.42/300.10 # Propositional unsat checks : 0
% 0.42/300.10 # Propositional check models : 0
% 0.42/300.10 # Propositional check unsatisfiable : 0
% 0.42/300.10 # Propositional clauses : 0
% 0.42/300.10 # Propositional clauses after purity: 0
% 0.42/300.10 # Propositional unsat core size : 0
% 0.42/300.10 # Propositional preprocessing time : 0.000
% 0.42/300.10 # Propositional encoding time : 0.000
% 0.42/300.10 # Propositional solver time : 0.000
% 0.42/300.10 # Success case prop preproc time : 0.000
% 0.42/300.10 # Success case prop encoding time : 0.000
% 0.42/300.10 # Success case prop solver time : 0.000
% 0.42/300.10 # Current number of processed clauses : 207
% 0.42/300.10 # Positive orientable unit clauses : 71
% 0.42/300.10 # Positive unorientable unit clauses: 0
% 0.42/300.10 # Negative unit clauses : 1
% 0.42/300.10 # Non-unit-clauses : 135
% 0.42/300.10 # Current number of unprocessed clauses: 708
% 0.42/300.10 # ...number of literals in the above : 1793
% 0.42/300.10 # Current number of archived formulas : 0
% 0.42/300.10 # Current number of archived clauses : 9
% 0.42/300.10 # Clause-clause subsumption calls (NU) : 1607
% 0.42/300.10 # Rec. Clause-clause subsumption calls : 1265
% 0.42/300.10 # Non-unit clause-clause subsumptions : 17
% 0.42/300.10 # Unit Clause-clause subsumption calls : 124
% 0.42/300.10 # Rewrite failures with RHS unbound : 0
% 0.42/300.10 # BW rewrite match attempts : 10
% 0.42/300.10 # BW rewrite match successes : 9
% 0.42/300.10 # Condensation attempts : 0
% 0.42/300.10 # Condensation successes : 0
% 0.42/300.10 # Termbank termtop insertions : 17171
% 0.42/300.10
% 0.42/300.10 # -------------------------------------------------
% 0.42/300.10 # User time : 0.013 s
% 0.42/300.10 # System time : 0.002 s
% 0.42/300.10 # Total time : 0.015 s
% 0.42/300.10 # Maximum resident set size: 1756 pages
% 0.42/300.10
% 0.42/300.10 # -------------------------------------------------
% 0.42/300.10 # User time : 0.016 s
% 0.42/300.10 # System time : 0.002 s
% 0.42/300.10 # Total time : 0.018 s
% 0.42/300.10 # Maximum resident set size: 1700 pages
% 0.42/300.10 % E---3.1 exiting
% 0.42/300.11 % E---3.1 exiting
%------------------------------------------------------------------------------