%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM843+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 : n009.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.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 14 unt; 0 def)
% Number of atoms : 53 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 47 ( 20 ~; 20 |; 4 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 25 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conjunct2(243), 393, 0)',axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(243), 393, 0)') ).
fof('holds(244, 394, 0)',conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(244, 394, 0)') ).
fof('def(cond(conseq(axiom(3)), 17), 1)',axiom,
! [X37,X38] :
( leq(X38,X37)
<=> ( X38 = X37
| less(X38,X37) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).
fof('ass(cond(158, 0), 0)',axiom,
! [X35,X36] :
( geq(X35,X36)
=> leq(X36,X35) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(158, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X45,X46] :
( less(X45,X46)
| greater(X45,X46)
| X45 = X46 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X39,X40] :
( geq(X40,X39)
<=> ( X40 = X39
| greater(X40,X39) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof(c_0_6,plain,
~ leq(vd390,vd391),
inference(fof_simplification,[status(thm)],['holds(conjunct2(243), 393, 0)']) ).
fof(c_0_7,negated_conjecture,
~ greater(vd390,vd391),
inference(assume_negation,[status(cth)],['holds(244, 394, 0)']) ).
fof(c_0_8,plain,
~ leq(vd390,vd391),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X178,X179] :
( ( leq(X179,X178)
| X179 != X178 )
& ( leq(X179,X178)
| ~ less(X179,X178) )
& ( X179 = X178
| less(X179,X178)
| ~ leq(X179,X178) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)'])])])]) ).
fof(c_0_10,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X122,X123] :
( leq(X123,X122)
| ~ geq(X122,X123) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(158, 0), 0)'])])]) ).
cnf(c_0_12,plain,
~ leq(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ less(X1,X2)
| leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X103,X104] :
( less(X103,X104)
| greater(X103,X104)
| X103 = X104 ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_15,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X97,X98] :
( ( geq(X98,X97)
| X98 != X97 )
& ( geq(X98,X97)
| ~ greater(X98,X97) )
& ( X98 = X97
| greater(X98,X97)
| ~ geq(X98,X97) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
cnf(c_0_17,plain,
( ~ geq(X1,X2)
| leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
~ less(vd390,vd391),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( less(X1,X2)
| greater(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
~ greater(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( X1 != X2
| geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
~ geq(vd391,vd390),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_23,plain,
vd391 = vd390,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
geq(X1,X1),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM843+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.10/0.37 % Computer : n009.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:13:12 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.10/0.45 % Version: 3.5.1
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % sh5l with pid 711939 completed with status 0
% 0.10/0.45 % Result found by sh5l
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % SubtermCWHack with pid 711940 completed with status 0
% 0.10/0.45 % Result found by SubtermCWHack
% 0.10/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.45 % Starting sh5l with 300s (1) cores
% 0.10/0.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.45 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.45 % Search class: FGHSM-FFMF21-SFFFFFNN
% 0.10/0.45 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.45 % Starting SubtermCWHack with 28s (1) cores
% 0.10/0.45 % Preprocessing time : 0.002 s
% 0.10/0.45
% 0.10/0.45 % Proof found!
% 0.10/0.45 % SZS status Theorem
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.45 % Parsed axioms : 46
% 0.10/0.45 % Removed by relevancy pruning/SinE : 1
% 0.10/0.45 % Initial clauses : 54
% 0.10/0.45 % Removed in clause preprocessing : 1
% 0.10/0.45 % Initial clauses in saturation : 53
% 0.10/0.45 % Processed clauses : 67
% 0.10/0.45 % ...of these trivial : 1
% 0.10/0.45 % ...subsumed : 18
% 0.10/0.45 % ...remaining for further processing : 48
% 0.10/0.45 % Other redundant clauses eliminated : 6
% 0.10/0.45 % Clauses deleted for lack of memory : 0
% 0.10/0.45 % Backward-subsumed : 3
% 0.10/0.45 % Backward-rewritten : 10
% 0.10/0.45 % Generated clauses : 71
% 0.10/0.45 % ...of the previous two non-redundant : 57
% 0.10/0.45 % ...aggressively subsumed : 0
% 0.10/0.45 % Contextual simplify-reflections : 0
% 0.10/0.45 % Paramodulations : 64
% 0.10/0.45 % Factorizations : 0
% 0.10/0.45 % NegExts : 0
% 0.10/0.45 % Equation resolutions : 7
% 0.10/0.45 % Disequality decompositions : 0
% 0.10/0.45 % Total rewrite steps : 25
% 0.10/0.45 % ...of those cached : 12
% 0.10/0.45 % Propositional unsat checks : 0
% 0.10/0.45 % Propositional check models : 0
% 0.10/0.45 % Propositional check unsatisfiable : 0
% 0.10/0.45 % Propositional clauses : 0
% 0.10/0.45 % Propositional clauses after purity: 0
% 0.10/0.45 % Propositional unsat core size : 0
% 0.10/0.45 % Propositional preprocessing time : 0.000
% 0.10/0.45 % Propositional encoding time : 0.000
% 0.10/0.45 % Propositional solver time : 0.000
% 0.10/0.45 % Success case prop preproc time : 0.000
% 0.10/0.45 % Success case prop encoding time : 0.000
% 0.10/0.45 % Success case prop solver time : 0.000
% 0.10/0.45 % Current number of processed clauses : 29
% 0.10/0.45 % Positive orientable unit clauses : 9
% 0.10/0.45 % Positive unorientable unit clauses: 1
% 0.10/0.45 % Negative unit clauses : 8
% 0.10/0.45 % Non-unit-clauses : 11
% 0.10/0.45 % Current number of unprocessed clauses: 42
% 0.10/0.45 % ...number of literals in the above : 86
% 0.10/0.45 % Current number of archived formulas : 0
% 0.10/0.45 % Current number of archived clauses : 13
% 0.10/0.45 % Clause-clause subsumption calls (NU) : 5
% 0.10/0.45 % Rec. Clause-clause subsumption calls : 5
% 0.10/0.45 % Non-unit clause-clause subsumptions : 1
% 0.10/0.45 % Unit Clause-clause subsumption calls : 33
% 0.10/0.45 % Rewrite failures with RHS unbound : 0
% 0.10/0.45 % BW rewrite match attempts : 21
% 0.10/0.45 % BW rewrite match successes : 17
% 0.10/0.45 % Condensation attempts : 0
% 0.10/0.45 % Condensation successes : 0
% 0.10/0.45 % Termbank termtop insertions : 3529
% 0.10/0.45 % Search garbage collected termcells : 657
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.006 s
% 0.10/0.45 % System time : 0.003 s
% 0.10/0.45 % Total time : 0.008 s
% 0.10/0.45 % Maximum resident set size: 3708 pages
% 0.10/0.45
% 0.10/0.45 % -------------------------------------------------
% 0.10/0.45 % User time : 0.010 s
% 0.10/0.45 % System time : 0.006 s
% 0.10/0.45 % Total time : 0.015 s
% 0.10/0.45 % Maximum resident set size: 4608 pages
% 0.10/0.45 % E exiting
%------------------------------------------------------------------------------