%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP239_1 : 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 : n019.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 12:54:51 PM UTC 2026
% Result : Theorem 11.02s 3.64s
% Output : CNFRefutation 11.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 11 ( 10 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_bool: $tType ).
tff(decl_sort2,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort3,type,
fun_nat_nat: $tType ).
tff(decl_sort4,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort5,type,
nat: $tType ).
tff(decl_sort6,type,
num: $tType ).
tff(decl_sort7,type,
bool: $tType ).
tff(decl_sort8,type,
vEBT_VEBT: $tType ).
tff(decl_sort9,type,
fun_num_nat: $tType ).
tff(decl_sort10,type,
fun_num_num: $tType ).
tff(decl_816,type,
one_one_nat: nat ).
tff(decl_981,type,
nth_VEBT_VEBT: ( nat * list_VEBT_VEBT ) > vEBT_VEBT ).
tff(decl_1007,type,
suc: fun_nat_nat ).
tff(decl_1078,type,
bit0: fun_num_num ).
tff(decl_1080,type,
one: num ).
tff(decl_1088,type,
numeral_numeral_nat: fun_num_nat ).
tff(decl_1299,type,
divide_divide_nat: fun_nat_fun_nat_nat ).
tff(decl_1444,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1446,type,
vEBT_VEBT_low: fun_nat_fun_nat_nat ).
tff(decl_1463,type,
vEBT_vebt_member: vEBT_VEBT > fun_nat_bool ).
tff(decl_1572,type,
aa_nat_bool: ( nat * fun_nat_bool ) > bool ).
tff(decl_1574,type,
aa_nat_nat: ( nat * fun_nat_nat ) > nat ).
tff(decl_1599,type,
aa_nat_fun_nat_nat: ( nat * fun_nat_fun_nat_nat ) > fun_nat_nat ).
tff(decl_1628,type,
aa_num_nat: ( num * fun_num_nat ) > nat ).
tff(decl_1629,type,
aa_num_num: ( num * fun_num_num ) > num ).
tff(decl_1892,type,
pp: bool > $o ).
tff(decl_1893,type,
deg: nat ).
tff(decl_1899,type,
pr: nat ).
tff(decl_1902,type,
treeList: list_VEBT_VEBT ).
tff(decl_1904,type,
za: nat ).
tff(conj_0,conjecture,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(fact_0_True,axiom,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) = pr,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_True) ).
tff(fact_1019_Suc__1,axiom,
aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1019_Suc__1) ).
tff(fact_2_abe,axiom,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_abe) ).
tff(c_0_4,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_5,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
tff(c_0_6,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tcf(c_0_7,plain,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) = pr,
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
tcf(c_0_8,plain,
aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
inference(split_conjunct,[status(thm)],[fact_1019_Suc__1]) ).
tcf(c_0_9,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat))) = pr,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_11,plain,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(split_conjunct,[status(thm)],[fact_2_abe]) ).
tcf(c_0_12,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,pr)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_8]),c_0_10]),c_0_8]) ).
cnf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_8]),c_0_10]),c_0_8]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP239_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n019.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 22:15:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 11.02/3.64 % Version: 3.5.1
% 11.02/3.64 % Preprocessing class: FMLLSMLLSSSNFFN.
% 11.02/3.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.02/3.64 % Starting new_bool_3 with 900s (3) cores
% 11.02/3.64 % Starting new_bool_1 with 900s (3) cores
% 11.02/3.64 % Starting sh5l with 300s (1) cores
% 11.02/3.64 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 11.02/3.64 % new_bool_3 with pid 1026002 completed with status 0
% 11.02/3.64 % Result found by new_bool_3
% 11.02/3.64 % Preprocessing class: FMLLSMLLSSSNFFN.
% 11.02/3.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.02/3.64 % Starting new_bool_3 with 900s (3) cores
% 11.02/3.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 11.02/3.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.02/3.64 % Search class: FGHSM-SMLM32-DFFFFFNN
% 11.02/3.64 % Scheduled 13 strats onto 3 cores with 899 seconds (899 total)
% 11.02/3.64 % Starting SubtermCWHack with 81s (1) cores
% 11.02/3.64 % Starting new_bool_3 with 90s (1) cores
% 11.02/3.64 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 11.02/3.64 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 1026011 completed with status 0
% 11.02/3.64 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.02/3.64 % Preprocessing class: FMLLSMLLSSSNFFN.
% 11.02/3.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.02/3.64 % Starting new_bool_3 with 900s (3) cores
% 11.02/3.64 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 11.02/3.64 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 11.02/3.64 % Search class: FGHSM-SMLM32-DFFFFFNN
% 11.02/3.64 % Scheduled 13 strats onto 3 cores with 899 seconds (899 total)
% 11.02/3.64 % Starting SubtermCWHack with 81s (1) cores
% 11.02/3.64 % Starting new_bool_3 with 90s (1) cores
% 11.02/3.64 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 11.02/3.64 % Preprocessing time : 0.327 s
% 11.02/3.64
% 11.02/3.64 % Proof found!
% 11.02/3.64 % SZS status Theorem
% 11.02/3.64 % SZS output start CNFRefutation
% See solution above
% 11.02/3.64 % Parsed axioms : 13208
% 11.02/3.64 % Removed by relevancy pruning/SinE : 9228
% 11.02/3.64 % Initial clauses : 11615
% 11.02/3.64 % Removed in clause preprocessing : 1974
% 11.02/3.64 % Initial clauses in saturation : 9641
% 11.02/3.64 % Processed clauses : 127
% 11.02/3.64 % ...of these trivial : 10
% 11.02/3.64 % ...subsumed : 26
% 11.02/3.64 % ...remaining for further processing : 90
% 11.02/3.64 % Other redundant clauses eliminated : 14
% 11.02/3.64 % Clauses deleted for lack of memory : 0
% 11.02/3.64 % Backward-subsumed : 3
% 11.02/3.64 % Backward-rewritten : 2
% 11.02/3.64 % Generated clauses : 33
% 11.02/3.64 % ...of the previous two non-redundant : 28
% 11.02/3.64 % ...aggressively subsumed : 0
% 11.02/3.64 % Contextual simplify-reflections : 0
% 11.02/3.64 % Paramodulations : 17
% 11.02/3.64 % Factorizations : 0
% 11.02/3.64 % NegExts : 0
% 11.02/3.64 % Equation resolutions : 16
% 11.02/3.64 % Disequality decompositions : 0
% 11.02/3.64 % Total rewrite steps : 40
% 11.02/3.64 % ...of those cached : 26
% 11.02/3.64 % Propositional unsat checks : 0
% 11.02/3.64 % Propositional check models : 0
% 11.02/3.64 % Propositional check unsatisfiable : 0
% 11.02/3.64 % Propositional clauses : 0
% 11.02/3.64 % Propositional clauses after purity: 0
% 11.02/3.64 % Propositional unsat core size : 0
% 11.02/3.64 % Propositional preprocessing time : 0.000
% 11.02/3.64 % Propositional encoding time : 0.000
% 11.02/3.64 % Propositional solver time : 0.000
% 11.02/3.64 % Success case prop preproc time : 0.000
% 11.02/3.64 % Success case prop encoding time : 0.000
% 11.02/3.64 % Success case prop solver time : 0.000
% 11.02/3.64 % Current number of processed clauses : 71
% 11.02/3.64 % Positive orientable unit clauses : 24
% 11.02/3.64 % Positive unorientable unit clauses: 0
% 11.02/3.64 % Negative unit clauses : 42
% 11.02/3.64 % Non-unit-clauses : 5
% 11.02/3.64 % Current number of unprocessed clauses: 9542
% 11.02/3.64 % ...number of literals in the above : 42983
% 11.02/3.64 % Current number of archived formulas : 0
% 11.02/3.64 % Current number of archived clauses : 5
% 11.02/3.64 % Clause-clause subsumption calls (NU) : 78
% 11.02/3.64 % Rec. Clause-clause subsumption calls : 18
% 11.02/3.64 % Non-unit clause-clause subsumptions : 3
% 11.02/3.64 % Unit Clause-clause subsumption calls : 205
% 11.02/3.64 % Rewrite failures with RHS unbound : 0
% 11.02/3.64 % BW rewrite match attempts : 2
% 11.02/3.64 % BW rewrite match successes : 2
% 11.02/3.64 % Condensation attempts : 0
% 11.02/3.64 % Condensation successes : 0
% 11.02/3.64 % Termbank termtop insertions : 1484229
% 11.02/3.64 % Search garbage collected termcells : 211356
% 11.02/3.64
% 11.02/3.64 % -------------------------------------------------
% 11.02/3.64 % User time : 2.053 s
% 11.02/3.64 % System time : 0.139 s
% 11.02/3.64 % Total time : 2.192 s
% 11.02/3.64 % Maximum resident set size: 58800 pages
% 11.02/3.64
% 11.02/3.64 % -------------------------------------------------
% 11.02/3.64 % User time : 3.490 s
% 11.02/3.64 % System time : 0.364 s
% 11.02/3.64 % Total time : 3.854 s
% 11.02/3.64 % Maximum resident set size: 33536 pages
% 11.02/3.64 % E exiting
%------------------------------------------------------------------------------