%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM839+1 : 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 : n002.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.26s 0.59s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 20 unt; 0 def)
% Number of atoms : 89 ( 42 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 : 5 ( 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 : 93 ( 7 sgn 47 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(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('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(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(168, 0), 0)',axiom,
! [X12,X13,X14] :
( ( less(X12,X13)
& less(X13,X14) )
=> less(X12,X14) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 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('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), 3)',axiom,
! [X27,X28] :
( ~ greater(X27,X28)
| X27 != X28 ),
file('/export/starexec/sandbox/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/sandbox/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,
! [X117,X118,X119] :
( X118 != vplus(X117,X119)
| X117 != X118 ),
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,
! [X93,X94] :
( less(X93,X94)
| greater(X93,X94)
| X93 = X94 ),
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,
! [X137,X138,X139] : vplus(vplus(X137,X138),X139) = vplus(X137,vplus(X138,X139)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
fof(c_0_18,plain,
! [X78,X79,X80] :
( less(X78,X80)
| ~ less(X78,X79)
| ~ less(X79,X80) ),
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,
! [X101,X102,X104,X105,X106] :
( ( less(X105,X104)
| X104 != vplus(X105,X106) )
& ( X101 = vplus(X102,esk1_2(X101,X102))
| ~ less(X102,X101) ) ),
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,
! [X107,X108,X110,X111,X112] :
( ( greater(X111,X110)
| X111 != vplus(X110,X112) )
& ( X108 = vplus(X107,esk2_2(X107,X108))
| ~ greater(X108,X107) ) ),
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_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,
( ~ greater(X1,X2)
| X1 = vplus(X2,esk2_2(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,
( ~ greater(X3,vplus(X1,X2))
| vplus(X1,vplus(X2,esk2_2(vplus(X1,X2),X3))) = X3 ),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
fof(c_0_37,plain,
! [X132,X133] : vplus(X133,X132) = vplus(X132,X133),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
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,
( ~ greater(vplus(X1,vd328),vplus(X1,vd329))
| vd329 = vd328 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_40,plain,
vplus(X1,X2) = vplus(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,
! [X99,X100] :
( ~ greater(X99,X100)
| X99 != X100 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_38])]) ).
cnf(c_0_43,negated_conjecture,
( ~ greater(vplus(vd328,X1),vplus(X1,vd329))
| 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_40]) ).
cnf(c_0_45,plain,
( ~ greater(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_46,negated_conjecture,
vd329 = vd328,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_46]),c_0_40]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM839+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n002.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 03:14:48 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.50 Running first-order theorem proving
% 0.26/0.50 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.26/0.59 % Version: 3.5.1
% 0.26/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.59 % Starting sh5l with 300s (1) cores
% 0.26/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2302679 completed with status 0
% 0.26/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59 % No SInE strategy applied
% 0.26/0.59 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.26/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.59 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.59 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.59 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 2302687 completed with status 0
% 0.26/0.59 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.59 % No SInE strategy applied
% 0.26/0.59 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.26/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.59 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.59 % Preprocessing time : 0.001 s
% 0.26/0.59 % Presaturation interreduction done
% 0.26/0.59
% 0.26/0.59 % Proof found!
% 0.26/0.59 % SZS status Theorem
% 0.26/0.59 % SZS output start CNFRefutation
% See solution above
% 0.26/0.59 % Parsed axioms : 37
% 0.26/0.59 % Removed by relevancy pruning/SinE : 0
% 0.26/0.59 % Initial clauses : 45
% 0.26/0.59 % Removed in clause preprocessing : 2
% 0.26/0.59 % Initial clauses in saturation : 43
% 0.26/0.59 % Processed clauses : 1019
% 0.26/0.59 % ...of these trivial : 16
% 0.26/0.59 % ...subsumed : 671
% 0.26/0.59 % ...remaining for further processing : 332
% 0.26/0.59 % Other redundant clauses eliminated : 82
% 0.26/0.59 % Clauses deleted for lack of memory : 0
% 0.26/0.59 % Backward-subsumed : 10
% 0.26/0.59 % Backward-rewritten : 109
% 0.26/0.59 % Generated clauses : 3444
% 0.26/0.59 % ...of the previous two non-redundant : 3290
% 0.26/0.59 % ...aggressively subsumed : 0
% 0.26/0.59 % Contextual simplify-reflections : 1
% 0.26/0.59 % Paramodulations : 3356
% 0.26/0.59 % Factorizations : 2
% 0.26/0.59 % NegExts : 0
% 0.26/0.59 % Equation resolutions : 86
% 0.26/0.59 % Disequality decompositions : 0
% 0.26/0.59 % Total rewrite steps : 813
% 0.26/0.59 % ...of those cached : 642
% 0.26/0.59 % Propositional unsat checks : 0
% 0.26/0.59 % Propositional check models : 0
% 0.26/0.59 % Propositional check unsatisfiable : 0
% 0.26/0.59 % Propositional clauses : 0
% 0.26/0.59 % Propositional clauses after purity: 0
% 0.26/0.59 % Propositional unsat core size : 0
% 0.26/0.59 % Propositional preprocessing time : 0.000
% 0.26/0.59 % Propositional encoding time : 0.000
% 0.26/0.59 % Propositional solver time : 0.000
% 0.26/0.59 % Success case prop preproc time : 0.000
% 0.26/0.59 % Success case prop encoding time : 0.000
% 0.26/0.59 % Success case prop solver time : 0.000
% 0.26/0.59 % Current number of processed clauses : 170
% 0.26/0.59 % Positive orientable unit clauses : 25
% 0.26/0.59 % Positive unorientable unit clauses: 3
% 0.26/0.59 % Negative unit clauses : 40
% 0.26/0.59 % Non-unit-clauses : 102
% 0.26/0.59 % Current number of unprocessed clauses: 2312
% 0.26/0.59 % ...number of literals in the above : 4962
% 0.26/0.59 % Current number of archived formulas : 0
% 0.26/0.59 % Current number of archived clauses : 154
% 0.26/0.59 % Clause-clause subsumption calls (NU) : 5134
% 0.26/0.59 % Rec. Clause-clause subsumption calls : 4216
% 0.26/0.59 % Non-unit clause-clause subsumptions : 339
% 0.26/0.59 % Unit Clause-clause subsumption calls : 291
% 0.26/0.59 % Rewrite failures with RHS unbound : 0
% 0.26/0.59 % BW rewrite match attempts : 58
% 0.26/0.59 % BW rewrite match successes : 48
% 0.26/0.59 % Condensation attempts : 0
% 0.26/0.59 % Condensation successes : 0
% 0.26/0.59 % Termbank termtop insertions : 27520
% 0.26/0.59 % Search garbage collected termcells : 515
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.062 s
% 0.26/0.59 % System time : 0.005 s
% 0.26/0.59 % Total time : 0.067 s
% 0.26/0.59 % Maximum resident set size: 3384 pages
% 0.26/0.59
% 0.26/0.59 % -------------------------------------------------
% 0.26/0.59 % User time : 0.262 s
% 0.26/0.59 % System time : 0.029 s
% 0.26/0.59 % Total time : 0.291 s
% 0.26/0.59 % Maximum resident set size: 4608 pages
% 0.26/0.59 % E exiting
%------------------------------------------------------------------------------