%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM840+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 : n011.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.42s 0.48s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 16 unt; 0 def)
% Number of atoms : 66 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 59 ( 32 ~; 24 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X8,X9] :
( ~ less(X8,X9)
| ~ greater(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X4,X5] :
( less(X4,X5)
=> greater(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X25,X26] : vplus(X26,X25) = vplus(X25,X26),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('holds(antec(conjunct2(conjunct2(204))), 335, 0)',axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).
fof('ass(cond(goal(193), 0), 0)',axiom,
! [X1,X2,X3] :
( less(X1,X2)
=> less(vplus(X1,X3),vplus(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).
fof('holds(conseq(conjunct2(conjunct2(204))), 336, 0)',conjecture,
less(vd328,vd329),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conseq(conjunct2(conjunct2(204))), 336, 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X6,X7] :
( greater(X6,X7)
=> less(X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X8,X9] :
( less(X8,X9)
| greater(X8,X9)
| X8 = X9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X8,X9] :
( ~ less(X8,X9)
| X8 != X9 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof(c_0_9,plain,
! [X8,X9] :
( ~ less(X8,X9)
| ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
fof(c_0_10,plain,
! [X52,X53] :
( ~ less(X52,X53)
| ~ greater(X52,X53) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).
fof(c_0_11,plain,
! [X44,X45] :
( greater(X45,X44)
| ~ less(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).
fof(c_0_12,plain,
! [X87,X88] : vplus(X88,X87) = vplus(X87,X88),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ less(X1,X2)
| greater(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(conjunct2(conjunct2(204))), 335, 0)']) ).
cnf(c_0_16,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X35,X36,X37] :
( less(vplus(X35,X37),vplus(X36,X37))
| ~ less(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 0)'])])]) ).
fof(c_0_18,negated_conjecture,
~ less(vd328,vd329),
inference(assume_negation,[status(cth)],['holds(conseq(conjunct2(conjunct2(204))), 336, 0)']) ).
cnf(c_0_19,plain,
( ~ less(X2,X1)
| ~ less(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ less(X1,X2)
| less(vplus(X1,X3),vplus(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X46,X47] :
( less(X47,X46)
| ~ greater(X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])])]) ).
fof(c_0_23,plain,
! [X48,X49] :
( less(X48,X49)
| greater(X48,X49)
| X48 = X49 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_24,negated_conjecture,
~ less(vd328,vd329),
inference(fof_simplification,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X8,X9] :
( ~ less(X8,X9)
| X8 != X9 ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)']) ).
cnf(c_0_26,plain,
~ less(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ less(X2,X3)
| less(vplus(X1,X2),vplus(X3,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_28,plain,
( ~ greater(X1,X2)
| less(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,negated_conjecture,
~ less(vd328,vd329),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
fof(c_0_31,plain,
! [X50,X51] :
( ~ less(X50,X51)
| X50 != X51 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])]) ).
cnf(c_0_32,plain,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( less(X2,X1)
| less(X1,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
~ less(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,plain,
( ~ less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_36]),c_0_16]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM840+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n011.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 03:12:40 UTC 2026
% 0.13/0.38 % CPUTime :
% 0.13/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.42/0.48 % Version: 3.5.1
% 0.42/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.42/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.42/0.48 % Starting sh5l with 300s (1) cores
% 0.42/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 836552 completed with status 0
% 0.42/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.42/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.42/0.48 % No SInE strategy applied
% 0.42/0.48 % Search class: FGHSM-FFMF22-SFFFFFNN
% 0.42/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.42/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.42/0.48 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_CO_S0Y with 136s (1) cores
% 0.42/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.42/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.42/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 836558 completed with status 0
% 0.42/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.42/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.42/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.42/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.42/0.48 % No SInE strategy applied
% 0.42/0.48 % Search class: FGHSM-FFMF22-SFFFFFNN
% 0.42/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.42/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.42/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.42/0.48 % Preprocessing time : 0.001 s
% 0.42/0.48 % Presaturation interreduction done
% 0.42/0.48
% 0.42/0.48 % Proof found!
% 0.42/0.48 % SZS status Theorem
% 0.42/0.48 % SZS output start CNFRefutation
% See solution above
% 0.42/0.48 % Parsed axioms : 26
% 0.42/0.48 % Removed by relevancy pruning/SinE : 0
% 0.42/0.48 % Initial clauses : 29
% 0.42/0.48 % Removed in clause preprocessing : 2
% 0.42/0.48 % Initial clauses in saturation : 27
% 0.42/0.48 % Processed clauses : 408
% 0.42/0.48 % ...of these trivial : 15
% 0.42/0.48 % ...subsumed : 230
% 0.42/0.48 % ...remaining for further processing : 163
% 0.42/0.48 % Other redundant clauses eliminated : 47
% 0.42/0.48 % Clauses deleted for lack of memory : 0
% 0.42/0.48 % Backward-subsumed : 13
% 0.42/0.48 % Backward-rewritten : 21
% 0.42/0.48 % Generated clauses : 1928
% 0.42/0.48 % ...of the previous two non-redundant : 1827
% 0.42/0.48 % ...aggressively subsumed : 0
% 0.42/0.48 % Contextual simplify-reflections : 0
% 0.42/0.48 % Paramodulations : 1876
% 0.42/0.48 % Factorizations : 2
% 0.42/0.48 % NegExts : 0
% 0.42/0.48 % Equation resolutions : 50
% 0.42/0.48 % Disequality decompositions : 0
% 0.42/0.48 % Total rewrite steps : 318
% 0.42/0.48 % ...of those cached : 210
% 0.42/0.48 % Propositional unsat checks : 0
% 0.42/0.48 % Propositional check models : 0
% 0.42/0.48 % Propositional check unsatisfiable : 0
% 0.42/0.48 % Propositional clauses : 0
% 0.42/0.48 % Propositional clauses after purity: 0
% 0.42/0.48 % Propositional unsat core size : 0
% 0.42/0.48 % Propositional preprocessing time : 0.000
% 0.42/0.48 % Propositional encoding time : 0.000
% 0.42/0.48 % Propositional solver time : 0.000
% 0.42/0.48 % Success case prop preproc time : 0.000
% 0.42/0.48 % Success case prop encoding time : 0.000
% 0.42/0.48 % Success case prop solver time : 0.000
% 0.42/0.48 % Current number of processed clauses : 100
% 0.42/0.48 % Positive orientable unit clauses : 19
% 0.42/0.48 % Positive unorientable unit clauses: 3
% 0.42/0.48 % Negative unit clauses : 20
% 0.42/0.48 % Non-unit-clauses : 58
% 0.42/0.48 % Current number of unprocessed clauses: 1452
% 0.42/0.48 % ...number of literals in the above : 3255
% 0.42/0.48 % Current number of archived formulas : 0
% 0.42/0.48 % Current number of archived clauses : 57
% 0.42/0.48 % Clause-clause subsumption calls (NU) : 1365
% 0.42/0.48 % Rec. Clause-clause subsumption calls : 1244
% 0.42/0.48 % Non-unit clause-clause subsumptions : 111
% 0.42/0.48 % Unit Clause-clause subsumption calls : 154
% 0.42/0.48 % Rewrite failures with RHS unbound : 0
% 0.42/0.48 % BW rewrite match attempts : 62
% 0.42/0.48 % BW rewrite match successes : 51
% 0.42/0.48 % Condensation attempts : 0
% 0.42/0.48 % Condensation successes : 0
% 0.42/0.48 % Termbank termtop insertions : 15376
% 0.42/0.48 % Search garbage collected termcells : 301
% 0.42/0.48
% 0.42/0.48 % -------------------------------------------------
% 0.42/0.48 % User time : 0.032 s
% 0.42/0.48 % System time : 0.006 s
% 0.42/0.48 % Total time : 0.038 s
% 0.42/0.48 % Maximum resident set size: 3664 pages
% 0.42/0.48
% 0.42/0.48 % -------------------------------------------------
% 0.42/0.48 % User time : 0.137 s
% 0.42/0.48 % System time : 0.020 s
% 0.42/0.48 % Total time : 0.157 s
% 0.42/0.48 % Maximum resident set size: 4608 pages
% 0.42/0.48 % E exiting
%------------------------------------------------------------------------------