%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM841+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 : n010.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:48 PM UTC 2026
% Result : Theorem 0.13s 0.44s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 55 ( 33 unt; 0 def)
% Number of atoms : 84 ( 19 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 65 ( 36 ~; 25 |; 1 &)
% ( 1 <=>; 2 =>; 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; 4 con; 0-2 aty)
% Number of variables : 81 ( 9 sgn 39 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X13,X14] :
( ~ less(X13,X14)
| ~ greater(X13,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X11,X12] :
( greater(X11,X12)
=> less(X12,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X7,X8] : greater(vplus(X7,X8),X7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X21,X22] : vplus(X22,X21) = vplus(X21,X22),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X26,X27,X28] : vplus(vplus(X26,X27),X28) = vplus(X26,vplus(X27,X28)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X15,X16] :
( greater(X16,X15)
<=> ? [X17] : X16 = vplus(X15,X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(214, 352, 0)',conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(214, 352, 0)') ).
fof('holds(213, 351, 1)',axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(213, 351, 1)') ).
fof('holds(213, 351, 0)',axiom,
vplus(vd345,vd347) = vplus(vd347,vd345),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(213, 351, 0)') ).
fof('holds(213, 351, 2)',axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(213, 351, 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X9,X10] :
( less(X9,X10)
=> greater(X10,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X13,X14] :
( less(X13,X14)
| greater(X13,X14)
| X13 = X14 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('holds(212, 350, 0)',axiom,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(212, 350, 0)') ).
fof(c_0_13,plain,
! [X13,X14] :
( ~ less(X13,X14)
| ~ greater(X13,X14) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
fof(c_0_14,plain,
! [X58,X59] :
( ~ less(X58,X59)
| ~ greater(X58,X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_13])]) ).
fof(c_0_15,plain,
! [X54,X55] :
( less(X55,X54)
| ~ greater(X54,X55) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).
fof(c_0_16,plain,
! [X50,X51] : greater(vplus(X50,X51),X50),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_17,plain,
! [X69,X70] : vplus(X70,X69) = vplus(X69,X70),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ greater(X1,X2)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
greater(vplus(X1,X2),X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X74,X75,X76] : vplus(vplus(X74,X75),X76) = vplus(X74,vplus(X75,X76)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_25,plain,
~ greater(X1,vplus(X2,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
~ greater(X1,vplus(X2,vplus(X3,X1))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_28,plain,
! [X60,X61,X63,X64,X65] :
( ( greater(X64,X63)
| X64 != vplus(X63,X65) )
& ( X61 = vplus(X60,esk1_2(X60,X61))
| ~ greater(X61,X60) ) ),
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_29,plain,
~ greater(X1,vplus(X2,vplus(X1,X3))),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_30,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_31,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(assume_negation,[status(cth)],['holds(214, 352, 0)']) ).
cnf(c_0_32,plain,
( ~ greater(X3,X1)
| ~ greater(X1,vplus(X2,X3)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_33,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[c_0_31]) ).
cnf(c_0_34,plain,
( ~ greater(X2,X1)
| ~ greater(X1,vplus(X2,X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_35,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(split_conjunct,[status(thm)],['holds(213, 351, 1)']) ).
cnf(c_0_36,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],['holds(213, 351, 0)']) ).
cnf(c_0_37,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
inference(split_conjunct,[status(thm)],['holds(213, 351, 2)']) ).
fof(c_0_38,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_nnf,[status(thm)],[c_0_33]) ).
fof(c_0_39,plain,
! [X52,X53] :
( greater(X53,X52)
| ~ less(X52,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).
fof(c_0_40,plain,
! [X56,X57] :
( less(X56,X57)
| greater(X56,X57)
| X56 = X57 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_41,plain,
( ~ greater(X2,X3)
| ~ greater(X3,X1)
| ~ greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_42,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_43,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(split_conjunct,[status(thm)],['holds(212, 350, 0)']) ).
cnf(c_0_44,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( ~ less(X1,X2)
| greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,plain,
( ~ greater(vplus(vd345,vd348),X1)
| ~ greater(X1,vplus(vd345,vd347)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
greater(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(rw,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_49,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(rw,[status(thm)],[c_0_44,c_0_21]) ).
cnf(c_0_50,plain,
( greater(X2,X1)
| greater(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
~ greater(vplus(vd345,vd348),vplus(vd347,vd344)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
~ greater(vplus(vd345,vd347),vplus(vd347,vd344)),
inference(spm,[status(thm)],[c_0_22,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
vplus(vd347,vd344) = vplus(vd345,vd348),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM841+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n010.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:13:10 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.44 % Version: 3.5.1
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44 % Starting sh5l with 300s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4105449 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.13/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4105456 completed with status 0
% 0.13/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44 % No SInE strategy applied
% 0.13/0.44 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.13/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44 % Preprocessing time : 0.001 s
% 0.13/0.44 % Presaturation interreduction done
% 0.13/0.44
% 0.13/0.44 % Proof found!
% 0.13/0.44 % SZS status Theorem
% 0.13/0.44 % SZS output start CNFRefutation
% See solution above
% 0.13/0.44 % Parsed axioms : 26
% 0.13/0.44 % Removed by relevancy pruning/SinE : 0
% 0.13/0.44 % Initial clauses : 28
% 0.13/0.44 % Removed in clause preprocessing : 2
% 0.13/0.44 % Initial clauses in saturation : 26
% 0.13/0.44 % Processed clauses : 238
% 0.13/0.44 % ...of these trivial : 4
% 0.13/0.44 % ...subsumed : 111
% 0.13/0.44 % ...remaining for further processing : 123
% 0.13/0.44 % Other redundant clauses eliminated : 8
% 0.13/0.44 % Clauses deleted for lack of memory : 0
% 0.13/0.44 % Backward-subsumed : 3
% 0.13/0.44 % Backward-rewritten : 10
% 0.13/0.44 % Generated clauses : 553
% 0.13/0.44 % ...of the previous two non-redundant : 461
% 0.13/0.44 % ...aggressively subsumed : 0
% 0.13/0.44 % Contextual simplify-reflections : 0
% 0.13/0.44 % Paramodulations : 541
% 0.13/0.44 % Factorizations : 2
% 0.13/0.44 % NegExts : 0
% 0.13/0.44 % Equation resolutions : 10
% 0.13/0.44 % Disequality decompositions : 0
% 0.13/0.44 % Total rewrite steps : 80
% 0.13/0.44 % ...of those cached : 41
% 0.13/0.44 % Propositional unsat checks : 0
% 0.13/0.44 % Propositional check models : 0
% 0.13/0.44 % Propositional check unsatisfiable : 0
% 0.13/0.44 % Propositional clauses : 0
% 0.13/0.44 % Propositional clauses after purity: 0
% 0.13/0.44 % Propositional unsat core size : 0
% 0.13/0.44 % Propositional preprocessing time : 0.000
% 0.13/0.44 % Propositional encoding time : 0.000
% 0.13/0.44 % Propositional solver time : 0.000
% 0.13/0.44 % Success case prop preproc time : 0.000
% 0.13/0.44 % Success case prop encoding time : 0.000
% 0.13/0.44 % Success case prop solver time : 0.000
% 0.13/0.44 % Current number of processed clauses : 88
% 0.13/0.44 % Positive orientable unit clauses : 11
% 0.13/0.44 % Positive unorientable unit clauses: 1
% 0.13/0.44 % Negative unit clauses : 30
% 0.13/0.44 % Non-unit-clauses : 46
% 0.13/0.44 % Current number of unprocessed clauses: 267
% 0.13/0.44 % ...number of literals in the above : 602
% 0.13/0.44 % Current number of archived formulas : 0
% 0.13/0.44 % Current number of archived clauses : 34
% 0.13/0.44 % Clause-clause subsumption calls (NU) : 494
% 0.13/0.44 % Rec. Clause-clause subsumption calls : 481
% 0.13/0.44 % Non-unit clause-clause subsumptions : 33
% 0.13/0.44 % Unit Clause-clause subsumption calls : 252
% 0.13/0.44 % Rewrite failures with RHS unbound : 0
% 0.13/0.44 % BW rewrite match attempts : 47
% 0.13/0.44 % BW rewrite match successes : 32
% 0.13/0.44 % Condensation attempts : 0
% 0.13/0.44 % Condensation successes : 0
% 0.13/0.44 % Termbank termtop insertions : 5533
% 0.13/0.44 % Search garbage collected termcells : 190
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.010 s
% 0.13/0.44 % System time : 0.004 s
% 0.13/0.44 % Total time : 0.014 s
% 0.13/0.44 % Maximum resident set size: 3356 pages
% 0.13/0.44
% 0.13/0.44 % -------------------------------------------------
% 0.13/0.44 % User time : 0.029 s
% 0.13/0.44 % System time : 0.019 s
% 0.13/0.44 % Total time : 0.048 s
% 0.13/0.44 % Maximum resident set size: 4608 pages
% 0.13/0.44 % E exiting
%------------------------------------------------------------------------------