TSTP Solution File: FLD024-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD024-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:29:59 EDT 2023
% Result : Unsatisfiable 21.81s 3.29s
% Output : CNFRefutation 21.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 53 ( 19 unt; 0 nHn; 53 RR)
% Number of literals : 106 ( 0 equ; 55 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',existence_of_identity_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',a_is_defined) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',symmetry_of_equality) ).
cnf(additive_identity_equals_add_3,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',additive_identity_equals_add_3) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',transitivity_of_equality) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',compatibility_of_equality_and_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',b_is_defined) ).
cnf(associativity_addition,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',associativity_addition) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',commutativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',well_definedness_of_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',well_definedness_of_additive_inverse) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',existence_of_inverse_addition) ).
cnf(a_not_equal_to_b_4,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox/tmp/tmp.9y4YecRFrU/E---3.1_6427.p',a_not_equal_to_b_4) ).
cnf(c_0_13,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_14,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_15,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_16,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(a))),
additive_identity_equals_add_3 ).
cnf(c_0_17,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_18,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_addition ).
cnf(c_0_20,negated_conjecture,
equalish(add(b,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( equalish(add(add(b,additive_inverse(a)),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_24,hypothesis,
equalish(add(add(b,additive_inverse(a)),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14])]) ).
cnf(c_0_25,hypothesis,
equalish(add(additive_identity,b),b),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_26,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(add(b,additive_inverse(a)),a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,axiom,
( equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))
| ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3) ),
associativity_addition ).
cnf(c_0_28,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(additive_identity,b)) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_29,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_addition ).
cnf(c_0_30,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
well_definedness_of_addition ).
cnf(c_0_31,hypothesis,
( equalish(add(b,add(additive_inverse(a),a)),a)
| ~ defined(additive_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_14]),c_0_23])]) ).
cnf(c_0_32,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_33,hypothesis,
equalish(add(add(b,additive_inverse(a)),b),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_22]),c_0_23])]) ).
cnf(c_0_34,negated_conjecture,
( equalish(X1,add(b,additive_inverse(a)))
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_35,plain,
( equalish(add(X1,add(X2,X3)),add(add(X2,X3),X1))
| ~ defined(X1)
| ~ defined(X3)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,hypothesis,
equalish(add(b,add(additive_inverse(a),a)),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_14])]) ).
cnf(c_0_37,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_38,hypothesis,
( equalish(X1,b)
| ~ equalish(X1,add(add(b,additive_inverse(a)),b)) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( equalish(add(X1,X2),add(add(b,additive_inverse(a)),X2))
| ~ defined(X2)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_40,plain,
( equalish(X1,add(add(X2,X3),X4))
| ~ defined(X4)
| ~ defined(X3)
| ~ defined(X2)
| ~ equalish(X1,add(X4,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_41,hypothesis,
equalish(a,add(b,add(additive_inverse(a),a))),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_42,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_43,hypothesis,
( equalish(add(X1,a),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_44,negated_conjecture,
( equalish(add(X1,b),b)
| ~ equalish(X1,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_23])]) ).
cnf(c_0_45,hypothesis,
( equalish(a,add(add(additive_inverse(a),a),b))
| ~ defined(additive_inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_23]),c_0_14])]) ).
cnf(c_0_46,hypothesis,
( equalish(X1,additive_identity)
| ~ equalish(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_42]) ).
cnf(c_0_47,hypothesis,
( equalish(add(additive_inverse(X1),a),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
( equalish(X1,b)
| ~ equalish(X1,add(X2,b))
| ~ equalish(X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_44]) ).
cnf(c_0_49,hypothesis,
equalish(a,add(add(additive_inverse(a),a),b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_32]),c_0_14])]) ).
cnf(c_0_50,hypothesis,
equalish(add(additive_inverse(a),a),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_14])]) ).
cnf(c_0_51,negated_conjecture,
~ equalish(a,b),
a_not_equal_to_b_4 ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD024-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.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:43:28 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.9y4YecRFrU/E---3.1_6427.p
% 21.81/3.29 # Version: 3.1pre001
% 21.81/3.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 21.81/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.81/3.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.81/3.29 # Starting new_bool_3 with 300s (1) cores
% 21.81/3.29 # Starting new_bool_1 with 300s (1) cores
% 21.81/3.29 # Starting sh5l with 300s (1) cores
% 21.81/3.29 # new_bool_3 with pid 6506 completed with status 0
% 21.81/3.29 # Result found by new_bool_3
% 21.81/3.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 21.81/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.81/3.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.81/3.29 # Starting new_bool_3 with 300s (1) cores
% 21.81/3.29 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.81/3.29 # Search class: FGUNF-FFMS21-SFFFFFNN
% 21.81/3.29 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 21.81/3.29 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 21.81/3.29 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 6514 completed with status 0
% 21.81/3.29 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 21.81/3.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 21.81/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.81/3.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.81/3.29 # Starting new_bool_3 with 300s (1) cores
% 21.81/3.29 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 21.81/3.29 # Search class: FGUNF-FFMS21-SFFFFFNN
% 21.81/3.29 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 21.81/3.29 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 21.81/3.29 # Preprocessing time : 0.001 s
% 21.81/3.29 # Presaturation interreduction done
% 21.81/3.29
% 21.81/3.29 # Proof found!
% 21.81/3.29 # SZS status Unsatisfiable
% 21.81/3.29 # SZS output start CNFRefutation
% See solution above
% 21.81/3.29 # Parsed axioms : 31
% 21.81/3.29 # Removed by relevancy pruning/SinE : 5
% 21.81/3.29 # Initial clauses : 26
% 21.81/3.29 # Removed in clause preprocessing : 0
% 21.81/3.29 # Initial clauses in saturation : 26
% 21.81/3.29 # Processed clauses : 27656
% 21.81/3.29 # ...of these trivial : 297
% 21.81/3.29 # ...subsumed : 20183
% 21.81/3.29 # ...remaining for further processing : 7176
% 21.81/3.29 # Other redundant clauses eliminated : 0
% 21.81/3.29 # Clauses deleted for lack of memory : 0
% 21.81/3.29 # Backward-subsumed : 3692
% 21.81/3.29 # Backward-rewritten : 61
% 21.81/3.29 # Generated clauses : 150840
% 21.81/3.29 # ...of the previous two non-redundant : 126681
% 21.81/3.29 # ...aggressively subsumed : 0
% 21.81/3.29 # Contextual simplify-reflections : 213
% 21.81/3.29 # Paramodulations : 150820
% 21.81/3.29 # Factorizations : 20
% 21.81/3.29 # NegExts : 0
% 21.81/3.29 # Equation resolutions : 0
% 21.81/3.29 # Total rewrite steps : 76420
% 21.81/3.29 # Propositional unsat checks : 1
% 21.81/3.29 # Propositional check models : 0
% 21.81/3.29 # Propositional check unsatisfiable : 0
% 21.81/3.29 # Propositional clauses : 0
% 21.81/3.29 # Propositional clauses after purity: 0
% 21.81/3.29 # Propositional unsat core size : 0
% 21.81/3.29 # Propositional preprocessing time : 0.000
% 21.81/3.29 # Propositional encoding time : 0.031
% 21.81/3.29 # Propositional solver time : 0.028
% 21.81/3.29 # Success case prop preproc time : 0.000
% 21.81/3.29 # Success case prop encoding time : 0.000
% 21.81/3.29 # Success case prop solver time : 0.000
% 21.81/3.29 # Current number of processed clauses : 3397
% 21.81/3.29 # Positive orientable unit clauses : 724
% 21.81/3.29 # Positive unorientable unit clauses: 0
% 21.81/3.29 # Negative unit clauses : 286
% 21.81/3.29 # Non-unit-clauses : 2387
% 21.81/3.29 # Current number of unprocessed clauses: 96450
% 21.81/3.29 # ...number of literals in the above : 300351
% 21.81/3.29 # Current number of archived formulas : 0
% 21.81/3.29 # Current number of archived clauses : 3779
% 21.81/3.29 # Clause-clause subsumption calls (NU) : 3117096
% 21.81/3.29 # Rec. Clause-clause subsumption calls : 2218627
% 21.81/3.29 # Non-unit clause-clause subsumptions : 17471
% 21.81/3.29 # Unit Clause-clause subsumption calls : 233004
% 21.81/3.29 # Rewrite failures with RHS unbound : 0
% 21.81/3.29 # BW rewrite match attempts : 2416
% 21.81/3.29 # BW rewrite match successes : 65
% 21.81/3.29 # Condensation attempts : 0
% 21.81/3.29 # Condensation successes : 0
% 21.81/3.29 # Termbank termtop insertions : 2429911
% 21.81/3.29
% 21.81/3.29 # -------------------------------------------------
% 21.81/3.29 # User time : 2.525 s
% 21.81/3.29 # System time : 0.067 s
% 21.81/3.29 # Total time : 2.592 s
% 21.81/3.29 # Maximum resident set size: 1760 pages
% 21.81/3.29
% 21.81/3.29 # -------------------------------------------------
% 21.81/3.29 # User time : 2.528 s
% 21.81/3.29 # System time : 0.068 s
% 21.81/3.29 # Total time : 2.596 s
% 21.81/3.29 # Maximum resident set size: 1696 pages
% 21.81/3.29 % E---3.1 exiting
% 21.81/3.29 % E---3.1 exiting
%------------------------------------------------------------------------------