TSTP Solution File: FLD003-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:39:40 EDT 2024
% Result : Unsatisfiable 2.38s 0.85s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 49 ( 13 unt; 0 nHn; 49 RR)
% Number of literals : 106 ( 0 equ; 63 neg)
% Maximal clause size : 4 ( 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 : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',transitivity_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',existence_of_identity_addition) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',symmetry_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',existence_of_inverse_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',compatibility_of_equality_and_addition) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',well_definedness_of_additive_identity) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',commutativity_addition) ).
cnf(add_not_equal_to_a_3,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',add_not_equal_to_a_3) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',well_definedness_of_additive_inverse) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',b_is_defined) ).
cnf(well_definedness_of_addition,axiom,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.GephvKYQU9/E---3.1_25713.p',well_definedness_of_addition) ).
cnf(c_0_12,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_13,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_14,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_15,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_16,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
c_0_12 ).
cnf(c_0_17,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_13 ).
cnf(c_0_18,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
c_0_14 ).
cnf(c_0_19,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_15 ).
cnf(c_0_20,plain,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_21,plain,
( equalish(X1,X2)
| ~ defined(X2)
| ~ equalish(X1,add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( equalish(additive_identity,add(X1,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_24,plain,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
c_0_20 ).
cnf(c_0_25,plain,
( equalish(additive_identity,additive_inverse(additive_identity))
| ~ defined(additive_inverse(additive_identity)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( equalish(add(X1,X2),X2)
| ~ defined(X2)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_27,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_28,plain,
( equalish(additive_inverse(additive_identity),additive_identity)
| ~ defined(additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
inference(fof_simplification,[status(thm)],[add_not_equal_to_a_3]) ).
cnf(c_0_30,plain,
( equalish(X1,X2)
| ~ defined(X2)
| ~ equalish(X1,add(X3,X2))
| ~ equalish(X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_31,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_27 ).
cnf(c_0_32,plain,
( equalish(X1,additive_identity)
| ~ defined(additive_inverse(additive_identity))
| ~ equalish(X1,additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_33,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_34,negated_conjecture,
~ equalish(add(a,add(b,additive_inverse(b))),a),
c_0_29 ).
cnf(c_0_35,plain,
( equalish(add(X1,X2),X1)
| ~ defined(X1)
| ~ defined(X2)
| ~ equalish(X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_37,plain,
( equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_38,plain,
( equalish(additive_identity,additive_identity)
| ~ defined(additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_32,c_0_25]) ).
cnf(c_0_39,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
( ~ defined(add(b,additive_inverse(b)))
| ~ equalish(add(b,additive_inverse(b)),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,plain,
( equalish(add(X1,additive_inverse(X1)),X2)
| ~ defined(X1)
| ~ equalish(X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_18,c_0_37]) ).
cnf(c_0_42,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_43,plain,
equalish(additive_identity,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_44,plain,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_45,negated_conjecture,
~ defined(add(b,additive_inverse(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_46,plain,
( defined(add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_44 ).
cnf(c_0_47,negated_conjecture,
~ defined(additive_inverse(b)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD003-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n022.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 13:34:42 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 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.GephvKYQU9/E---3.1_25713.p
% 2.38/0.85 # Version: 3.1.0
% 2.38/0.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.38/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.38/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.38/0.85 # Starting new_bool_3 with 300s (1) cores
% 2.38/0.85 # Starting new_bool_1 with 300s (1) cores
% 2.38/0.85 # Starting sh5l with 300s (1) cores
% 2.38/0.85 # new_bool_3 with pid 25855 completed with status 0
% 2.38/0.85 # Result found by new_bool_3
% 2.38/0.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.38/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.38/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.38/0.85 # Starting new_bool_3 with 300s (1) cores
% 2.38/0.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.38/0.85 # Search class: FGUNF-FFMS21-MFFFFFNN
% 2.38/0.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.38/0.85 # Starting SAT001_MinMin_p005000_rr_RG with 75s (1) cores
% 2.38/0.85 # SAT001_MinMin_p005000_rr_RG with pid 25860 completed with status 0
% 2.38/0.85 # Result found by SAT001_MinMin_p005000_rr_RG
% 2.38/0.85 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.38/0.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.38/0.85 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.38/0.85 # Starting new_bool_3 with 300s (1) cores
% 2.38/0.85 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.38/0.85 # Search class: FGUNF-FFMS21-MFFFFFNN
% 2.38/0.85 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.38/0.85 # Starting SAT001_MinMin_p005000_rr_RG with 75s (1) cores
% 2.38/0.85 # Preprocessing time : 0.001 s
% 2.38/0.85 # Presaturation interreduction done
% 2.38/0.85
% 2.38/0.85 # Proof found!
% 2.38/0.85 # SZS status Unsatisfiable
% 2.38/0.85 # SZS output start CNFRefutation
% See solution above
% 2.38/0.85 # Parsed axioms : 30
% 2.38/0.85 # Removed by relevancy pruning/SinE : 5
% 2.38/0.85 # Initial clauses : 25
% 2.38/0.85 # Removed in clause preprocessing : 0
% 2.38/0.85 # Initial clauses in saturation : 25
% 2.38/0.85 # Processed clauses : 4135
% 2.38/0.85 # ...of these trivial : 9
% 2.38/0.85 # ...subsumed : 3125
% 2.38/0.85 # ...remaining for further processing : 1001
% 2.38/0.85 # Other redundant clauses eliminated : 0
% 2.38/0.85 # Clauses deleted for lack of memory : 0
% 2.38/0.85 # Backward-subsumed : 43
% 2.38/0.85 # Backward-rewritten : 4
% 2.38/0.85 # Generated clauses : 27065
% 2.38/0.85 # ...of the previous two non-redundant : 24123
% 2.38/0.85 # ...aggressively subsumed : 0
% 2.38/0.85 # Contextual simplify-reflections : 35
% 2.38/0.85 # Paramodulations : 27065
% 2.38/0.85 # Factorizations : 0
% 2.38/0.85 # NegExts : 0
% 2.38/0.85 # Equation resolutions : 0
% 2.38/0.85 # Disequality decompositions : 0
% 2.38/0.85 # Total rewrite steps : 13081
% 2.38/0.85 # ...of those cached : 13065
% 2.38/0.85 # Propositional unsat checks : 0
% 2.38/0.85 # Propositional check models : 0
% 2.38/0.85 # Propositional check unsatisfiable : 0
% 2.38/0.85 # Propositional clauses : 0
% 2.38/0.85 # Propositional clauses after purity: 0
% 2.38/0.85 # Propositional unsat core size : 0
% 2.38/0.85 # Propositional preprocessing time : 0.000
% 2.38/0.85 # Propositional encoding time : 0.000
% 2.38/0.85 # Propositional solver time : 0.000
% 2.38/0.85 # Success case prop preproc time : 0.000
% 2.38/0.85 # Success case prop encoding time : 0.000
% 2.38/0.85 # Success case prop solver time : 0.000
% 2.38/0.85 # Current number of processed clauses : 929
% 2.38/0.85 # Positive orientable unit clauses : 16
% 2.38/0.85 # Positive unorientable unit clauses: 0
% 2.38/0.85 # Negative unit clauses : 3
% 2.38/0.85 # Non-unit-clauses : 910
% 2.38/0.85 # Current number of unprocessed clauses: 19976
% 2.38/0.85 # ...number of literals in the above : 88989
% 2.38/0.85 # Current number of archived formulas : 0
% 2.38/0.85 # Current number of archived clauses : 72
% 2.38/0.85 # Clause-clause subsumption calls (NU) : 66756
% 2.38/0.85 # Rec. Clause-clause subsumption calls : 47833
% 2.38/0.85 # Non-unit clause-clause subsumptions : 3202
% 2.38/0.85 # Unit Clause-clause subsumption calls : 113
% 2.38/0.85 # Rewrite failures with RHS unbound : 0
% 2.38/0.85 # BW rewrite match attempts : 5
% 2.38/0.85 # BW rewrite match successes : 3
% 2.38/0.85 # Condensation attempts : 0
% 2.38/0.85 # Condensation successes : 0
% 2.38/0.85 # Termbank termtop insertions : 404451
% 2.38/0.85 # Search garbage collected termcells : 87
% 2.38/0.85
% 2.38/0.85 # -------------------------------------------------
% 2.38/0.85 # User time : 0.307 s
% 2.38/0.85 # System time : 0.020 s
% 2.38/0.85 # Total time : 0.327 s
% 2.38/0.85 # Maximum resident set size: 1724 pages
% 2.38/0.85
% 2.38/0.85 # -------------------------------------------------
% 2.38/0.85 # User time : 0.308 s
% 2.38/0.85 # System time : 0.023 s
% 2.38/0.85 # Total time : 0.331 s
% 2.38/0.85 # Maximum resident set size: 1712 pages
% 2.38/0.85 % E---3.1 exiting
% 2.38/0.85 % E exiting
%------------------------------------------------------------------------------