%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM658_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 : n007.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:00 PM UTC 2026
% Result : Theorem 0.07s 0.41s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 27 ( 16 ~; 4 |; 1 &)
% ( 0 <=>; 6 =>; 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 ( 2 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,
nat: $tType ).
tff(decl_23,type,
x: nat ).
tff(decl_24,type,
y: nat ).
tff(decl_25,type,
more: ( nat * nat ) > $o ).
tff(decl_26,type,
less: ( nat * nat ) > $o ).
tff(satz10j,conjecture,
less(x,y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10j) ).
tff(n,axiom,
~ ( ~ more(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).
tff(satz10a,axiom,
! [X1: nat,X2: nat] :
( ( X1 != X2 )
=> ( ~ more(X1,X2)
=> less(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10a) ).
tff(c_0_3,negated_conjecture,
~ less(x,y),
inference(assume_negation,[status(cth)],[satz10j]) ).
tff(c_0_4,plain,
~ ( ~ more(x,y)
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[n]) ).
tff(c_0_5,plain,
! [X1: nat,X2: nat] :
( ( X1 != X2 )
=> ( ~ more(X1,X2)
=> less(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[satz10a]) ).
tff(c_0_6,negated_conjecture,
~ less(x,y),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_7,plain,
( ( x != y )
& ~ more(x,y) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
tff(c_0_8,plain,
! [X4: nat,X5: nat] :
( less(X4,X5)
| more(X4,X5)
| ( X4 = X5 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
tff(c_0_9,negated_conjecture,
~ less(x,y),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
~ more(x,y),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_11,plain,
! [X1: nat,X2: nat] :
( less(X1,X2)
| more(X1,X2)
| ( X1 = X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_12,plain,
x != y,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_13,negated_conjecture,
~ less(x,y),
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.03 % Problem : NUM658_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.35 % Computer : n007.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Mon Sep 21 02:47:37 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.07/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.40 Running first-order theorem proving
% 0.07/0.40 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.07/0.41 % Version: 3.5.1
% 0.07/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.41 % Starting sh5l with 300s (1) cores
% 0.07/0.41 % new_bool_3 with pid 9680 completed with status 0
% 0.07/0.41 % Result found by new_bool_3
% 0.07/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.41 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.07/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.41 % SubtermCWHack with pid 9686 completed with status 0
% 0.07/0.41 % Result found by SubtermCWHack
% 0.07/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.41 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.41 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.41 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.07/0.41 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.41 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.41 % Preprocessing time : 0.001 s
% 0.07/0.41
% 0.07/0.41 % Proof found!
% 0.07/0.41 % SZS status Theorem
% 0.07/0.41 % SZS output start CNFRefutation
% See solution above
% 0.07/0.41 % Parsed axioms : 9
% 0.07/0.41 % Removed by relevancy pruning/SinE : 6
% 0.07/0.41 % Initial clauses : 4
% 0.07/0.41 % Removed in clause preprocessing : 0
% 0.07/0.41 % Initial clauses in saturation : 4
% 0.07/0.41 % Processed clauses : 4
% 0.07/0.41 % ...of these trivial : 0
% 0.07/0.41 % ...subsumed : 0
% 0.07/0.41 % ...remaining for further processing : 4
% 0.07/0.41 % Other redundant clauses eliminated : 0
% 0.07/0.41 % Clauses deleted for lack of memory : 0
% 0.07/0.41 % Backward-subsumed : 0
% 0.07/0.41 % Backward-rewritten : 0
% 0.07/0.41 % Generated clauses : 1
% 0.07/0.41 % ...of the previous two non-redundant : 0
% 0.07/0.41 % ...aggressively subsumed : 0
% 0.07/0.41 % Contextual simplify-reflections : 0
% 0.07/0.41 % Paramodulations : 1
% 0.07/0.41 % Factorizations : 0
% 0.07/0.41 % NegExts : 0
% 0.07/0.41 % Equation resolutions : 0
% 0.07/0.41 % Disequality decompositions : 0
% 0.07/0.41 % Total rewrite steps : 0
% 0.07/0.41 % ...of those cached : 0
% 0.07/0.41 % Propositional unsat checks : 0
% 0.07/0.41 % Propositional check models : 0
% 0.07/0.41 % Propositional check unsatisfiable : 0
% 0.07/0.41 % Propositional clauses : 0
% 0.07/0.41 % Propositional clauses after purity: 0
% 0.07/0.41 % Propositional unsat core size : 0
% 0.07/0.41 % Propositional preprocessing time : 0.000
% 0.07/0.41 % Propositional encoding time : 0.000
% 0.07/0.41 % Propositional solver time : 0.000
% 0.07/0.41 % Success case prop preproc time : 0.000
% 0.07/0.41 % Success case prop encoding time : 0.000
% 0.07/0.41 % Success case prop solver time : 0.000
% 0.07/0.41 % Current number of processed clauses : 4
% 0.07/0.41 % Positive orientable unit clauses : 0
% 0.07/0.41 % Positive unorientable unit clauses: 0
% 0.07/0.41 % Negative unit clauses : 3
% 0.07/0.41 % Non-unit-clauses : 1
% 0.07/0.41 % Current number of unprocessed clauses: 0
% 0.07/0.41 % ...number of literals in the above : 0
% 0.07/0.41 % Current number of archived formulas : 0
% 0.07/0.41 % Current number of archived clauses : 0
% 0.07/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.07/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.07/0.41 % Non-unit clause-clause subsumptions : 0
% 0.07/0.41 % Unit Clause-clause subsumption calls : 0
% 0.07/0.41 % Rewrite failures with RHS unbound : 0
% 0.07/0.41 % BW rewrite match attempts : 0
% 0.07/0.41 % BW rewrite match successes : 0
% 0.07/0.41 % Condensation attempts : 0
% 0.07/0.41 % Condensation successes : 0
% 0.07/0.41 % Termbank termtop insertions : 189
% 0.07/0.41 % Search garbage collected termcells : 26
% 0.07/0.41
% 0.07/0.41 % -------------------------------------------------
% 0.07/0.41 % User time : 0.002 s
% 0.07/0.41 % System time : 0.002 s
% 0.07/0.41 % Total time : 0.004 s
% 0.07/0.41 % Maximum resident set size: 3632 pages
% 0.07/0.41
% 0.07/0.41 % -------------------------------------------------
% 0.07/0.41 % User time : 0.004 s
% 0.07/0.41 % System time : 0.005 s
% 0.07/0.41 % Total time : 0.009 s
% 0.07/0.41 % Maximum resident set size: 4864 pages
% 0.07/0.41 % E exiting
%------------------------------------------------------------------------------