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