%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM663_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:02 PM UTC 2026
% Result : Theorem 0.12s 0.46s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 12 ~; 7 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
nat: $tType ).
tff(decl_23,type,
x: nat ).
tff(decl_24,type,
y: nat ).
tff(decl_25,type,
z: nat ).
tff(decl_26,type,
less: ( nat * nat ) > $o ).
tff(satz16a,conjecture,
less(x,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz16a) ).
tff(satz15,axiom,
! [X2: nat,X3: nat,X4: nat] :
( less(X2,X3)
=> ( less(X3,X4)
=> less(X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz15) ).
tff(l,axiom,
( ~ less(x,y)
=> ( x = y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(k,axiom,
less(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
tff(c_0_4,negated_conjecture,
~ less(x,z),
inference(assume_negation,[status(cth)],[satz16a]) ).
tff(c_0_5,negated_conjecture,
~ less(x,z),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
tff(c_0_6,plain,
! [X5: nat,X6: nat,X7: nat] :
( less(X5,X7)
| ~ less(X6,X7)
| ~ less(X5,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz15])])]) ).
tff(c_0_7,plain,
( ~ less(x,y)
=> ( x = y ) ),
inference(fof_simplification,[status(thm)],[l]) ).
tff(c_0_8,negated_conjecture,
~ less(x,z),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
! [X2: nat,X3: nat,X4: nat] :
( ~ less(X3,X4)
| ~ less(X2,X3)
| less(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
less(y,z),
inference(split_conjunct,[status(thm)],[k]) ).
tff(c_0_11,plain,
( ( x = y )
| less(x,y) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
tcf(c_0_12,negated_conjecture,
~ less(x,z),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X2: nat] :
( ~ less(X2,y)
| less(X2,z) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_14,plain,
( ( x = y )
| less(x,y) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,negated_conjecture,
~ less(x,y),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_16,plain,
x = y,
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_16]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM663_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.12/0.39 % Computer : n004.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 21 02:50:19 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.44 Running first-order theorem proving
% 0.12/0.44 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.12/0.46 % Version: 3.5.1
% 0.12/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.46 % Starting sh5l with 300s (1) cores
% 0.12/0.46 % new_bool_3 with pid 2095454 completed with status 0
% 0.12/0.46 % Result found by new_bool_3
% 0.12/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.12/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.46 % SubtermCWHack with pid 2095461 completed with status 0
% 0.12/0.46 % Result found by SubtermCWHack
% 0.12/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.46 % Search class: FGUSF-FFSF00-SFFFFFNN
% 0.12/0.46 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.46 % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.46 % Preprocessing time : 0.001 s
% 0.12/0.46
% 0.12/0.46 % Proof found!
% 0.12/0.46 % SZS status Theorem
% 0.12/0.46 % SZS output start CNFRefutation
% See solution above
% 0.12/0.46 % Parsed axioms : 10
% 0.12/0.46 % Removed by relevancy pruning/SinE : 6
% 0.12/0.46 % Initial clauses : 4
% 0.12/0.46 % Removed in clause preprocessing : 0
% 0.12/0.46 % Initial clauses in saturation : 4
% 0.12/0.46 % Processed clauses : 7
% 0.12/0.46 % ...of these trivial : 0
% 0.12/0.46 % ...subsumed : 0
% 0.12/0.46 % ...remaining for further processing : 7
% 0.12/0.46 % Other redundant clauses eliminated : 0
% 0.12/0.46 % Clauses deleted for lack of memory : 0
% 0.12/0.46 % Backward-subsumed : 0
% 0.12/0.46 % Backward-rewritten : 2
% 0.12/0.46 % Generated clauses : 5
% 0.12/0.46 % ...of the previous two non-redundant : 6
% 0.12/0.46 % ...aggressively subsumed : 0
% 0.12/0.46 % Contextual simplify-reflections : 0
% 0.12/0.46 % Paramodulations : 4
% 0.12/0.46 % Factorizations : 0
% 0.12/0.46 % NegExts : 0
% 0.12/0.46 % Equation resolutions : 0
% 0.12/0.46 % Disequality decompositions : 0
% 0.12/0.46 % Total rewrite steps : 3
% 0.12/0.46 % ...of those cached : 1
% 0.12/0.46 % Propositional unsat checks : 0
% 0.12/0.46 % Propositional check models : 0
% 0.12/0.46 % Propositional check unsatisfiable : 0
% 0.12/0.46 % Propositional clauses : 0
% 0.12/0.46 % Propositional clauses after purity: 0
% 0.12/0.46 % Propositional unsat core size : 0
% 0.12/0.46 % Propositional preprocessing time : 0.000
% 0.12/0.46 % Propositional encoding time : 0.000
% 0.12/0.46 % Propositional solver time : 0.000
% 0.12/0.46 % Success case prop preproc time : 0.000
% 0.12/0.46 % Success case prop encoding time : 0.000
% 0.12/0.46 % Success case prop solver time : 0.000
% 0.12/0.46 % Current number of processed clauses : 4
% 0.12/0.46 % Positive orientable unit clauses : 2
% 0.12/0.46 % Positive unorientable unit clauses: 0
% 0.12/0.46 % Negative unit clauses : 0
% 0.12/0.46 % Non-unit-clauses : 2
% 0.12/0.46 % Current number of unprocessed clauses: 2
% 0.12/0.46 % ...number of literals in the above : 6
% 0.12/0.46 % Current number of archived formulas : 0
% 0.12/0.46 % Current number of archived clauses : 3
% 0.12/0.46 % Clause-clause subsumption calls (NU) : 0
% 0.12/0.46 % Rec. Clause-clause subsumption calls : 0
% 0.12/0.46 % Non-unit clause-clause subsumptions : 0
% 0.12/0.46 % Unit Clause-clause subsumption calls : 1
% 0.12/0.46 % Rewrite failures with RHS unbound : 0
% 0.12/0.46 % BW rewrite match attempts : 1
% 0.12/0.46 % BW rewrite match successes : 1
% 0.12/0.46 % Condensation attempts : 0
% 0.12/0.46 % Condensation successes : 0
% 0.12/0.46 % Termbank termtop insertions : 255
% 0.12/0.46 % Search garbage collected termcells : 28
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.002 s
% 0.12/0.46 % System time : 0.003 s
% 0.12/0.46 % Total time : 0.005 s
% 0.12/0.46 % Maximum resident set size: 3632 pages
% 0.12/0.46
% 0.12/0.46 % -------------------------------------------------
% 0.12/0.46 % User time : 0.005 s
% 0.12/0.46 % System time : 0.006 s
% 0.12/0.46 % Total time : 0.011 s
% 0.12/0.46 % Maximum resident set size: 4608 pages
% 0.12/0.46 % E exiting
%------------------------------------------------------------------------------