%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM839+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:50:47 PM UTC 2026
% Result : Theorem 0.53s 0.48s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 51 ( 23 unt; 0 def)
% Number of atoms : 91 ( 46 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 81 ( 41 ~; 34 |; 3 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 100 ( 8 sgn 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(204), 332, 0)',conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(204), 332, 0)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X35,X36] :
( ~ ? [X38] : X36 = vplus(X35,X38)
| X35 != X36 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X27,X28] :
( less(X27,X28)
| greater(X27,X28)
| X27 = X28 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X49,X50,X51] : vplus(vplus(X49,X50),X51) = vplus(X49,vplus(X50,X51)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X12,X13,X14] :
( ( less(X12,X13)
& less(X13,X14) )
=> less(X12,X14) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 12), 1)',axiom,
! [X29,X30] :
( less(X30,X29)
<=> ? [X31] : X29 = vplus(X30,X31) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X32,X33] :
( greater(X33,X32)
<=> ? [X34] : X33 = vplus(X32,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X27,X28] :
( ~ greater(X27,X28)
| X27 != X28 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof('holds(antec(204), 331, 0)',axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(204), 331, 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,
! [X35,X36] :
( ~ ? [X38] : X36 = vplus(X35,X38)
| X35 != X36 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
fof(c_0_12,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_13,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_11])])])]) ).
fof(c_0_14,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X90,X91] :
( less(X90,X91)
| greater(X90,X91)
| X90 = X91 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_16,plain,
( X2 != vplus(X1,X3)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,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_18,plain,
! [X75,X76,X77] :
( less(X75,X77)
| ~ less(X75,X76)
| ~ less(X76,X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])])]) ).
cnf(c_0_19,negated_conjecture,
~ greater(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X98,X99,X101,X102,X103] :
( ( less(X102,X101)
| X101 != vplus(X102,X103) )
& ( X98 = vplus(X99,esk1_2(X98,X99))
| ~ less(X99,X98) ) ),
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)), 12), 1)'])])])])])]) ).
cnf(c_0_22,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ less(X3,X1)
| ~ less(X1,X2)
| less(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( less(vd328,vd329)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( X1 != vplus(X2,X3)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( ~ less(X1,X2)
| X2 = vplus(X1,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ less(vd329,X1)
| less(vd328,X1)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
less(X1,vplus(X1,X2)),
inference(er,[status(thm)],[c_0_26]) ).
fof(c_0_31,plain,
! [X129,X130] : vplus(X130,X129) = vplus(X129,X130),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_32,plain,
( ~ less(X3,X2)
| vplus(X1,X2) != vplus(X1,X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( less(vd328,vplus(vd329,X1))
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( vplus(X1,vplus(vd329,X2)) != vplus(X1,vd328)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_23]) ).
fof(c_0_37,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)'])])])])])]) ).
fof(c_0_38,plain,
! [X27,X28] :
( ~ greater(X27,X28)
| X27 != X28 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).
cnf(c_0_39,negated_conjecture,
( vplus(vd329,vplus(X1,X2)) != vplus(X1,vd328)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(204), 331, 0)']) ).
fof(c_0_42,plain,
! [X96,X97] :
( ~ greater(X96,X97)
| X96 != X97 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
( ~ greater(X1,X2)
| vplus(vd329,X1) != vplus(X2,vd328)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
greater(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_45,plain,
vplus(X1,X2) = vplus(X2,X1),
c_0_34 ).
cnf(c_0_46,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
c_0_23 ).
cnf(c_0_47,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,negated_conjecture,
vd329 = vd328,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23]),c_0_45,c_0_46]) ).
cnf(c_0_49,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_48]),c_0_34]),c_0_49]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n006.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 03:12:27 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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/benchmark/theBenchmark.p
% 0.53/0.48 % Version: 3.5.1
% 0.53/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.48 % Starting sh5l with 300s (1) cores
% 0.53/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1877985 completed with status 0
% 0.53/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.48 % No SInE strategy applied
% 0.53/0.48 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.53/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.48 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.53/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.53/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.53/0.48 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1877991 completed with status 0
% 0.53/0.48 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.53/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.53/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.53/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.48 % No SInE strategy applied
% 0.53/0.48 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.53/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.53/0.48 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.53/0.48 % Preprocessing time : 0.002 s
% 0.53/0.48 % Presaturation interreduction done
% 0.53/0.48
% 0.53/0.48 % Proof found!
% 0.53/0.48 % SZS status Theorem
% 0.53/0.48 % SZS output start CNFRefutation
% See solution above
% 0.53/0.48 % Parsed axioms : 35
% 0.53/0.48 % Removed by relevancy pruning/SinE : 0
% 0.53/0.48 % Initial clauses : 43
% 0.53/0.48 % Removed in clause preprocessing : 2
% 0.53/0.48 % Initial clauses in saturation : 41
% 0.53/0.48 % Processed clauses : 793
% 0.53/0.48 % ...of these trivial : 18
% 0.53/0.48 % ...subsumed : 509
% 0.53/0.48 % ...remaining for further processing : 265
% 0.53/0.48 % Other redundant clauses eliminated : 51
% 0.53/0.48 % Clauses deleted for lack of memory : 0
% 0.53/0.48 % Backward-subsumed : 11
% 0.53/0.48 % Backward-rewritten : 64
% 0.53/0.48 % Generated clauses : 2514
% 0.53/0.48 % ...of the previous two non-redundant : 2380
% 0.53/0.48 % ...aggressively subsumed : 0
% 0.53/0.48 % Contextual simplify-reflections : 1
% 0.53/0.48 % Paramodulations : 2456
% 0.53/0.48 % Factorizations : 2
% 0.53/0.48 % NegExts : 0
% 0.53/0.48 % Equation resolutions : 56
% 0.53/0.48 % Disequality decompositions : 0
% 0.53/0.48 % Total rewrite steps : 602
% 0.53/0.48 % ...of those cached : 474
% 0.53/0.48 % Propositional unsat checks : 0
% 0.53/0.48 % Propositional check models : 0
% 0.53/0.48 % Propositional check unsatisfiable : 0
% 0.53/0.48 % Propositional clauses : 0
% 0.53/0.48 % Propositional clauses after purity: 0
% 0.53/0.48 % Propositional unsat core size : 0
% 0.53/0.48 % Propositional preprocessing time : 0.000
% 0.53/0.48 % Propositional encoding time : 0.000
% 0.53/0.48 % Propositional solver time : 0.000
% 0.53/0.48 % Success case prop preproc time : 0.000
% 0.53/0.48 % Success case prop encoding time : 0.000
% 0.53/0.48 % Success case prop solver time : 0.000
% 0.53/0.48 % Current number of processed clauses : 147
% 0.53/0.48 % Positive orientable unit clauses : 24
% 0.53/0.48 % Positive unorientable unit clauses: 3
% 0.53/0.48 % Negative unit clauses : 38
% 0.53/0.48 % Non-unit-clauses : 82
% 0.53/0.48 % Current number of unprocessed clauses: 1655
% 0.53/0.48 % ...number of literals in the above : 3455
% 0.53/0.48 % Current number of archived formulas : 0
% 0.53/0.48 % Current number of archived clauses : 110
% 0.53/0.48 % Clause-clause subsumption calls (NU) : 3106
% 0.53/0.48 % Rec. Clause-clause subsumption calls : 2628
% 0.53/0.48 % Non-unit clause-clause subsumptions : 260
% 0.53/0.48 % Unit Clause-clause subsumption calls : 228
% 0.53/0.48 % Rewrite failures with RHS unbound : 0
% 0.53/0.48 % BW rewrite match attempts : 45
% 0.53/0.48 % BW rewrite match successes : 35
% 0.53/0.48 % Condensation attempts : 0
% 0.53/0.48 % Condensation successes : 0
% 0.53/0.48 % Termbank termtop insertions : 19900
% 0.53/0.48 % Search garbage collected termcells : 498
% 0.53/0.48
% 0.53/0.48 % -------------------------------------------------
% 0.53/0.48 % User time : 0.046 s
% 0.53/0.48 % System time : 0.008 s
% 0.53/0.48 % Total time : 0.054 s
% 0.53/0.48 % Maximum resident set size: 3684 pages
% 0.53/0.48
% 0.53/0.48 % -------------------------------------------------
% 0.53/0.48 % User time : 0.170 s
% 0.53/0.48 % System time : 0.024 s
% 0.53/0.48 % Total time : 0.194 s
% 0.53/0.48 % Maximum resident set size: 4608 pages
% 0.53/0.48 % E exiting
%------------------------------------------------------------------------------