TSTP Solution File: FLD005-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD005-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:52 EDT 2023
% Result : Unsatisfiable 0.23s 0.60s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 10 unt; 3 nHn; 29 RR)
% Number of literals : 63 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',totality_of_order_relation) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',b_is_defined) ).
cnf(antisymmetry_of_order_relation,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',antisymmetry_of_order_relation) ).
cnf(associativity_addition_1,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',associativity_addition_1) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',totality_of_addition) ).
cnf(not_sum_3,negated_conjecture,
~ sum(a,X1,b),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',not_sum_3) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',commutativity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',existence_of_inverse_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',a_is_defined) ).
cnf(well_definedness_of_additive_inverse,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.WXZZOZqLZM/E---3.1_20074.p',well_definedness_of_additive_inverse) ).
cnf(c_0_10,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_11,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_12,hypothesis,
( less_or_equal(X1,b)
| less_or_equal(b,X1)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( sum(additive_identity,X1,X2)
| ~ less_or_equal(X1,X2)
| ~ less_or_equal(X2,X1) ),
antisymmetry_of_order_relation ).
cnf(c_0_14,hypothesis,
less_or_equal(b,b),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_16,hypothesis,
sum(additive_identity,b,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14])]) ).
cnf(c_0_17,hypothesis,
( sum(X1,X2,b)
| ~ sum(X3,b,X2)
| ~ sum(X1,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_addition ).
cnf(c_0_19,negated_conjecture,
~ sum(a,X1,b),
not_sum_3 ).
cnf(c_0_20,hypothesis,
( sum(X1,add(X2,b),b)
| ~ defined(X2)
| ~ sum(X1,X2,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11])]) ).
cnf(c_0_21,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_22,axiom,
( sum(additive_inverse(X1),X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_addition ).
cnf(c_0_23,negated_conjecture,
( ~ defined(X1)
| ~ sum(a,X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( sum(X1,additive_inverse(X1),additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_26,negated_conjecture,
~ defined(additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_27,axiom,
( defined(additive_inverse(X1))
| ~ defined(X1) ),
well_definedness_of_additive_inverse ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : FLD005-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.12/0.16 % Command : run_E %s %d THM
% 0.16/0.38 % Computer : n002.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon Oct 2 23:15:44 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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.WXZZOZqLZM/E---3.1_20074.p
% 0.23/0.60 # Version: 3.1pre001
% 0.23/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.60 # Starting sh5l with 300s (1) cores
% 0.23/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20154 completed with status 0
% 0.23/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 # No SInE strategy applied
% 0.23/0.60 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.23/0.60 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.23/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 # Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.60 # Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/0.60 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 0.23/0.60 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 20161 completed with status 0
% 0.23/0.60 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.60 # No SInE strategy applied
% 0.23/0.60 # Search class: FGUNF-FFMS21-SFFFFFNN
% 0.23/0.60 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.60 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 675s (1) cores
% 0.23/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.60 # Preprocessing time : 0.001 s
% 0.23/0.60 # Presaturation interreduction done
% 0.23/0.60
% 0.23/0.60 # Proof found!
% 0.23/0.60 # SZS status Unsatisfiable
% 0.23/0.60 # SZS output start CNFRefutation
% See solution above
% 0.23/0.60 # Parsed axioms : 29
% 0.23/0.60 # Removed by relevancy pruning/SinE : 0
% 0.23/0.60 # Initial clauses : 29
% 0.23/0.60 # Removed in clause preprocessing : 0
% 0.23/0.60 # Initial clauses in saturation : 29
% 0.23/0.60 # Processed clauses : 779
% 0.23/0.60 # ...of these trivial : 7
% 0.23/0.60 # ...subsumed : 249
% 0.23/0.60 # ...remaining for further processing : 523
% 0.23/0.60 # Other redundant clauses eliminated : 0
% 0.23/0.60 # Clauses deleted for lack of memory : 0
% 0.23/0.60 # Backward-subsumed : 22
% 0.23/0.60 # Backward-rewritten : 1
% 0.23/0.60 # Generated clauses : 2529
% 0.23/0.60 # ...of the previous two non-redundant : 2013
% 0.23/0.60 # ...aggressively subsumed : 0
% 0.23/0.60 # Contextual simplify-reflections : 0
% 0.23/0.60 # Paramodulations : 2529
% 0.23/0.60 # Factorizations : 0
% 0.23/0.60 # NegExts : 0
% 0.23/0.60 # Equation resolutions : 0
% 0.23/0.60 # Total rewrite steps : 1187
% 0.23/0.60 # Propositional unsat checks : 0
% 0.23/0.60 # Propositional check models : 0
% 0.23/0.60 # Propositional check unsatisfiable : 0
% 0.23/0.60 # Propositional clauses : 0
% 0.23/0.60 # Propositional clauses after purity: 0
% 0.23/0.60 # Propositional unsat core size : 0
% 0.23/0.60 # Propositional preprocessing time : 0.000
% 0.23/0.60 # Propositional encoding time : 0.000
% 0.23/0.60 # Propositional solver time : 0.000
% 0.23/0.60 # Success case prop preproc time : 0.000
% 0.23/0.60 # Success case prop encoding time : 0.000
% 0.23/0.60 # Success case prop solver time : 0.000
% 0.23/0.60 # Current number of processed clauses : 471
% 0.23/0.60 # Positive orientable unit clauses : 46
% 0.23/0.60 # Positive unorientable unit clauses: 0
% 0.23/0.60 # Negative unit clauses : 5
% 0.23/0.60 # Non-unit-clauses : 420
% 0.23/0.60 # Current number of unprocessed clauses: 1292
% 0.23/0.60 # ...number of literals in the above : 4596
% 0.23/0.60 # Current number of archived formulas : 0
% 0.23/0.60 # Current number of archived clauses : 52
% 0.23/0.60 # Clause-clause subsumption calls (NU) : 15345
% 0.23/0.60 # Rec. Clause-clause subsumption calls : 11977
% 0.23/0.60 # Non-unit clause-clause subsumptions : 257
% 0.23/0.60 # Unit Clause-clause subsumption calls : 519
% 0.23/0.60 # Rewrite failures with RHS unbound : 0
% 0.23/0.60 # BW rewrite match attempts : 9
% 0.23/0.60 # BW rewrite match successes : 2
% 0.23/0.60 # Condensation attempts : 0
% 0.23/0.60 # Condensation successes : 0
% 0.23/0.60 # Termbank termtop insertions : 35132
% 0.23/0.60
% 0.23/0.60 # -------------------------------------------------
% 0.23/0.60 # User time : 0.055 s
% 0.23/0.60 # System time : 0.003 s
% 0.23/0.60 # Total time : 0.059 s
% 0.23/0.60 # Maximum resident set size: 1656 pages
% 0.23/0.60
% 0.23/0.60 # -------------------------------------------------
% 0.23/0.60 # User time : 0.269 s
% 0.23/0.60 # System time : 0.022 s
% 0.23/0.60 # Total time : 0.291 s
% 0.23/0.60 # Maximum resident set size: 1700 pages
% 0.23/0.60 % E---3.1 exiting
% 0.23/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------