%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM786_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:39 PM UTC 2026
% Result : Theorem 0.24s 0.55s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 17 ~; 4 |; 1 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
rat: $tType ).
tff(decl_23,type,
x0: rat ).
tff(decl_24,type,
y0: rat ).
tff(decl_25,type,
more: ( rat * rat ) > $o ).
tff(decl_26,type,
less: ( rat * rat ) > $o ).
tff(decl_27,type,
is: ( rat * rat ) > $o ).
tff(satz81e,conjecture,
( ~ less(x0,y0)
=> is(x0,y0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81e) ).
tff(n,axiom,
~ more(x0,y0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(satz81a,axiom,
! [X2: rat,X3: rat] :
( ~ is(X2,X3)
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz81a) ).
tff(c_0_3,negated_conjecture,
~ ( ~ less(x0,y0)
=> is(x0,y0) ),
inference(assume_negation,[status(cth)],[satz81e]) ).
tff(c_0_4,plain,
~ more(x0,y0),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_5,plain,
! [X2: rat,X3: rat] :
( ~ is(X2,X3)
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz81a]) ).
tff(c_0_6,negated_conjecture,
~ ( ~ less(x0,y0)
=> is(x0,y0) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_7,plain,
~ more(x0,y0),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tff(c_0_8,plain,
! [X4: rat,X5: rat] :
( less(X4,X5)
| more(X4,X5)
| is(X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
tff(c_0_9,negated_conjecture,
( ~ is(x0,y0)
& ~ less(x0,y0) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).
tcf(c_0_10,plain,
~ more(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X2: rat,X3: rat] :
( less(X2,X3)
| more(X2,X3)
| is(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,negated_conjecture,
~ is(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_13,negated_conjecture,
~ less(x0,y0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM786_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n004.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 03:07:05 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.24/0.55 % Version: 3.5.1
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % sh5l with pid 2117380 completed with status 0
% 0.24/0.55 % Result found by sh5l
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.55 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.24/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.55 % SubtermCWHack with pid 2117381 completed with status 0
% 0.24/0.55 % Result found by SubtermCWHack
% 0.24/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.24/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.24/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.55 % Starting sh5l with 300s (1) cores
% 0.24/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.24/0.55 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.24/0.55 % Search class: FGUNF-FFSF00-SFFFFFNN
% 0.24/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.55 % Preprocessing time : 0.002 s
% 0.24/0.55
% 0.24/0.55 % Proof found!
% 0.24/0.55 % SZS status Theorem
% 0.24/0.55 % SZS output start CNFRefutation
% See solution above
% 0.24/0.55 % Parsed axioms : 10
% 0.24/0.55 % Removed by relevancy pruning/SinE : 7
% 0.24/0.55 % Initial clauses : 4
% 0.24/0.55 % Removed in clause preprocessing : 0
% 0.24/0.55 % Initial clauses in saturation : 4
% 0.24/0.55 % Processed clauses : 4
% 0.24/0.55 % ...of these trivial : 0
% 0.24/0.55 % ...subsumed : 0
% 0.24/0.55 % ...remaining for further processing : 4
% 0.24/0.55 % Other redundant clauses eliminated : 0
% 0.24/0.55 % Clauses deleted for lack of memory : 0
% 0.24/0.55 % Backward-subsumed : 0
% 0.24/0.55 % Backward-rewritten : 0
% 0.24/0.55 % Generated clauses : 1
% 0.24/0.55 % ...of the previous two non-redundant : 0
% 0.24/0.55 % ...aggressively subsumed : 0
% 0.24/0.55 % Contextual simplify-reflections : 0
% 0.24/0.55 % Paramodulations : 1
% 0.24/0.55 % Factorizations : 0
% 0.24/0.55 % NegExts : 0
% 0.24/0.55 % Equation resolutions : 0
% 0.24/0.55 % Disequality decompositions : 0
% 0.24/0.55 % Total rewrite steps : 0
% 0.24/0.55 % ...of those cached : 0
% 0.24/0.55 % Propositional unsat checks : 0
% 0.24/0.55 % Propositional check models : 0
% 0.24/0.55 % Propositional check unsatisfiable : 0
% 0.24/0.55 % Propositional clauses : 0
% 0.24/0.55 % Propositional clauses after purity: 0
% 0.24/0.55 % Propositional unsat core size : 0
% 0.24/0.55 % Propositional preprocessing time : 0.000
% 0.24/0.55 % Propositional encoding time : 0.000
% 0.24/0.55 % Propositional solver time : 0.000
% 0.24/0.55 % Success case prop preproc time : 0.000
% 0.24/0.55 % Success case prop encoding time : 0.000
% 0.24/0.55 % Success case prop solver time : 0.000
% 0.24/0.55 % Current number of processed clauses : 4
% 0.24/0.55 % Positive orientable unit clauses : 0
% 0.24/0.55 % Positive unorientable unit clauses: 0
% 0.24/0.55 % Negative unit clauses : 3
% 0.24/0.55 % Non-unit-clauses : 1
% 0.24/0.55 % Current number of unprocessed clauses: 0
% 0.24/0.55 % ...number of literals in the above : 0
% 0.24/0.55 % Current number of archived formulas : 0
% 0.24/0.55 % Current number of archived clauses : 0
% 0.24/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.24/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.24/0.55 % Non-unit clause-clause subsumptions : 0
% 0.24/0.55 % Unit Clause-clause subsumption calls : 0
% 0.24/0.55 % Rewrite failures with RHS unbound : 0
% 0.24/0.55 % BW rewrite match attempts : 0
% 0.24/0.55 % BW rewrite match successes : 0
% 0.24/0.55 % Condensation attempts : 0
% 0.24/0.55 % Condensation successes : 0
% 0.24/0.55 % Termbank termtop insertions : 207
% 0.24/0.55 % Search garbage collected termcells : 20
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.003 s
% 0.24/0.55 % System time : 0.002 s
% 0.24/0.55 % Total time : 0.005 s
% 0.24/0.55 % Maximum resident set size: 3888 pages
% 0.24/0.55
% 0.24/0.55 % -------------------------------------------------
% 0.24/0.55 % User time : 0.004 s
% 0.24/0.55 % System time : 0.009 s
% 0.24/0.55 % Total time : 0.013 s
% 0.24/0.55 % Maximum resident set size: 4608 pages
% 0.24/0.55 % E exiting
%------------------------------------------------------------------------------