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