%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP234_1 : 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 : 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 12:54:48 PM UTC 2026
% Result : Theorem 4.58s 2.40s
% Output : CNFRefutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 10 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 : 7 ( 2 avg)
% Number of types : 5 ( 5 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_sort3,type,
fun_nat_nat: $tType ).
tff(decl_sort4,type,
vEBT_VEBT: $tType ).
tff(decl_sort5,type,
list_VEBT_VEBT: $tType ).
tff(decl_1113,type,
list_u1324408373059187874T_VEBT: ( vEBT_VEBT * ( nat * list_VEBT_VEBT ) ) > list_VEBT_VEBT ).
tff(decl_1136,type,
nth_VEBT_VEBT: ( nat * list_VEBT_VEBT ) > vEBT_VEBT ).
tff(decl_1501,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1503,type,
vEBT_VEBT_low: fun_nat_fun_nat_nat ).
tff(decl_1514,type,
vEBT_vebt_insert: ( nat * vEBT_VEBT ) > vEBT_VEBT ).
tff(decl_1604,type,
aa_nat_nat: ( nat * fun_nat_nat ) > nat ).
tff(decl_1635,type,
aa_nat_fun_nat_nat: ( nat * fun_nat_fun_nat_nat ) > fun_nat_nat ).
tff(decl_1943,type,
i: nat ).
tff(decl_1946,type,
mi: nat ).
tff(decl_1947,type,
na: nat ).
tff(decl_1949,type,
treeList: list_VEBT_VEBT ).
tff(conj_0,conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) = vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_0_True,axiom,
i = aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_True) ).
tff(fact_1_insprop,axiom,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)) = vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_insprop) ).
tff(c_0_3,negated_conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) != vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_4,negated_conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) != vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
tff(c_0_5,negated_conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) != vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_6,negated_conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) != vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_7,plain,
i = aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
tcf(c_0_8,plain,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na),vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)) = vEBT_vebt_insert(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(split_conjunct,[status(thm)],[fact_1_insprop]) ).
tcf(c_0_9,negated_conjecture,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,i,vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na))),i) != vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,mi),na)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP234_1 : 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.39 % Computer : n015.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 20 22:17:06 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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
% 4.58/2.40 % Version: 3.5.1
% 4.58/2.40 % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.58/2.40 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.58/2.40 % Starting new_bool_3 with 897s (3) cores
% 4.58/2.40 % Starting new_bool_1 with 897s (3) cores
% 4.58/2.40 % Starting sh5l with 299s (1) cores
% 4.58/2.40 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 4.58/2.40 % new_bool_1 with pid 4046362 completed with status 0
% 4.58/2.40 % Result found by new_bool_1
% 4.58/2.40 % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.58/2.40 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.58/2.40 % Starting new_bool_3 with 897s (3) cores
% 4.58/2.40 % Starting new_bool_1 with 897s (3) cores
% 4.58/2.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.58/2.40 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.58/2.40 % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.58/2.40 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 4.58/2.40 % Starting SubtermCWHack with 81s (1) cores
% 4.58/2.40 % Starting new_bool_1 with 90s (1) cores
% 4.58/2.40 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 4.58/2.40 % G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 4046367 completed with status 0
% 4.58/2.40 % Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 4.58/2.40 % Preprocessing class: FMLLSMLLSSSNFFN.
% 4.58/2.40 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 4.58/2.40 % Starting new_bool_3 with 897s (3) cores
% 4.58/2.40 % Starting new_bool_1 with 897s (3) cores
% 4.58/2.40 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.58/2.40 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.58/2.40 % Search class: FGHSM-SMLM32-DFFFFFNN
% 4.58/2.40 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 4.58/2.40 % Starting SubtermCWHack with 81s (1) cores
% 4.58/2.40 % Starting new_bool_1 with 90s (1) cores
% 4.58/2.40 % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 4.58/2.40 % Preprocessing time : 0.152 s
% 4.58/2.40
% 4.58/2.40 % Proof found!
% 4.58/2.40 % SZS status Theorem
% 4.58/2.40 % SZS output start CNFRefutation
% See solution above
% 4.58/2.40 % Parsed axioms : 11301
% 4.58/2.40 % Removed by relevancy pruning/SinE : 9112
% 4.58/2.40 % Initial clauses : 7115
% 4.58/2.40 % Removed in clause preprocessing : 1823
% 4.58/2.40 % Initial clauses in saturation : 5292
% 4.58/2.40 % Processed clauses : 39
% 4.58/2.40 % ...of these trivial : 0
% 4.58/2.40 % ...subsumed : 5
% 4.58/2.40 % ...remaining for further processing : 33
% 4.58/2.40 % Other redundant clauses eliminated : 1
% 4.58/2.40 % Clauses deleted for lack of memory : 0
% 4.58/2.40 % Backward-subsumed : 0
% 4.58/2.40 % Backward-rewritten : 0
% 4.58/2.40 % Generated clauses : 27
% 4.58/2.40 % ...of the previous two non-redundant : 23
% 4.58/2.40 % ...aggressively subsumed : 0
% 4.58/2.40 % Contextual simplify-reflections : 0
% 4.58/2.40 % Paramodulations : 24
% 4.58/2.40 % Factorizations : 2
% 4.58/2.40 % NegExts : 0
% 4.58/2.40 % Equation resolutions : 1
% 4.58/2.40 % Disequality decompositions : 0
% 4.58/2.40 % Total rewrite steps : 13
% 4.58/2.40 % ...of those cached : 8
% 4.58/2.40 % Propositional unsat checks : 0
% 4.58/2.40 % Propositional check models : 0
% 4.58/2.40 % Propositional check unsatisfiable : 0
% 4.58/2.40 % Propositional clauses : 0
% 4.58/2.40 % Propositional clauses after purity: 0
% 4.58/2.40 % Propositional unsat core size : 0
% 4.58/2.40 % Propositional preprocessing time : 0.000
% 4.58/2.40 % Propositional encoding time : 0.000
% 4.58/2.40 % Propositional solver time : 0.000
% 4.58/2.40 % Success case prop preproc time : 0.000
% 4.58/2.40 % Success case prop encoding time : 0.000
% 4.58/2.40 % Success case prop solver time : 0.000
% 4.58/2.40 % Current number of processed clauses : 32
% 4.58/2.40 % Positive orientable unit clauses : 12
% 4.58/2.40 % Positive unorientable unit clauses: 0
% 4.58/2.40 % Negative unit clauses : 16
% 4.58/2.40 % Non-unit-clauses : 4
% 4.58/2.40 % Current number of unprocessed clauses: 5276
% 4.58/2.40 % ...number of literals in the above : 23784
% 4.58/2.40 % Current number of archived formulas : 0
% 4.58/2.40 % Current number of archived clauses : 0
% 4.58/2.40 % Clause-clause subsumption calls (NU) : 2
% 4.58/2.40 % Rec. Clause-clause subsumption calls : 2
% 4.58/2.40 % Non-unit clause-clause subsumptions : 0
% 4.58/2.40 % Unit Clause-clause subsumption calls : 27
% 4.58/2.40 % Rewrite failures with RHS unbound : 0
% 4.58/2.40 % BW rewrite match attempts : 0
% 4.58/2.40 % BW rewrite match successes : 0
% 4.58/2.40 % Condensation attempts : 0
% 4.58/2.40 % Condensation successes : 0
% 4.58/2.40 % Termbank termtop insertions : 824241
% 4.58/2.40 % Search garbage collected termcells : 164751
% 4.58/2.40
% 4.58/2.40 % -------------------------------------------------
% 4.58/2.40 % User time : 0.594 s
% 4.58/2.40 % System time : 0.085 s
% 4.58/2.40 % Total time : 0.679 s
% 4.58/2.40 % Maximum resident set size: 43244 pages
% 4.58/2.40
% 4.58/2.40 % -------------------------------------------------
% 4.58/2.40 % User time : 2.063 s
% 4.58/2.40 % System time : 0.218 s
% 4.58/2.40 % Total time : 2.281 s
% 4.58/2.40 % Maximum resident set size: 27648 pages
% 4.58/2.40 % E exiting
%------------------------------------------------------------------------------