%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM852+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 : n016.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:51 PM UTC 2026
% Result : Theorem 0.45s 0.52s
% Output : CNFRefutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 21 unt; 0 def)
% Number of atoms : 27 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 2 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)',conjecture,
greater(vmul(vd481,vd469),vmul(vd480,vd469)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X41,X42] : greater(vplus(X41,X42),X41),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).
fof('ass(cond(281, 0), 0)',axiom,
! [X8,X9,X10] : vmul(X8,vplus(X9,X10)) = vplus(vmul(X8,X9),vmul(X8,X10)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).
fof('ass(cond(302, 0), 3)',axiom,
! [X3,X4] :
( greater(X3,X4)
=> X3 = vplus(X4,vskolem9(X3,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(302, 0), 3)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X11,X12] : vmul(X11,X12) = vmul(X12,X11),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('holds(conseq_conjunct1(conseq(304)), 483, 0)',axiom,
greater(vd481,vd480),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq_conjunct1(conseq(304)), 483, 0)') ).
fof(c_0_6,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(assume_negation,[status(cth)],['holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)']) ).
fof(c_0_7,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X156,X157] : greater(vplus(X156,X157),X156),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_9,plain,
! [X111,X112,X113] : vmul(X111,vplus(X112,X113)) = vplus(vmul(X111,X112),vmul(X111,X113)),
inference(variable_rename,[status(thm)],['ass(cond(281, 0), 0)']) ).
fof(c_0_10,plain,
! [X106,X107] :
( X106 = vplus(X107,vskolem9(X106,X107))
| ~ greater(X106,X107) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(302, 0), 3)'])])]) ).
fof(c_0_11,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X114,X115] : vmul(X114,X115) = vmul(X115,X114),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
cnf(c_0_13,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ greater(X1,X2)
| X1 = vplus(X2,vskolem9(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
greater(vd481,vd480),
inference(split_conjunct,[status(thm)],['holds(conseq_conjunct1(conseq(304)), 483, 0)']) ).
cnf(c_0_17,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
vplus(vd480,vskolem9(vd481,vd480)) = vd481,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
greater(vmul(X1,vd481),vmul(X1,vd480)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM852+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n016.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:18:08 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.45/0.52 % Version: 3.5.1
% 0.45/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.45/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.45/0.52 % Starting sh5l with 300s (1) cores
% 0.45/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1429393 completed with status 0
% 0.45/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.45/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.52 % No SInE strategy applied
% 0.45/0.52 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.45/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.52 % Starting U----_210g_02_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.45/0.52 % Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S00EN with 136s (1) cores
% 0.45/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.45/0.52 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1429399 completed with status 0
% 0.45/0.52 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.45/0.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.45/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.45/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.45/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.45/0.52 % No SInE strategy applied
% 0.45/0.52 % Search class: FGHSM-FFMF21-MFFFFFNN
% 0.45/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.45/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.45/0.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.45/0.52 % Preprocessing time : 0.002 s
% 0.45/0.52 % Presaturation interreduction done
% 0.45/0.52
% 0.45/0.52 % Proof found!
% 0.45/0.52 % SZS status Theorem
% 0.45/0.52 % SZS output start CNFRefutation
% See solution above
% 0.45/0.52 % Parsed axioms : 58
% 0.45/0.52 % Removed by relevancy pruning/SinE : 0
% 0.45/0.52 % Initial clauses : 68
% 0.45/0.52 % Removed in clause preprocessing : 3
% 0.45/0.52 % Initial clauses in saturation : 65
% 0.45/0.52 % Processed clauses : 1036
% 0.45/0.52 % ...of these trivial : 59
% 0.45/0.52 % ...subsumed : 597
% 0.45/0.52 % ...remaining for further processing : 380
% 0.45/0.52 % Other redundant clauses eliminated : 46
% 0.45/0.52 % Clauses deleted for lack of memory : 0
% 0.45/0.52 % Backward-subsumed : 9
% 0.45/0.52 % Backward-rewritten : 28
% 0.45/0.52 % Generated clauses : 4534
% 0.45/0.52 % ...of the previous two non-redundant : 4176
% 0.45/0.52 % ...aggressively subsumed : 0
% 0.45/0.52 % Contextual simplify-reflections : 0
% 0.45/0.52 % Paramodulations : 4482
% 0.45/0.52 % Factorizations : 2
% 0.45/0.52 % NegExts : 0
% 0.45/0.52 % Equation resolutions : 50
% 0.45/0.52 % Disequality decompositions : 0
% 0.45/0.52 % Total rewrite steps : 1193
% 0.45/0.52 % ...of those cached : 883
% 0.45/0.52 % Propositional unsat checks : 0
% 0.45/0.52 % Propositional check models : 0
% 0.45/0.52 % Propositional check unsatisfiable : 0
% 0.45/0.52 % Propositional clauses : 0
% 0.45/0.52 % Propositional clauses after purity: 0
% 0.45/0.52 % Propositional unsat core size : 0
% 0.45/0.52 % Propositional preprocessing time : 0.000
% 0.45/0.52 % Propositional encoding time : 0.000
% 0.45/0.52 % Propositional solver time : 0.000
% 0.45/0.52 % Success case prop preproc time : 0.000
% 0.45/0.52 % Success case prop encoding time : 0.000
% 0.45/0.52 % Success case prop solver time : 0.000
% 0.45/0.52 % Current number of processed clauses : 280
% 0.45/0.52 % Positive orientable unit clauses : 85
% 0.45/0.52 % Positive unorientable unit clauses: 9
% 0.45/0.52 % Negative unit clauses : 101
% 0.45/0.52 % Non-unit-clauses : 85
% 0.45/0.52 % Current number of unprocessed clauses: 3228
% 0.45/0.52 % ...number of literals in the above : 5423
% 0.45/0.52 % Current number of archived formulas : 0
% 0.45/0.52 % Current number of archived clauses : 92
% 0.45/0.52 % Clause-clause subsumption calls (NU) : 1079
% 0.45/0.52 % Rec. Clause-clause subsumption calls : 945
% 0.45/0.52 % Non-unit clause-clause subsumptions : 51
% 0.45/0.52 % Unit Clause-clause subsumption calls : 1937
% 0.45/0.52 % Rewrite failures with RHS unbound : 0
% 0.45/0.52 % BW rewrite match attempts : 171
% 0.45/0.52 % BW rewrite match successes : 105
% 0.45/0.52 % Condensation attempts : 0
% 0.45/0.52 % Condensation successes : 0
% 0.45/0.52 % Termbank termtop insertions : 37201
% 0.45/0.52 % Search garbage collected termcells : 716
% 0.45/0.52
% 0.45/0.52 % -------------------------------------------------
% 0.45/0.52 % User time : 0.075 s
% 0.45/0.52 % System time : 0.008 s
% 0.45/0.52 % Total time : 0.083 s
% 0.45/0.52 % Maximum resident set size: 3728 pages
% 0.45/0.52
% 0.45/0.52 % -------------------------------------------------
% 0.45/0.52 % User time : 0.293 s
% 0.45/0.52 % System time : 0.030 s
% 0.45/0.52 % Total time : 0.323 s
% 0.45/0.52 % Maximum resident set size: 4608 pages
% 0.45/0.52 % E exiting
%------------------------------------------------------------------------------