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