TSTP Solution File: FLD018-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD018-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:29 EDT 2023
% Result : Unsatisfiable 1.81s 0.69s
% Output : CNFRefutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 12 unt; 0 nHn; 34 RR)
% Number of literals : 62 ( 0 equ; 30 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 : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',symmetry_of_equality) ).
cnf(a_equals_additive_identity_2,negated_conjecture,
equalish(a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',a_equals_additive_identity_2) ).
cnf(existence_of_identity_addition,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',existence_of_identity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.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.UYTxHBCkru/E---3.1_23570.p',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',existence_of_inverse_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.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/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',compatibility_of_equality_and_addition) ).
cnf(additive_inverse_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.UYTxHBCkru/E---3.1_23570.p',additive_inverse_not_equal_to_additive_identity_3) ).
cnf(c_0_9,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_10,negated_conjecture,
equalish(a,additive_identity),
a_equals_additive_identity_2 ).
cnf(c_0_11,axiom,
( equalish(add(additive_identity,X1),X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_12,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_13,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_14,negated_conjecture,
equalish(additive_identity,a),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( equalish(add(additive_identity,additive_inverse(X1)),additive_inverse(X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( equalish(X1,a)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( equalish(add(X1,additive_inverse(X1)),additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_18,hypothesis,
defined(a),
a_is_defined ).
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,plain,
( equalish(X1,additive_inverse(X2))
| ~ defined(X2)
| ~ equalish(X1,add(additive_identity,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( equalish(a,X1)
| ~ equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_22,hypothesis,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( equalish(add(additive_identity,X1),add(a,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( equalish(a,additive_inverse(X1))
| ~ defined(X1)
| ~ equalish(add(additive_identity,additive_inverse(X1)),additive_identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
( equalish(X1,additive_identity)
| ~ equalish(X1,add(a,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( equalish(add(additive_identity,additive_inverse(X1)),add(a,additive_inverse(X1)))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_27,hypothesis,
( equalish(a,additive_inverse(a))
| ~ equalish(add(additive_identity,additive_inverse(a)),additive_identity) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,hypothesis,
equalish(add(additive_identity,additive_inverse(a)),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18])]) ).
cnf(c_0_29,hypothesis,
equalish(a,additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_30,negated_conjecture,
( equalish(X1,additive_identity)
| ~ equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_31,hypothesis,
equalish(additive_inverse(a),a),
inference(spm,[status(thm)],[c_0_9,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ equalish(additive_inverse(a),additive_identity),
additive_inverse_not_equal_to_additive_identity_3 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD018-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 23:12:10 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.UYTxHBCkru/E---3.1_23570.p
% 1.81/0.69 # Version: 3.1pre001
% 1.81/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.81/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.81/0.69 # Starting sh5l with 300s (1) cores
% 1.81/0.69 # new_bool_1 with pid 23713 completed with status 0
% 1.81/0.69 # Result found by new_bool_1
% 1.81/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.81/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.81/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.81/0.69 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.81/0.69 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.81/0.69 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.81/0.69 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 23718 completed with status 0
% 1.81/0.69 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 1.81/0.69 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.81/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.81/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.81/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.81/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.81/0.69 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.81/0.69 # Search class: FGUNF-FFMS21-SFFFFFNN
% 1.81/0.69 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.81/0.69 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 135s (1) cores
% 1.81/0.69 # Preprocessing time : 0.001 s
% 1.81/0.69 # Presaturation interreduction done
% 1.81/0.69
% 1.81/0.69 # Proof found!
% 1.81/0.69 # SZS status Unsatisfiable
% 1.81/0.69 # SZS output start CNFRefutation
% See solution above
% 1.81/0.69 # Parsed axioms : 30
% 1.81/0.69 # Removed by relevancy pruning/SinE : 5
% 1.81/0.69 # Initial clauses : 25
% 1.81/0.69 # Removed in clause preprocessing : 0
% 1.81/0.69 # Initial clauses in saturation : 25
% 1.81/0.69 # Processed clauses : 3004
% 1.81/0.69 # ...of these trivial : 108
% 1.81/0.69 # ...subsumed : 1774
% 1.81/0.69 # ...remaining for further processing : 1122
% 1.81/0.69 # Other redundant clauses eliminated : 0
% 1.81/0.69 # Clauses deleted for lack of memory : 0
% 1.81/0.69 # Backward-subsumed : 15
% 1.81/0.69 # Backward-rewritten : 31
% 1.81/0.69 # Generated clauses : 13324
% 1.81/0.69 # ...of the previous two non-redundant : 8740
% 1.81/0.69 # ...aggressively subsumed : 0
% 1.81/0.69 # Contextual simplify-reflections : 0
% 1.81/0.69 # Paramodulations : 13306
% 1.81/0.69 # Factorizations : 18
% 1.81/0.69 # NegExts : 0
% 1.81/0.69 # Equation resolutions : 0
% 1.81/0.69 # Total rewrite steps : 10340
% 1.81/0.69 # Propositional unsat checks : 0
% 1.81/0.69 # Propositional check models : 0
% 1.81/0.69 # Propositional check unsatisfiable : 0
% 1.81/0.69 # Propositional clauses : 0
% 1.81/0.69 # Propositional clauses after purity: 0
% 1.81/0.69 # Propositional unsat core size : 0
% 1.81/0.69 # Propositional preprocessing time : 0.000
% 1.81/0.69 # Propositional encoding time : 0.000
% 1.81/0.69 # Propositional solver time : 0.000
% 1.81/0.69 # Success case prop preproc time : 0.000
% 1.81/0.69 # Success case prop encoding time : 0.000
% 1.81/0.69 # Success case prop solver time : 0.000
% 1.81/0.69 # Current number of processed clauses : 1051
% 1.81/0.69 # Positive orientable unit clauses : 284
% 1.81/0.69 # Positive unorientable unit clauses: 0
% 1.81/0.69 # Negative unit clauses : 1
% 1.81/0.69 # Non-unit-clauses : 766
% 1.81/0.69 # Current number of unprocessed clauses: 5765
% 1.81/0.69 # ...number of literals in the above : 15411
% 1.81/0.69 # Current number of archived formulas : 0
% 1.81/0.69 # Current number of archived clauses : 71
% 1.81/0.69 # Clause-clause subsumption calls (NU) : 44292
% 1.81/0.69 # Rec. Clause-clause subsumption calls : 38927
% 1.81/0.69 # Non-unit clause-clause subsumptions : 1778
% 1.81/0.69 # Unit Clause-clause subsumption calls : 267
% 1.81/0.69 # Rewrite failures with RHS unbound : 0
% 1.81/0.69 # BW rewrite match attempts : 352
% 1.81/0.69 # BW rewrite match successes : 32
% 1.81/0.69 # Condensation attempts : 0
% 1.81/0.69 # Condensation successes : 0
% 1.81/0.69 # Termbank termtop insertions : 169919
% 1.81/0.69
% 1.81/0.69 # -------------------------------------------------
% 1.81/0.69 # User time : 0.164 s
% 1.81/0.69 # System time : 0.006 s
% 1.81/0.69 # Total time : 0.170 s
% 1.81/0.69 # Maximum resident set size: 1624 pages
% 1.81/0.69
% 1.81/0.69 # -------------------------------------------------
% 1.81/0.69 # User time : 0.165 s
% 1.81/0.69 # System time : 0.008 s
% 1.81/0.69 # Total time : 0.173 s
% 1.81/0.69 # Maximum resident set size: 1696 pages
% 1.81/0.69 % E---3.1 exiting
%------------------------------------------------------------------------------