TSTP Solution File: FLD013-5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : FLD013-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:39:44 EDT 2024
% Result : Unsatisfiable 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 23 unt; 0 nHn; 39 RR)
% Number of literals : 66 ( 0 equ; 31 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 : 45 ( 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/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',associativity_addition_1) ).
cnf(sum_10,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',sum_10) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',existence_of_identity_addition) ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',commutativity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',b_is_defined) ).
cnf(sum_8,negated_conjecture,
sum(additive_identity,c,d),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',sum_8) ).
cnf(sum_9,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',sum_9) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',well_definedness_of_additive_identity) ).
cnf(not_sum_11,negated_conjecture,
~ sum(additive_identity,u,v),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',not_sum_11) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',v_is_defined) ).
cnf(sum_7,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',sum_7) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p',a_is_defined) ).
cnf(c_0_12,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).
cnf(c_0_13,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,X5)
| ~ sum(X4,X6,X2)
| ~ sum(X5,X6,X3) ),
c_0_12 ).
cnf(c_0_14,negated_conjecture,
sum(d,b,v),
sum_10 ).
cnf(c_0_15,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_16,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_17,negated_conjecture,
( sum(X1,X2,v)
| ~ sum(X3,b,X2)
| ~ sum(X1,X3,d) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_20,plain,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
c_0_16 ).
cnf(c_0_21,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_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
sum(additive_identity,c,d),
sum_8 ).
cnf(c_0_23,negated_conjecture,
sum(a,c,u),
sum_9 ).
cnf(c_0_24,negated_conjecture,
( sum(b,X1,v)
| ~ sum(X1,additive_identity,d) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
sum(c,additive_identity,d),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,plain,
( sum(X1,X2,X3)
| ~ defined(X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_27,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_28,negated_conjecture,
( sum(X1,X2,u)
| ~ sum(X3,c,X2)
| ~ sum(X1,X3,a) ),
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
sum(b,c,v),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ sum(additive_identity,u,v),
inference(fof_simplification,[status(thm)],[not_sum_11]) ).
cnf(c_0_31,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_26,c_0_18]),c_0_27])]) ).
cnf(c_0_32,negated_conjecture,
( sum(X1,v,u)
| ~ sum(X1,b,a) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_34,negated_conjecture,
~ sum(additive_identity,u,v),
c_0_30 ).
cnf(c_0_35,negated_conjecture,
sum(additive_identity,a,b),
sum_7 ).
cnf(c_0_36,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_37,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_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_36])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : FLD013-5 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n007.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Fri May 3 13:28:05 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.CzEy5q95AY/E---3.1_31558.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # new_bool_3 with pid 31638 completed with status 0
% 0.16/0.45 # Result found by new_bool_3
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 31641 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45 # Search class: FHUNF-FFSM00-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Unsatisfiable
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 37
% 0.16/0.45 # Removed by relevancy pruning/SinE : 21
% 0.16/0.45 # Initial clauses : 16
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 16
% 0.16/0.45 # Processed clauses : 102
% 0.16/0.45 # ...of these trivial : 2
% 0.16/0.45 # ...subsumed : 7
% 0.16/0.45 # ...remaining for further processing : 92
% 0.16/0.45 # Other redundant clauses eliminated : 0
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 0
% 0.16/0.45 # Backward-rewritten : 0
% 0.16/0.45 # Generated clauses : 208
% 0.16/0.45 # ...of the previous two non-redundant : 166
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 0
% 0.16/0.45 # Paramodulations : 208
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 0
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 94
% 0.16/0.45 # ...of those cached : 67
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 76
% 0.16/0.45 # Positive orientable unit clauses : 29
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 2
% 0.16/0.45 # Non-unit-clauses : 45
% 0.16/0.45 # Current number of unprocessed clauses: 96
% 0.16/0.45 # ...number of literals in the above : 308
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 16
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 168
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 168
% 0.16/0.45 # Non-unit clause-clause subsumptions : 7
% 0.16/0.45 # Unit Clause-clause subsumption calls : 30
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 3
% 0.16/0.45 # BW rewrite match successes : 0
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 2878
% 0.16/0.45 # Search garbage collected termcells : 156
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.004 s
% 0.16/0.45 # System time : 0.004 s
% 0.16/0.45 # Total time : 0.008 s
% 0.16/0.45 # Maximum resident set size: 1740 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.006 s
% 0.16/0.45 # System time : 0.005 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1720 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------