TSTP Solution File: FLD019-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD019-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Mon May 20 19:52:19 EDT 2024
% Result : Unsatisfiable 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 49 ( 16 unt; 0 nHn; 49 RR)
% Number of literals : 92 ( 0 equ; 48 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(additive_inverse_equals_additive_identity_2,negated_conjecture,
equalish(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse_equals_additive_identity_2) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(compatibility_of_equality_and_addition,axiom,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
cnf(commutativity_addition,axiom,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(c_0_10,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_11,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_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(X1,X2)
| ~ equalish(X2,X1) ),
c_0_10 ).
cnf(c_0_14,negated_conjecture,
equalish(additive_inverse(a),additive_identity),
additive_inverse_equals_additive_identity_2 ).
cnf(c_0_15,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_11 ).
cnf(c_0_16,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_17,plain,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
c_0_12 ).
cnf(c_0_18,negated_conjecture,
equalish(additive_identity,additive_inverse(a)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,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_20,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( equalish(X1,additive_inverse(a))
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
c_0_19 ).
cnf(c_0_23,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_24,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( equalish(additive_inverse(a),X1)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( equalish(add(additive_inverse(a),X1),add(additive_identity,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_27,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_23 ).
cnf(c_0_28,hypothesis,
equalish(a,add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( equalish(additive_inverse(a),a)
| ~ equalish(add(additive_identity,a),additive_identity) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_3]) ).
cnf(c_0_31,hypothesis,
equalish(add(additive_inverse(a),a),add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
cnf(c_0_32,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
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,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_35,hypothesis,
( equalish(X1,add(additive_identity,a))
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_36,negated_conjecture,
( equalish(X1,additive_identity)
| ~ equalish(X1,additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( equalish(a,additive_inverse(a))
| ~ equalish(add(additive_identity,a),additive_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
~ equalish(a,additive_identity),
c_0_30 ).
cnf(c_0_39,hypothesis,
equalish(add(additive_inverse(a),a),a),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_40,plain,
( equalish(add(X1,X2),add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
c_0_32 ).
cnf(c_0_41,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_33 ).
cnf(c_0_42,hypothesis,
( equalish(X1,additive_identity)
| ~ equalish(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_34]) ).
cnf(c_0_43,hypothesis,
( equalish(add(additive_identity,a),X1)
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
~ equalish(add(additive_identity,a),additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,hypothesis,
( equalish(X1,a)
| ~ equalish(X1,add(additive_inverse(a),a)) ),
inference(spm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_46,plain,
( equalish(add(X1,additive_inverse(X2)),add(additive_inverse(X2),X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,hypothesis,
~ equalish(add(a,additive_inverse(a)),a),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_16])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD019-1 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat May 18 21:30:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.55 # Version: 3.1.0
% 0.19/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.55 # Starting sh5l with 300s (1) cores
% 0.19/0.55 # new_bool_3 with pid 25900 completed with status 0
% 0.19/0.55 # Result found by new_bool_3
% 0.19/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.55 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.55 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.19/0.55 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 25904 completed with status 0
% 0.19/0.55 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.19/0.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.55 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.19/0.55 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.55 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 0.19/0.55 # Preprocessing time : 0.002 s
% 0.19/0.55 # Presaturation interreduction done
% 0.19/0.55
% 0.19/0.55 # Proof found!
% 0.19/0.55 # SZS status Unsatisfiable
% 0.19/0.55 # SZS output start CNFRefutation
% See solution above
% 0.19/0.55 # Parsed axioms : 30
% 0.19/0.55 # Removed by relevancy pruning/SinE : 5
% 0.19/0.55 # Initial clauses : 25
% 0.19/0.55 # Removed in clause preprocessing : 0
% 0.19/0.55 # Initial clauses in saturation : 25
% 0.19/0.55 # Processed clauses : 534
% 0.19/0.55 # ...of these trivial : 15
% 0.19/0.55 # ...subsumed : 242
% 0.19/0.55 # ...remaining for further processing : 277
% 0.19/0.55 # Other redundant clauses eliminated : 0
% 0.19/0.55 # Clauses deleted for lack of memory : 0
% 0.19/0.55 # Backward-subsumed : 4
% 0.19/0.55 # Backward-rewritten : 2
% 0.19/0.55 # Generated clauses : 1396
% 0.19/0.55 # ...of the previous two non-redundant : 1072
% 0.19/0.55 # ...aggressively subsumed : 0
% 0.19/0.55 # Contextual simplify-reflections : 0
% 0.19/0.55 # Paramodulations : 1384
% 0.19/0.55 # Factorizations : 12
% 0.19/0.55 # NegExts : 0
% 0.19/0.55 # Equation resolutions : 0
% 0.19/0.55 # Disequality decompositions : 0
% 0.19/0.55 # Total rewrite steps : 519
% 0.19/0.55 # ...of those cached : 450
% 0.19/0.55 # Propositional unsat checks : 0
% 0.19/0.55 # Propositional check models : 0
% 0.19/0.55 # Propositional check unsatisfiable : 0
% 0.19/0.55 # Propositional clauses : 0
% 0.19/0.55 # Propositional clauses after purity: 0
% 0.19/0.55 # Propositional unsat core size : 0
% 0.19/0.55 # Propositional preprocessing time : 0.000
% 0.19/0.55 # Propositional encoding time : 0.000
% 0.19/0.55 # Propositional solver time : 0.000
% 0.19/0.55 # Success case prop preproc time : 0.000
% 0.19/0.55 # Success case prop encoding time : 0.000
% 0.19/0.55 # Success case prop solver time : 0.000
% 0.19/0.55 # Current number of processed clauses : 246
% 0.19/0.55 # Positive orientable unit clauses : 83
% 0.19/0.55 # Positive unorientable unit clauses: 0
% 0.19/0.55 # Negative unit clauses : 14
% 0.19/0.55 # Non-unit-clauses : 149
% 0.19/0.55 # Current number of unprocessed clauses: 581
% 0.19/0.55 # ...number of literals in the above : 1547
% 0.19/0.55 # Current number of archived formulas : 0
% 0.19/0.55 # Current number of archived clauses : 31
% 0.19/0.55 # Clause-clause subsumption calls (NU) : 1437
% 0.19/0.55 # Rec. Clause-clause subsumption calls : 1362
% 0.19/0.55 # Non-unit clause-clause subsumptions : 156
% 0.19/0.55 # Unit Clause-clause subsumption calls : 58
% 0.19/0.55 # Rewrite failures with RHS unbound : 0
% 0.19/0.55 # BW rewrite match attempts : 19
% 0.19/0.55 # BW rewrite match successes : 2
% 0.19/0.55 # Condensation attempts : 0
% 0.19/0.55 # Condensation successes : 0
% 0.19/0.55 # Termbank termtop insertions : 17751
% 0.19/0.55 # Search garbage collected termcells : 87
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.047 s
% 0.19/0.55 # System time : 0.006 s
% 0.19/0.55 # Total time : 0.053 s
% 0.19/0.55 # Maximum resident set size: 1720 pages
% 0.19/0.55
% 0.19/0.55 # -------------------------------------------------
% 0.19/0.55 # User time : 0.049 s
% 0.19/0.55 # System time : 0.010 s
% 0.19/0.55 # Total time : 0.059 s
% 0.19/0.55 # Maximum resident set size: 1720 pages
% 0.19/0.55 % E---3.1 exiting
% 0.19/0.55 % E exiting
%------------------------------------------------------------------------------