TSTP Solution File: FLD018-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : FLD018-1 : 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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:40:24 EDT 2024
% Result : Unsatisfiable 1.51s 0.64s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 41 ( 13 unt; 0 nHn; 41 RR)
% Number of literals : 77 ( 0 equ; 39 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 : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',symmetry_of_equality) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',existence_of_identity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',well_definedness_of_additive_inverse) ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',transitivity_of_equality) ).
cnf(a_equals_additive_identity_2,negated_conjecture,
equalish(a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',a_equals_additive_identity_2) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.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/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',compatibility_of_equality_and_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',a_is_defined) ).
cnf(additive_inverse_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p',additive_inverse_not_equal_to_additive_identity_3) ).
cnf(c_0_9,plain,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_10,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_11,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
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_9 ).
cnf(c_0_14,negated_conjecture,
equalish(a,additive_identity),
a_equals_additive_identity_2 ).
cnf(c_0_15,plain,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
c_0_10 ).
cnf(c_0_16,plain,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
c_0_11 ).
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,a),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
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(add(additive_identity,additive_inverse(X1)),additive_inverse(X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( equalish(X1,a)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
c_0_19 ).
cnf(c_0_24,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_25,plain,
( equalish(add(X1,X2),add(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
c_0_20 ).
cnf(c_0_26,plain,
( equalish(X1,additive_inverse(X2))
| ~ defined(X2)
| ~ equalish(X1,add(additive_identity,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( equalish(a,X1)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_28,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( equalish(add(additive_identity,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_30,negated_conjecture,
( equalish(a,additive_inverse(X1))
| ~ defined(X1)
| ~ equalish(add(additive_identity,additive_inverse(X1)),additive_identity) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,hypothesis,
( equalish(X1,additive_identity)
| ~ equalish(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( equalish(add(additive_identity,additive_inverse(X1)),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
cnf(c_0_33,hypothesis,
( equalish(a,additive_inverse(a))
| ~ equalish(add(additive_identity,additive_inverse(a)),additive_identity) ),
inference(spm,[status(thm)],[c_0_30,c_0_24]) ).
cnf(c_0_34,hypothesis,
equalish(add(additive_identity,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24])]) ).
cnf(c_0_35,hypothesis,
equalish(a,additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_36,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
inference(fof_simplification,[status(thm)],[additive_inverse_not_equal_to_additive_identity_3]) ).
cnf(c_0_37,negated_conjecture,
( equalish(X1,additive_identity)
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_38,hypothesis,
equalish(additive_inverse(a),a),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
c_0_36 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : FLD018-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n026.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 : Fri May 3 13:55:51 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xaWZK6N5ff/E---3.1_9085.p
% 1.51/0.64 # Version: 3.1.0
% 1.51/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.51/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.51/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.51/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.51/0.64 # Starting sh5l with 300s (1) cores
% 1.51/0.64 # new_bool_1 with pid 9164 completed with status 0
% 1.51/0.64 # Result found by new_bool_1
% 1.51/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.51/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.51/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.51/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.51/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.51/0.64 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.51/0.64 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.51/0.64 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.51/0.64 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 9170 completed with status 0
% 1.51/0.64 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 1.51/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.51/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.51/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.51/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.51/0.64 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.51/0.64 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.51/0.64 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.51/0.64 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.51/0.64 # Preprocessing time : 0.001 s
% 1.51/0.64 # Presaturation interreduction done
% 1.51/0.64
% 1.51/0.64 # Proof found!
% 1.51/0.64 # SZS status Unsatisfiable
% 1.51/0.64 # SZS output start CNFRefutation
% See solution above
% 1.51/0.64 # Parsed axioms : 30
% 1.51/0.64 # Removed by relevancy pruning/SinE : 5
% 1.51/0.64 # Initial clauses : 25
% 1.51/0.64 # Removed in clause preprocessing : 0
% 1.51/0.64 # Initial clauses in saturation : 25
% 1.51/0.64 # Processed clauses : 3004
% 1.51/0.64 # ...of these trivial : 108
% 1.51/0.64 # ...subsumed : 1774
% 1.51/0.64 # ...remaining for further processing : 1122
% 1.51/0.64 # Other redundant clauses eliminated : 0
% 1.51/0.64 # Clauses deleted for lack of memory : 0
% 1.51/0.64 # Backward-subsumed : 15
% 1.51/0.64 # Backward-rewritten : 31
% 1.51/0.64 # Generated clauses : 13324
% 1.51/0.64 # ...of the previous two non-redundant : 8740
% 1.51/0.64 # ...aggressively subsumed : 0
% 1.51/0.64 # Contextual simplify-reflections : 0
% 1.51/0.64 # Paramodulations : 13306
% 1.51/0.64 # Factorizations : 18
% 1.51/0.64 # NegExts : 0
% 1.51/0.64 # Equation resolutions : 0
% 1.51/0.64 # Disequality decompositions : 0
% 1.51/0.64 # Total rewrite steps : 10340
% 1.51/0.64 # ...of those cached : 10088
% 1.51/0.64 # Propositional unsat checks : 0
% 1.51/0.64 # Propositional check models : 0
% 1.51/0.64 # Propositional check unsatisfiable : 0
% 1.51/0.64 # Propositional clauses : 0
% 1.51/0.64 # Propositional clauses after purity: 0
% 1.51/0.64 # Propositional unsat core size : 0
% 1.51/0.64 # Propositional preprocessing time : 0.000
% 1.51/0.64 # Propositional encoding time : 0.000
% 1.51/0.64 # Propositional solver time : 0.000
% 1.51/0.64 # Success case prop preproc time : 0.000
% 1.51/0.64 # Success case prop encoding time : 0.000
% 1.51/0.64 # Success case prop solver time : 0.000
% 1.51/0.64 # Current number of processed clauses : 1051
% 1.51/0.64 # Positive orientable unit clauses : 284
% 1.51/0.64 # Positive unorientable unit clauses: 0
% 1.51/0.64 # Negative unit clauses : 1
% 1.51/0.64 # Non-unit-clauses : 766
% 1.51/0.64 # Current number of unprocessed clauses: 5765
% 1.51/0.64 # ...number of literals in the above : 15411
% 1.51/0.64 # Current number of archived formulas : 0
% 1.51/0.64 # Current number of archived clauses : 71
% 1.51/0.64 # Clause-clause subsumption calls (NU) : 44292
% 1.51/0.64 # Rec. Clause-clause subsumption calls : 38927
% 1.51/0.64 # Non-unit clause-clause subsumptions : 1778
% 1.51/0.64 # Unit Clause-clause subsumption calls : 267
% 1.51/0.64 # Rewrite failures with RHS unbound : 0
% 1.51/0.64 # BW rewrite match attempts : 352
% 1.51/0.64 # BW rewrite match successes : 32
% 1.51/0.64 # Condensation attempts : 0
% 1.51/0.64 # Condensation successes : 0
% 1.51/0.64 # Termbank termtop insertions : 170122
% 1.51/0.64 # Search garbage collected termcells : 87
% 1.51/0.64
% 1.51/0.64 # -------------------------------------------------
% 1.51/0.64 # User time : 0.148 s
% 1.51/0.64 # System time : 0.002 s
% 1.51/0.64 # Total time : 0.150 s
% 1.51/0.64 # Maximum resident set size: 1724 pages
% 1.51/0.64
% 1.51/0.64 # -------------------------------------------------
% 1.51/0.64 # User time : 0.150 s
% 1.51/0.64 # System time : 0.002 s
% 1.51/0.64 # Total time : 0.152 s
% 1.51/0.64 # Maximum resident set size: 1712 pages
% 1.51/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------