TSTP Solution File: FLD013-5 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : FLD013-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:56 EDT 2023
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 35 ( 22 unt; 0 nHn; 35 RR)
% Number of literals : 57 ( 0 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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.efpXRgcwIO/E---3.1_30308.p',associativity_addition_1) ).
cnf(sum_10,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',sum_10) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',existence_of_identity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',b_is_defined) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',commutativity_addition) ).
cnf(sum_8,negated_conjecture,
sum(additive_identity,c,d),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',sum_8) ).
cnf(sum_9,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',sum_9) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',well_definedness_of_additive_identity) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',v_is_defined) ).
cnf(not_sum_11,negated_conjecture,
~ sum(additive_identity,u,v),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',not_sum_11) ).
cnf(sum_7,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',sum_7) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.efpXRgcwIO/E---3.1_30308.p',a_is_defined) ).
cnf(c_0_12,axiom,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
associativity_addition_1 ).
cnf(c_0_13,negated_conjecture,
sum(d,b,v),
sum_10 ).
cnf(c_0_14,negated_conjecture,
( sum(X1,X2,v)
| ~ sum(X3,b,X2)
| ~ sum(X1,X3,d) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_16,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_17,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_18,negated_conjecture,
( sum(X1,b,v)
| ~ sum(X1,additive_identity,d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
sum(additive_identity,c,d),
sum_8 ).
cnf(c_0_20,negated_conjecture,
sum(a,c,u),
sum_9 ).
cnf(c_0_21,negated_conjecture,
( sum(b,X1,v)
| ~ sum(X1,additive_identity,d) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
sum(c,additive_identity,d),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_23,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_24,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_25,negated_conjecture,
( sum(X1,X2,u)
| ~ sum(X3,c,X2)
| ~ sum(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
sum(b,c,v),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( sum(additive_identity,X1,X2)
| ~ defined(X2)
| ~ sum(additive_identity,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
( sum(X1,v,u)
| ~ sum(X1,b,a) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_30,negated_conjecture,
~ sum(additive_identity,u,v),
not_sum_11 ).
cnf(c_0_31,negated_conjecture,
sum(additive_identity,a,b),
sum_7 ).
cnf(c_0_32,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_33,negated_conjecture,
~ sum(additive_identity,b,a),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : FLD013-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n021.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 23:17:14 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order theorem proving
% 0.22/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.efpXRgcwIO/E---3.1_30308.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # new_bool_1 with pid 30388 completed with status 0
% 0.22/0.54 # Result found by new_bool_1
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # SAT001_MinMin_p005000_rr_RG with pid 30390 completed with status 0
% 0.22/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.54 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 37
% 0.22/0.54 # Removed by relevancy pruning/SinE : 21
% 0.22/0.54 # Initial clauses : 16
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 16
% 0.22/0.54 # Processed clauses : 102
% 0.22/0.54 # ...of these trivial : 2
% 0.22/0.54 # ...subsumed : 7
% 0.22/0.54 # ...remaining for further processing : 92
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 208
% 0.22/0.54 # ...of the previous two non-redundant : 166
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 208
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Total rewrite steps : 94
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 76
% 0.22/0.54 # Positive orientable unit clauses : 29
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 2
% 0.22/0.54 # Non-unit-clauses : 45
% 0.22/0.54 # Current number of unprocessed clauses: 96
% 0.22/0.54 # ...number of literals in the above : 308
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 16
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 168
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 168
% 0.22/0.54 # Non-unit clause-clause subsumptions : 7
% 0.22/0.54 # Unit Clause-clause subsumption calls : 30
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 3
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 2835
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.007 s
% 0.22/0.54 # System time : 0.000 s
% 0.22/0.54 # Total time : 0.008 s
% 0.22/0.54 # Maximum resident set size: 1636 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.008 s
% 0.22/0.54 # System time : 0.003 s
% 0.22/0.54 # Total time : 0.011 s
% 0.22/0.54 # Maximum resident set size: 1700 pages
% 0.22/0.54 % E---3.1 exiting
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------