↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP278_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 : 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:55:13 PM UTC 2026

% Result   : Theorem 65.40s 12.00s
% Output   : CNFRefutation 65.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (  14 unt;   0 typ;   0 def)
%            Number of atoms       :   26 (  19 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   15 (   5   ~;   1   |;   8   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :   17 (  16 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   31 (  31 usr;  17 con; 0-4 aty)
%            Number of variables   :    2 (   0 sgn   2   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    fun_nat_bool: $tType ).

tff(decl_sort2,type,
    vEBT_VEBT: $tType ).

tff(decl_sort3,type,
    bool: $tType ).

tff(decl_sort4,type,
    nat: $tType ).

tff(decl_sort5,type,
    product_prod_nat_nat: $tType ).

tff(decl_sort6,type,
    num: $tType ).

tff(decl_sort7,type,
    fun_nat_nat: $tType ).

tff(decl_sort8,type,
    set_VEBT_VEBT: $tType ).

tff(decl_sort9,type,
    fun_nat_fun_nat_nat: $tType ).

tff(decl_sort10,type,
    fun_na1476630412504255114at_nat: $tType ).

tff(decl_sort11,type,
    fun_num_nat: $tType ).

tff(decl_sort12,type,
    option4927543243414619207at_nat: $tType ).

tff(decl_sort13,type,
    fun_num_num: $tType ).

tff(decl_sort14,type,
    fun_VE7346385682144900493T_bool: $tType ).

tff(decl_sort15,type,
    list_VEBT_VEBT: $tType ).

tff(decl_sort16,type,
    fun_se448528567104302406T_bool: $tType ).

tff(decl_967,type,
    plus_plus_nat: fun_nat_fun_nat_nat ).

tff(decl_1189,type,
    set_VEBT_VEBT2: list_VEBT_VEBT > set_VEBT_VEBT ).

tff(decl_1280,type,
    size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).

tff(decl_1318,type,
    bit0: fun_num_num ).

tff(decl_1320,type,
    one: num ).

tff(decl_1328,type,
    numeral_numeral_nat: fun_num_nat ).

tff(decl_1339,type,
    some_P7363390416028606310at_nat: product_prod_nat_nat > option4927543243414619207at_nat ).

tff(decl_1467,type,
    power_power_nat: fun_nat_fun_nat_nat ).

tff(decl_1477,type,
    product_Pair_nat_nat: nat > fun_na1476630412504255114at_nat ).

tff(decl_1734,type,
    vEBT_Node: ( vEBT_VEBT * ( list_VEBT_VEBT * ( nat * option4927543243414619207at_nat ) ) ) > vEBT_VEBT ).

tff(decl_1748,type,
    vEBT_invar_vebt: vEBT_VEBT > fun_nat_bool ).

tff(decl_1882,type,
    aa_nat_bool: ( nat * fun_nat_bool ) > bool ).

tff(decl_1885,type,
    aa_nat_nat: ( nat * fun_nat_nat ) > nat ).

tff(decl_1888,type,
    aa_nat7603221163087113075at_nat: ( nat * fun_na1476630412504255114at_nat ) > product_prod_nat_nat ).

tff(decl_1911,type,
    aa_nat_fun_nat_nat: ( nat * fun_nat_fun_nat_nat ) > fun_nat_nat ).

tff(decl_1944,type,
    aa_num_nat: ( num * fun_num_nat ) > nat ).

tff(decl_1945,type,
    aa_num_num: ( num * fun_num_num ) > num ).

tff(decl_2059,type,
    aa_set8260762808118238015T_bool: ( set_VEBT_VEBT * fun_se448528567104302406T_bool ) > bool ).

tff(decl_2068,type,
    aa_VEB289770264548726718T_bool: ( vEBT_VEBT * fun_VE7346385682144900493T_bool ) > fun_se448528567104302406T_bool ).

tff(decl_2236,type,
    member_VEBT_VEBT: fun_VE7346385682144900493T_bool ).

tff(decl_2237,type,
    pp: bool > $o ).

tff(decl_2238,type,
    deg: nat ).

tff(decl_2239,type,
    info: option4927543243414619207at_nat ).

tff(decl_2240,type,
    m: nat ).

tff(decl_2241,type,
    ma: nat ).

tff(decl_2242,type,
    mi: nat ).

tff(decl_2243,type,
    na: nat ).

tff(decl_2244,type,
    sa: vEBT_VEBT ).

tff(decl_2245,type,
    summary: vEBT_VEBT ).

tff(decl_2246,type,
    summary2: vEBT_VEBT ).

tff(decl_2247,type,
    treeList: list_VEBT_VEBT ).

tff(decl_2248,type,
    treeList2: list_VEBT_VEBT ).

tff(conj_0,conjecture,
    sa = vEBT_Node(some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),deg,treeList2,summary2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_737_sprop1,axiom,
    ( ! [X55: vEBT_VEBT] :
        ( pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X55),set_VEBT_VEBT2(treeList)))
       => pp(aa_nat_bool(vEBT_invar_vebt(X55),na)) )
    & pp(aa_nat_bool(vEBT_invar_vebt(summary),m))
    & ( size_s6755466524823107622T_VEBT(treeList) = aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m) )
    & ( deg = aa_nat_nat(aa_nat_fun_nat_nat(plus_plus_nat,na),m) )
    & ( sa = vEBT_Node(info,deg,treeList,summary) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_737_sprop1) ).

tff(fact_9__092_060open_062treeList_A_061_AtreeList_H_092_060close_062,axiom,
    treeList2 = treeList,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_9__092_060open_062treeList_A_061_AtreeList_H_092_060close_062) ).

tff(fact_0__092_060open_062summary_A_061_Asummary_H_092_060close_062,axiom,
    summary2 = summary,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__092_060open_062summary_A_061_Asummary_H_092_060close_062) ).

tff(fact_2_infsplit,axiom,
    info = some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_infsplit) ).

tff(c_0_5,negated_conjecture,
    sa != vEBT_Node(some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),deg,treeList2,summary2),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_6,negated_conjecture,
    sa != vEBT_Node(some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),deg,treeList2,summary2),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

tff(c_0_7,plain,
    ! [X21886: vEBT_VEBT] :
      ( ( pp(aa_nat_bool(vEBT_invar_vebt(X21886),na))
        | ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X21886),set_VEBT_VEBT2(treeList))) )
      & pp(aa_nat_bool(vEBT_invar_vebt(summary),m))
      & ( size_s6755466524823107622T_VEBT(treeList) = aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m) )
      & ( deg = aa_nat_nat(aa_nat_fun_nat_nat(plus_plus_nat,na),m) )
      & ( sa = vEBT_Node(info,deg,treeList,summary) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_737_sprop1])])])]) ).

tff(c_0_8,negated_conjecture,
    sa != vEBT_Node(some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),deg,treeList2,summary2),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

tcf(c_0_9,plain,
    sa = vEBT_Node(info,deg,treeList,summary),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_10,plain,
    treeList2 = treeList,
    inference(split_conjunct,[status(thm)],[fact_9__092_060open_062treeList_A_061_AtreeList_H_092_060close_062]) ).

tcf(c_0_11,plain,
    summary2 = summary,
    inference(split_conjunct,[status(thm)],[fact_0__092_060open_062summary_A_061_Asummary_H_092_060close_062]) ).

tcf(c_0_12,negated_conjecture,
    sa != vEBT_Node(some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),deg,treeList2,summary2),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

tcf(c_0_13,plain,
    info = some_P7363390416028606310at_nat(aa_nat7603221163087113075at_nat(product_Pair_nat_nat(mi),ma)),
    inference(split_conjunct,[status(thm)],[fact_2_infsplit]) ).

tcf(c_0_14,plain,
    vEBT_Node(info,deg,treeList2,summary2) = sa,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP278_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39  % Computer : n019.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:27:36 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.45  Running first-order theorem proving
% 0.11/0.45  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
% 65.40/12.00  % Version: 3.5.1
% 65.40/12.00  % Preprocessing class: FMLLSMLLSSSNFFN.
% 65.40/12.00  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 65.40/12.00  % Starting new_bool_3 with 894s (3) cores
% 65.40/12.00  % Starting new_bool_1 with 894s (3) cores
% 65.40/12.00  % Starting sh5l with 298s (1) cores
% 65.40/12.00  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 298s (1) cores
% 65.40/12.00  % sh5l with pid 1045928 completed with status 0
% 65.40/12.00  % Result found by sh5l
% 65.40/12.00  % Preprocessing class: FMLLSMLLSSSNFFN.
% 65.40/12.00  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 65.40/12.00  % Starting new_bool_3 with 894s (3) cores
% 65.40/12.00  % Starting new_bool_1 with 894s (3) cores
% 65.40/12.00  % Starting sh5l with 298s (1) cores
% 65.40/12.00  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 65.40/12.00  % SinE strategy is gf500_gu_R04_F100_L20000
% 65.40/12.00  % Search class: FGHSM-SMLM32-DFFFFFNN
% 65.40/12.00  % Scheduled 13 strats onto 1 cores with 291 seconds (291 total)
% 65.40/12.00  % Starting SubtermCWHack with 27s (1) cores
% 65.40/12.00  % SubtermCWHack with pid 1045936 completed with status 0
% 65.40/12.00  % Result found by SubtermCWHack
% 65.40/12.00  % Preprocessing class: FMLLSMLLSSSNFFN.
% 65.40/12.00  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 65.40/12.00  % Starting new_bool_3 with 894s (3) cores
% 65.40/12.00  % Starting new_bool_1 with 894s (3) cores
% 65.40/12.00  % Starting sh5l with 298s (1) cores
% 65.40/12.00  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 65.40/12.00  % SinE strategy is gf500_gu_R04_F100_L20000
% 65.40/12.00  % Search class: FGHSM-SMLM32-DFFFFFNN
% 65.40/12.00  % Scheduled 13 strats onto 1 cores with 291 seconds (291 total)
% 65.40/12.00  % Starting SubtermCWHack with 27s (1) cores
% 65.40/12.00  % Preprocessing time       : 1.342 s
% 65.40/12.00  
% 65.40/12.00  % Proof found!
% 65.40/12.00  % SZS status Theorem
% 65.40/12.00  % SZS output start CNFRefutation
% See solution above
% 65.40/12.00  % Parsed axioms                        : 13697
% 65.40/12.00  % Removed by relevancy pruning/SinE    : 6175
% 65.40/12.00  % Initial clauses                      : 64878
% 65.40/12.00  % Removed in clause preprocessing      : 7502
% 65.40/12.00  % Initial clauses in saturation        : 57376
% 65.40/12.00  % Processed clauses                    : 7176
% 65.40/12.00  % ...of these trivial                  : 508
% 65.40/12.00  % ...subsumed                          : 3276
% 65.40/12.00  % ...remaining for further processing  : 3391
% 65.40/12.00  % Other redundant clauses eliminated   : 889
% 65.40/12.00  % Clauses deleted for lack of memory   : 0
% 65.40/12.00  % Backward-subsumed                    : 24
% 65.40/12.00  % Backward-rewritten                   : 477
% 65.40/12.00  % Generated clauses                    : 33536
% 65.40/12.00  % ...of the previous two non-redundant : 18819
% 65.40/12.00  % ...aggressively subsumed             : 0
% 65.40/12.00  % Contextual simplify-reflections      : 2
% 65.40/12.00  % Paramodulations                      : 32606
% 65.40/12.00  % Factorizations                       : 71
% 65.40/12.00  % NegExts                              : 0
% 65.40/12.00  % Equation resolutions                 : 924
% 65.40/12.00  % Disequality decompositions           : 0
% 65.40/12.00  % Total rewrite steps                  : 21013
% 65.40/12.00  % ...of those cached                   : 18720
% 65.40/12.00  % Propositional unsat checks           : 0
% 65.40/12.00  %    Propositional check models        : 0
% 65.40/12.00  %    Propositional check unsatisfiable : 0
% 65.40/12.00  %    Propositional clauses             : 0
% 65.40/12.00  %    Propositional clauses after purity: 0
% 65.40/12.00  %    Propositional unsat core size     : 0
% 65.40/12.00  %    Propositional preprocessing time  : 0.000
% 65.40/12.00  %    Propositional encoding time       : 0.000
% 65.40/12.00  %    Propositional solver time         : 0.000
% 65.40/12.00  %    Success case prop preproc time    : 0.000
% 65.40/12.00  %    Success case prop encoding time   : 0.000
% 65.40/12.00  %    Success case prop solver time     : 0.000
% 65.40/12.00  % Current number of processed clauses  : 2346
% 65.40/12.00  %    Positive orientable unit clauses  : 1318
% 65.40/12.00  %    Positive unorientable unit clauses: 24
% 65.40/12.00  %    Negative unit clauses             : 155
% 65.40/12.00  %    Non-unit-clauses                  : 849
% 65.40/12.00  % Current number of unprocessed clauses: 67702
% 65.40/12.00  % ...number of literals in the above   : 478004
% 65.40/12.00  % Current number of archived formulas  : 0
% 65.40/12.00  % Current number of archived clauses   : 502
% 65.40/12.00  % Clause-clause subsumption calls (NU) : 309762
% 65.40/12.00  % Rec. Clause-clause subsumption calls : 97827
% 65.40/12.00  % Non-unit clause-clause subsumptions  : 2119
% 65.40/12.00  % Unit Clause-clause subsumption calls : 38029
% 65.40/12.00  % Rewrite failures with RHS unbound    : 25
% 65.40/12.00  % BW rewrite match attempts            : 2389
% 65.40/12.00  % BW rewrite match successes           : 580
% 65.40/12.00  % Condensation attempts                : 0
% 65.40/12.00  % Condensation successes               : 0
% 65.40/12.00  % Termbank termtop insertions          : 7255221
% 65.40/12.00  % Search garbage collected termcells   : 522306
% 65.40/12.00  
% 65.40/12.00  % -------------------------------------------------
% 65.40/12.00  % User time                : 8.950 s
% 65.40/12.00  % System time              : 0.436 s
% 65.40/12.00  % Total time               : 9.386 s
% 65.40/12.00  % Maximum resident set size: 178696 pages
% 65.40/12.00  
% 65.40/12.00  % -------------------------------------------------
% 65.40/12.00  % User time                : 10.902 s
% 65.40/12.00  % System time              : 0.515 s
% 65.40/12.00  % Total time               : 11.417 s
% 65.40/12.00  % Maximum resident set size: 34816 pages
% 65.40/12.00  % E exiting
%------------------------------------------------------------------------------