%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM682_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:56:03 PM UTC 2026
% Result : Theorem 0.63s 0.94s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 53 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 38 ~; 12 |; 2 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?; 31 :)
% 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(decl_27,type,
pl: ( nat * nat ) > nat ).
tff(decl_28,type,
more: ( nat * nat ) > $o ).
tff(satz10b,axiom,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ more(X2,X3) )
=> ~ ~ ( ( more(X2,X3)
=> ~ less(X2,X3) )
=> ~ ( less(X2,X3)
=> ( X2 != X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10b) ).
tff(satz19a,axiom,
! [X2: nat,X3: nat,X4: nat] :
( more(X2,X3)
=> more(pl(X2,X4),pl(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19a) ).
tff(satz20c,conjecture,
less(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20c) ).
tff(satz10a,axiom,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).
tff(l,axiom,
less(pl(x,z),pl(y,z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(c_0_5,plain,
! [X2: nat,X3: nat] :
~ ( ( ( X2 = X3 )
=> ~ more(X2,X3) )
=> ~ ~ ( ( more(X2,X3)
=> ~ less(X2,X3) )
=> ~ ( less(X2,X3)
=> ( X2 != X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz10b]) ).
tff(c_0_6,plain,
! [X5: nat,X6: nat] :
( ( ( X5 != X6 )
| ~ less(X5,X6) )
& ( ~ less(X5,X6)
| ~ more(X5,X6) )
& ( ~ more(X5,X6)
| ( X5 != X6 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tff(c_0_7,plain,
! [X9: nat,X10: nat,X11: nat] :
( more(pl(X9,X11),pl(X10,X11))
| ~ more(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])])]) ).
tff(c_0_8,negated_conjecture,
~ less(x,y),
inference(assume_negation,[status(cth)],[satz20c]) ).
tcf(c_0_9,plain,
! [X2: nat,X3: nat] :
( ~ less(X2,X3)
| ~ more(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
! [X2: nat,X4: nat,X3: nat] :
( ~ more(X2,X3)
| more(pl(X2,X4),pl(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_11,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz10a]) ).
tff(c_0_12,negated_conjecture,
~ less(x,y),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
! [X2: nat,X3: nat,X4: nat] :
( ~ less(pl(X2,X4),pl(X3,X4))
| ~ more(X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_14,plain,
less(pl(x,z),pl(y,z)),
inference(split_conjunct,[status(thm)],[l]) ).
tff(c_0_15,plain,
! [X7: nat,X8: nat] :
( less(X7,X8)
| more(X7,X8)
| ( X7 = X8 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
tff(c_0_16,negated_conjecture,
~ less(x,y),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
tcf(c_0_17,plain,
~ more(x,y),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_18,plain,
! [X2: nat,X3: nat] :
( less(X2,X3)
| more(X2,X3)
| ( X2 = X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_19,negated_conjecture,
~ less(x,y),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
tcf(c_0_20,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_21,plain,
x = y,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
tcf(c_0_22,plain,
! [X2: nat] : ~ less(X2,X2),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM682_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:51:20 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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.63/0.94 % Version: 3.5.1
% 0.63/0.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.63/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.63/0.94 % Starting new_bool_3 with 300s (1) cores
% 0.63/0.94 % Starting new_bool_1 with 300s (1) cores
% 0.63/0.94 % Starting sh5l with 300s (1) cores
% 0.63/0.94 % sh5l with pid 14323 completed with status 0
% 0.63/0.94 % Result found by sh5l
% 0.63/0.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.63/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.63/0.94 % Starting new_bool_3 with 300s (1) cores
% 0.63/0.94 % Starting new_bool_1 with 300s (1) cores
% 0.63/0.94 % Starting sh5l with 300s (1) cores
% 0.63/0.94 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.63/0.94 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.63/0.94 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.63/0.94 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.63/0.94 % Starting SubtermCWHack with 31s (1) cores
% 0.63/0.94 % SubtermCWHack with pid 14329 completed with status 0
% 0.63/0.94 % Result found by SubtermCWHack
% 0.63/0.94 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.63/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.63/0.94 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.63/0.94 % Starting new_bool_3 with 300s (1) cores
% 0.63/0.94 % Starting new_bool_1 with 300s (1) cores
% 0.63/0.94 % Starting sh5l with 300s (1) cores
% 0.63/0.94 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.63/0.94 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.63/0.94 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.63/0.94 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.63/0.94 % Starting SubtermCWHack with 31s (1) cores
% 0.63/0.94 % Preprocessing time : 0.001 s
% 0.63/0.94
% 0.63/0.94 % Proof found!
% 0.63/0.94 % SZS status Theorem
% 0.63/0.94 % SZS output start CNFRefutation
% See solution above
% 0.63/0.94 % Parsed axioms : 14
% 0.63/0.94 % Removed by relevancy pruning/SinE : 8
% 0.63/0.94 % Initial clauses : 8
% 0.63/0.94 % Removed in clause preprocessing : 1
% 0.63/0.94 % Initial clauses in saturation : 7
% 0.63/0.94 % Processed clauses : 13
% 0.63/0.94 % ...of these trivial : 0
% 0.63/0.94 % ...subsumed : 1
% 0.63/0.94 % ...remaining for further processing : 12
% 0.63/0.94 % Other redundant clauses eliminated : 2
% 0.63/0.94 % Clauses deleted for lack of memory : 0
% 0.63/0.94 % Backward-subsumed : 0
% 0.63/0.94 % Backward-rewritten : 2
% 0.63/0.94 % Generated clauses : 8
% 0.63/0.94 % ...of the previous two non-redundant : 8
% 0.63/0.94 % ...aggressively subsumed : 0
% 0.63/0.94 % Contextual simplify-reflections : 0
% 0.63/0.94 % Paramodulations : 6
% 0.63/0.94 % Factorizations : 0
% 0.63/0.94 % NegExts : 0
% 0.63/0.94 % Equation resolutions : 2
% 0.63/0.94 % Disequality decompositions : 0
% 0.63/0.94 % Total rewrite steps : 2
% 0.63/0.94 % ...of those cached : 1
% 0.63/0.94 % Propositional unsat checks : 0
% 0.63/0.94 % Propositional check models : 0
% 0.63/0.94 % Propositional check unsatisfiable : 0
% 0.63/0.94 % Propositional clauses : 0
% 0.63/0.94 % Propositional clauses after purity: 0
% 0.63/0.94 % Propositional unsat core size : 0
% 0.63/0.94 % Propositional preprocessing time : 0.000
% 0.63/0.94 % Propositional encoding time : 0.000
% 0.63/0.94 % Propositional solver time : 0.000
% 0.63/0.94 % Success case prop preproc time : 0.000
% 0.63/0.94 % Success case prop encoding time : 0.000
% 0.63/0.94 % Success case prop solver time : 0.000
% 0.63/0.94 % Current number of processed clauses : 8
% 0.63/0.94 % Positive orientable unit clauses : 2
% 0.63/0.94 % Positive unorientable unit clauses: 0
% 0.63/0.94 % Negative unit clauses : 2
% 0.63/0.94 % Non-unit-clauses : 4
% 0.63/0.94 % Current number of unprocessed clauses: 0
% 0.63/0.94 % ...number of literals in the above : 0
% 0.63/0.94 % Current number of archived formulas : 0
% 0.63/0.94 % Current number of archived clauses : 2
% 0.63/0.94 % Clause-clause subsumption calls (NU) : 2
% 0.63/0.94 % Rec. Clause-clause subsumption calls : 1
% 0.63/0.94 % Non-unit clause-clause subsumptions : 0
% 0.63/0.94 % Unit Clause-clause subsumption calls : 1
% 0.63/0.94 % Rewrite failures with RHS unbound : 0
% 0.63/0.94 % BW rewrite match attempts : 1
% 0.63/0.94 % BW rewrite match successes : 1
% 0.63/0.94 % Condensation attempts : 0
% 0.63/0.94 % Condensation successes : 0
% 0.63/0.94 % Termbank termtop insertions : 625
% 0.63/0.94 % Search garbage collected termcells : 102
% 0.63/0.94
% 0.63/0.94 % -------------------------------------------------
% 0.63/0.94 % User time : 0.003 s
% 0.63/0.94 % System time : 0.003 s
% 0.63/0.94 % Total time : 0.006 s
% 0.63/0.94 % Maximum resident set size: 3636 pages
% 0.63/0.94
% 0.63/0.94 % -------------------------------------------------
% 0.63/0.94 % User time : 0.005 s
% 0.63/0.94 % System time : 0.008 s
% 0.63/0.94 % Total time : 0.013 s
% 0.63/0.94 % Maximum resident set size: 4864 pages
% 0.63/0.94 % E exiting
%------------------------------------------------------------------------------