%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM681_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 : n005.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.17s 0.66s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 42 ~; 15 |; 2 &)
% ( 0 <=>; 16 =>; 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 : 40 ( 0 sgn 40 !; 0 ?; 40 :)
% 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,
pl: ( nat * nat ) > nat ).
tff(decl_27,type,
less: ( nat * nat ) > $o ).
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(satz20b,conjecture,
x = y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz20b) ).
tff(satz19c,axiom,
! [X2: nat,X3: nat,X4: nat] :
( less(X2,X3)
=> less(pl(X2,X4),pl(X3,X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19c) ).
tff(i,axiom,
pl(x,z) = pl(y,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
tff(satz10a,axiom,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).
tff(c_0_6,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_7,plain,
! [X11: nat,X12: nat] :
( ( ( X11 != X12 )
| ~ less(X11,X12) )
& ( ~ less(X11,X12)
| ~ more(X11,X12) )
& ( ~ more(X11,X12)
| ( X11 != X12 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_8,plain,
! [X8: nat,X9: nat,X10: nat] :
( more(pl(X8,X10),pl(X9,X10))
| ~ more(X8,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19a])])]) ).
tff(c_0_9,negated_conjecture,
x != y,
inference(assume_negation,[status(cth)],[satz20b]) ).
tff(c_0_10,plain,
! [X5: nat,X6: nat,X7: nat] :
( less(pl(X5,X7),pl(X6,X7))
| ~ less(X5,X6) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz19c])])]) ).
tcf(c_0_11,plain,
! [X2: nat,X3: nat] :
( ~ more(X2,X3)
| ( X2 != X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_12,plain,
! [X2: nat,X4: nat,X3: nat] :
( ~ more(X2,X3)
| more(pl(X2,X4),pl(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,plain,
pl(x,z) = pl(y,z),
inference(split_conjunct,[status(thm)],[i]) ).
tff(c_0_14,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
=> ( ~ more(X2,X3)
=> less(X2,X3) ) ),
inference(fof_simplification,[status(thm)],[satz10a]) ).
tff(c_0_15,negated_conjecture,
x != y,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
tcf(c_0_16,plain,
! [X2: nat,X3: nat] :
( ( X2 != X3 )
| ~ less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_17,plain,
! [X2: nat,X4: nat,X3: nat] :
( ~ less(X2,X3)
| less(pl(X2,X4),pl(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_18,plain,
! [X2: nat] : ~ more(X2,X2),
inference(er,[status(thm)],[c_0_11]) ).
tcf(c_0_19,plain,
! [X2: nat] :
( ~ more(X2,y)
| more(pl(X2,z),pl(x,z)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
tff(c_0_20,plain,
! [X13: nat,X14: nat] :
( less(X13,X14)
| more(X13,X14)
| ( X13 = X14 ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
tff(c_0_21,negated_conjecture,
x != y,
inference(fof_nnf,[status(thm)],[c_0_15]) ).
tcf(c_0_22,plain,
! [X2: nat] : ~ less(X2,X2),
inference(er,[status(thm)],[c_0_16]) ).
tcf(c_0_23,plain,
! [X2: nat] :
( ~ less(X2,y)
| less(pl(X2,z),pl(x,z)) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
tcf(c_0_24,plain,
~ more(x,y),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
tcf(c_0_25,plain,
! [X2: nat,X3: nat] :
( less(X2,X3)
| more(X2,X3)
| ( X2 = X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_26,negated_conjecture,
x != y,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_27,plain,
~ less(x,y),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM681_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.12/0.59 % Computer : n005.cluster.edu
% 0.12/0.59 % Model : x86_64 x86_64
% 0.12/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.59 % Memory : 8046.5625MB
% 0.12/0.59 % OS : Linux 6.8.0-71-generic
% 0.12/0.59 % CPULimit : 300
% 0.12/0.59 % WCLimit : 300
% 0.12/0.59 % DateTime : Mon Sep 21 02:53:19 UTC 2026
% 0.12/0.60 % CPUTime :
% 0.12/0.60 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.64 Running first-order theorem proving
% 0.17/0.64 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.17/0.66 % Version: 3.5.1
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.66 % Starting sh5l with 300s (1) cores
% 0.17/0.66 % sh5l with pid 2398531 completed with status 0
% 0.17/0.66 % Result found by sh5l
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.66 % Starting sh5l with 300s (1) cores
% 0.17/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.66 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.17/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.66 % SubtermCWHack with pid 2398539 completed with status 0
% 0.17/0.66 % Result found by SubtermCWHack
% 0.17/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.66 % Starting sh5l with 300s (1) cores
% 0.17/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.17/0.66 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.66 % Search class: FGHSF-FFSF22-SFFFFFNN
% 0.17/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.17/0.66 % Preprocessing time : 0.001 s
% 0.17/0.66
% 0.17/0.66 % Proof found!
% 0.17/0.66 % SZS status Theorem
% 0.17/0.66 % SZS output start CNFRefutation
% See solution above
% 0.17/0.66 % Parsed axioms : 14
% 0.17/0.66 % Removed by relevancy pruning/SinE : 8
% 0.17/0.66 % Initial clauses : 8
% 0.17/0.66 % Removed in clause preprocessing : 0
% 0.17/0.66 % Initial clauses in saturation : 8
% 0.17/0.66 % Processed clauses : 23
% 0.17/0.66 % ...of these trivial : 0
% 0.17/0.66 % ...subsumed : 4
% 0.17/0.66 % ...remaining for further processing : 19
% 0.17/0.66 % Other redundant clauses eliminated : 2
% 0.17/0.66 % Clauses deleted for lack of memory : 0
% 0.17/0.66 % Backward-subsumed : 0
% 0.17/0.66 % Backward-rewritten : 0
% 0.17/0.66 % Generated clauses : 25
% 0.17/0.66 % ...of the previous two non-redundant : 23
% 0.17/0.66 % ...aggressively subsumed : 0
% 0.17/0.66 % Contextual simplify-reflections : 0
% 0.17/0.66 % Paramodulations : 23
% 0.17/0.66 % Factorizations : 0
% 0.17/0.66 % NegExts : 0
% 0.17/0.66 % Equation resolutions : 2
% 0.17/0.66 % Disequality decompositions : 0
% 0.17/0.66 % Total rewrite steps : 0
% 0.17/0.66 % ...of those cached : 0
% 0.17/0.66 % Propositional unsat checks : 0
% 0.17/0.66 % Propositional check models : 0
% 0.17/0.66 % Propositional check unsatisfiable : 0
% 0.17/0.66 % Propositional clauses : 0
% 0.17/0.66 % Propositional clauses after purity: 0
% 0.17/0.66 % Propositional unsat core size : 0
% 0.17/0.66 % Propositional preprocessing time : 0.000
% 0.17/0.66 % Propositional encoding time : 0.000
% 0.17/0.66 % Propositional solver time : 0.000
% 0.17/0.66 % Success case prop preproc time : 0.000
% 0.17/0.66 % Success case prop encoding time : 0.000
% 0.17/0.66 % Success case prop solver time : 0.000
% 0.17/0.66 % Current number of processed clauses : 17
% 0.17/0.66 % Positive orientable unit clauses : 1
% 0.17/0.66 % Positive unorientable unit clauses: 0
% 0.17/0.66 % Negative unit clauses : 6
% 0.17/0.66 % Non-unit-clauses : 10
% 0.17/0.66 % Current number of unprocessed clauses: 8
% 0.17/0.66 % ...number of literals in the above : 17
% 0.17/0.66 % Current number of archived formulas : 0
% 0.17/0.66 % Current number of archived clauses : 0
% 0.17/0.66 % Clause-clause subsumption calls (NU) : 13
% 0.17/0.66 % Rec. Clause-clause subsumption calls : 10
% 0.17/0.66 % Non-unit clause-clause subsumptions : 0
% 0.17/0.66 % Unit Clause-clause subsumption calls : 3
% 0.17/0.66 % Rewrite failures with RHS unbound : 0
% 0.17/0.66 % BW rewrite match attempts : 0
% 0.17/0.66 % BW rewrite match successes : 0
% 0.17/0.66 % Condensation attempts : 0
% 0.17/0.66 % Condensation successes : 0
% 0.17/0.66 % Termbank termtop insertions : 841
% 0.17/0.66 % Search garbage collected termcells : 101
% 0.17/0.66
% 0.17/0.66 % -------------------------------------------------
% 0.17/0.66 % User time : 0.006 s
% 0.17/0.66 % System time : 0.001 s
% 0.17/0.66 % Total time : 0.007 s
% 0.17/0.66 % Maximum resident set size: 3636 pages
% 0.17/0.66
% 0.17/0.66 % -------------------------------------------------
% 0.17/0.66 % User time : 0.009 s
% 0.17/0.66 % System time : 0.004 s
% 0.17/0.66 % Total time : 0.013 s
% 0.17/0.66 % Maximum resident set size: 4864 pages
% 0.17/0.66 % E exiting
%------------------------------------------------------------------------------