%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM839+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:56:42 PM UTC 2026
% Result : Theorem 0.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 30 unt; 0 def)
% Number of atoms : 69 ( 42 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 29 ~; 19 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 78 ( 12 sgn 38 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(73, 0), 0)',axiom,
! [X42,X43] : X43 != vplus(X42,X43),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).
fof('holds(conseq(204), 332, 0)',conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(204), 332, 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X49,X50,X51] : vplus(vplus(X49,X50),X51) = vplus(X49,vplus(X50,X51)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X27,X28] :
( less(X27,X28)
| greater(X27,X28)
| X27 = X28 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X35,X36] :
( ~ ? [X38] : X36 = vplus(X35,X38)
| X35 != X36 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X32,X33] :
( greater(X33,X32)
<=> ? [X34] : X33 = vplus(X32,X34) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(antec(204), 331, 0)',axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(204), 331, 0)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X23,X24] :
( less(X23,X24)
=> greater(X24,X23) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(c_0_9,plain,
! [X42,X43] : X43 != vplus(X42,X43),
inference(fof_simplification,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_10,negated_conjecture,
~ greater(vd328,vd329),
inference(assume_negation,[status(cth)],['holds(conseq(204), 332, 0)']) ).
fof(c_0_11,plain,
! [X127,X128] : X128 != vplus(X127,X128),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_12,plain,
! [X134,X135,X136] : vplus(vplus(X134,X135),X136) = vplus(X134,vplus(X135,X136)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_13,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X129,X130] : vplus(X130,X129) = vplus(X129,X130),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_17,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X90,X91] :
( less(X90,X91)
| greater(X90,X91)
| X90 = X91 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_19,plain,
! [X35,X36] :
( ~ ? [X38] : X36 = vplus(X35,X38)
| X35 != X36 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
cnf(c_0_20,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X104,X105,X107,X108,X109] :
( ( greater(X108,X107)
| X108 != vplus(X107,X109) )
& ( X105 = vplus(X104,esk2_2(X104,X105))
| ~ greater(X105,X104) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_23,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(204), 331, 0)']) ).
fof(c_0_24,plain,
! [X86,X87] :
( greater(X87,X86)
| ~ less(X86,X87) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).
cnf(c_0_25,negated_conjecture,
~ greater(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X114,X115,X116] :
( X115 != vplus(X114,X116)
| X114 != X115 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
cnf(c_0_28,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
greater(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_31,plain,
( ~ less(X1,X2)
| greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,negated_conjecture,
( less(vd328,vd329)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( X2 != vplus(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
vplus(X1,vplus(X2,vplus(X3,X4))) != vplus(X2,X3),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_35,plain,
vplus(vd330,vplus(vd329,esk2_2(vplus(vd330,vd329),vplus(vd328,vd330)))) = vplus(vd328,vd330),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( greater(vd329,vd328)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
vplus(X1,vplus(vd328,vd330)) != vplus(vd330,vd329),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_15]) ).
cnf(c_0_40,negated_conjecture,
( vd329 = vd328
| vplus(vd328,esk2_2(vd328,vd329)) = vd329 ),
inference(spm,[status(thm)],[c_0_29,c_0_36]) ).
cnf(c_0_41,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_42,plain,
vplus(vd328,vplus(X1,vd330)) != vplus(vd330,vd329),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( vd329 = vd328
| vplus(vd328,vplus(esk2_2(vd328,vd329),X1)) = vplus(vd329,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_40]) ).
cnf(c_0_44,plain,
vplus(vd330,vd329) != vplus(vd328,vd330),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_45,negated_conjecture,
vd329 = vd328,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_21])]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM839+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n009.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 03:12:42 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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/benchmark/theBenchmark.p
% 0.13/0.45 % Version: 3.5.1
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.45 % Starting sh5l with 300s (1) cores
% 0.13/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 710291 completed with status 0
% 0.13/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.45 % new_bool_3 with pid 710301 completed with status 0
% 0.13/0.45 % Result found by new_bool_3
% 0.13/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.45 % No SInE strategy applied
% 0.13/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.13/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.45 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.45 % Preprocessing time : 0.001 s
% 0.13/0.45 % Presaturation interreduction done
% 0.13/0.45
% 0.13/0.45 % Proof found!
% 0.13/0.45 % SZS status Theorem
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.45 % Parsed axioms : 35
% 0.13/0.45 % Removed by relevancy pruning/SinE : 0
% 0.13/0.45 % Initial clauses : 43
% 0.13/0.45 % Removed in clause preprocessing : 2
% 0.13/0.45 % Initial clauses in saturation : 41
% 0.13/0.45 % Processed clauses : 902
% 0.13/0.45 % ...of these trivial : 12
% 0.13/0.45 % ...subsumed : 585
% 0.13/0.45 % ...remaining for further processing : 305
% 0.13/0.45 % Other redundant clauses eliminated : 69
% 0.13/0.45 % Clauses deleted for lack of memory : 0
% 0.13/0.45 % Backward-subsumed : 3
% 0.13/0.45 % Backward-rewritten : 143
% 0.13/0.45 % Generated clauses : 3596
% 0.13/0.45 % ...of the previous two non-redundant : 3451
% 0.13/0.45 % ...aggressively subsumed : 0
% 0.13/0.45 % Contextual simplify-reflections : 0
% 0.13/0.45 % Paramodulations : 3520
% 0.13/0.45 % Factorizations : 2
% 0.13/0.45 % NegExts : 0
% 0.13/0.45 % Equation resolutions : 74
% 0.13/0.45 % Disequality decompositions : 0
% 0.13/0.45 % Total rewrite steps : 696
% 0.13/0.45 % ...of those cached : 545
% 0.13/0.45 % Propositional unsat checks : 0
% 0.13/0.45 % Propositional check models : 0
% 0.13/0.45 % Propositional check unsatisfiable : 0
% 0.13/0.45 % Propositional clauses : 0
% 0.13/0.45 % Propositional clauses after purity: 0
% 0.13/0.45 % Propositional unsat core size : 0
% 0.13/0.45 % Propositional preprocessing time : 0.000
% 0.13/0.45 % Propositional encoding time : 0.000
% 0.13/0.45 % Propositional solver time : 0.000
% 0.13/0.45 % Success case prop preproc time : 0.000
% 0.13/0.45 % Success case prop encoding time : 0.000
% 0.13/0.45 % Success case prop solver time : 0.000
% 0.13/0.45 % Current number of processed clauses : 116
% 0.13/0.45 % Positive orientable unit clauses : 22
% 0.13/0.45 % Positive unorientable unit clauses: 3
% 0.13/0.45 % Negative unit clauses : 42
% 0.13/0.45 % Non-unit-clauses : 49
% 0.13/0.45 % Current number of unprocessed clauses: 2609
% 0.13/0.45 % ...number of literals in the above : 4928
% 0.13/0.45 % Current number of archived formulas : 0
% 0.13/0.45 % Current number of archived clauses : 181
% 0.13/0.45 % Clause-clause subsumption calls (NU) : 6866
% 0.13/0.45 % Rec. Clause-clause subsumption calls : 4901
% 0.13/0.45 % Non-unit clause-clause subsumptions : 330
% 0.13/0.45 % Unit Clause-clause subsumption calls : 725
% 0.13/0.45 % Rewrite failures with RHS unbound : 0
% 0.13/0.45 % BW rewrite match attempts : 83
% 0.13/0.45 % BW rewrite match successes : 67
% 0.13/0.45 % Condensation attempts : 0
% 0.13/0.45 % Condensation successes : 0
% 0.13/0.45 % Termbank termtop insertions : 27805
% 0.13/0.45 % Search garbage collected termcells : 498
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.033 s
% 0.13/0.45 % System time : 0.007 s
% 0.13/0.45 % Total time : 0.040 s
% 0.13/0.45 % Maximum resident set size: 3684 pages
% 0.13/0.45
% 0.13/0.45 % -------------------------------------------------
% 0.13/0.45 % User time : 0.170 s
% 0.13/0.45 % System time : 0.018 s
% 0.13/0.45 % Total time : 0.188 s
% 0.13/0.45 % Maximum resident set size: 4864 pages
% 0.13/0.45 % E exiting
%------------------------------------------------------------------------------