TSTP Solution File: ITP278_1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP278_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:17:56 EDT 2024

% Result   : Theorem 63.34s 9.76s
% Output   : CNFRefutation 63.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   53
% Syntax   : Number of formulae    :   64 (  14 unt;  48 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  :   26 (  15   >;  11   *;   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,
    option4927543243414619207at_nat: $tType ).

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

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

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

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

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

tff(decl_966,type,
    plus_plus_nat: fun_nat_fun_nat_nat ).

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

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

tff(decl_1317,type,
    bit0: fun_num_num ).

tff(decl_1319,type,
    one: num ).

tff(decl_1327,type,
    numeral_numeral_nat: fun_num_nat ).

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

tff(decl_1466,type,
    power_power_nat: fun_nat_fun_nat_nat ).

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

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

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

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

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

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

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

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

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

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

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

tff(decl_2235,type,
    member_VEBT_VEBT: fun_VE7346385682144900493T_bool ).

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

tff(decl_2237,type,
    deg: nat ).

tff(decl_2238,type,
    info: option4927543243414619207at_nat ).

tff(decl_2239,type,
    m: nat ).

tff(decl_2240,type,
    ma: nat ).

tff(decl_2241,type,
    mi: nat ).

tff(decl_2242,type,
    na: nat ).

tff(decl_2243,type,
    sa: vEBT_VEBT ).

tff(decl_2244,type,
    summary: vEBT_VEBT ).

tff(decl_2245,type,
    summary2: vEBT_VEBT ).

tff(decl_2246,type,
    treeList: list_VEBT_VEBT ).

tff(decl_2247,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,
    ( ( sa = vEBT_Node(info,deg,treeList,summary) )
    & ( deg = aa_nat_nat(aa_nat_fun_nat_nat(plus_plus_nat,na),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) )
    & pp(aa_nat_bool(vEBT_invar_vebt(summary),m))
    & ! [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)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_737_sprop1) ).

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(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(c_0_5,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)],[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_nnf,[status(thm)],[c_0_5]) ).

tff(c_0_7,plain,
    ! [X21886: vEBT_VEBT] :
      ( ( sa = vEBT_Node(info,deg,treeList,summary) )
      & ( deg = aa_nat_nat(aa_nat_fun_nat_nat(plus_plus_nat,na),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) )
      & pp(aa_nat_bool(vEBT_invar_vebt(summary),m))
      & ( ~ pp(aa_set8260762808118238015T_bool(aa_VEB289770264548726718T_bool(member_VEBT_VEBT,X21886),set_VEBT_VEBT2(treeList)))
        | pp(aa_nat_bool(vEBT_invar_vebt(X21886),na)) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_737_sprop1])])])]) ).

tcf(c_0_8,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_6]) ).

tcf(c_0_9,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_10,plain,
    sa = vEBT_Node(info,deg,treeList,summary),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

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

tcf(c_0_13,negated_conjecture,
    vEBT_Node(info,deg,treeList2,summary2) != sa,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_15,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : ITP278_1 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.15  % Command    : run_E %s %d THM
% 0.15/0.37  % Computer : n014.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit   : 300
% 0.15/0.37  % WCLimit    : 300
% 0.15/0.37  % DateTime   : Sat May 18 18:48:23 EDT 2024
% 0.15/0.37  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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
% 63.34/9.76  # Version: 3.1.0
% 63.34/9.76  # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.34/9.76  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 63.34/9.76  # Starting new_bool_3 with 897s (3) cores
% 63.34/9.76  # Starting new_bool_1 with 897s (3) cores
% 63.34/9.76  # Starting sh5l with 299s (1) cores
% 63.34/9.76  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 63.34/9.76  # sh5l with pid 10117 completed with status 0
% 63.34/9.76  # Result found by sh5l
% 63.34/9.76  # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.34/9.76  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 63.34/9.76  # Starting new_bool_3 with 897s (3) cores
% 63.34/9.76  # Starting new_bool_1 with 897s (3) cores
% 63.34/9.76  # Starting sh5l with 299s (1) cores
% 63.34/9.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 63.34/9.76  # Search class: FGHSM-SMLM32-DFFFFFNN
% 63.34/9.76  # Scheduled 13 strats onto 1 cores with 295 seconds (295 total)
% 63.34/9.76  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 63.34/9.76  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 10125 completed with status 0
% 63.34/9.76  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 63.34/9.76  # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.34/9.76  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 63.34/9.76  # Starting new_bool_3 with 897s (3) cores
% 63.34/9.76  # Starting new_bool_1 with 897s (3) cores
% 63.34/9.76  # Starting sh5l with 299s (1) cores
% 63.34/9.76  # SinE strategy is gf500_gu_R04_F100_L20000
% 63.34/9.76  # Search class: FGHSM-SMLM32-DFFFFFNN
% 63.34/9.76  # Scheduled 13 strats onto 1 cores with 295 seconds (295 total)
% 63.34/9.76  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 23s (1) cores
% 63.34/9.76  # Preprocessing time       : 1.990 s
% 63.34/9.76  # SatCheck found unsatisfiable ground set
% 63.34/9.76  # Presaturation interreduction done
% 63.34/9.76  
% 63.34/9.76  # Proof found!
% 63.34/9.76  # SZS status Theorem
% 63.34/9.76  # SZS output start CNFRefutation
% See solution above
% 63.34/9.76  # Parsed axioms                        : 13697
% 63.34/9.76  # Removed by relevancy pruning/SinE    : 6175
% 63.34/9.76  # Initial clauses                      : 64878
% 63.34/9.76  # Removed in clause preprocessing      : 7502
% 63.34/9.76  # Initial clauses in saturation        : 57376
% 63.34/9.76  # Processed clauses                    : 6730
% 63.34/9.76  # ...of these trivial                  : 421
% 63.34/9.76  # ...subsumed                          : 1309
% 63.34/9.76  # ...remaining for further processing  : 5000
% 63.34/9.76  # Other redundant clauses eliminated   : 947
% 63.34/9.76  # Clauses deleted for lack of memory   : 0
% 63.34/9.76  # Backward-subsumed                    : 8
% 63.34/9.76  # Backward-rewritten                   : 151
% 63.34/9.76  # Generated clauses                    : 861
% 63.34/9.76  # ...of the previous two non-redundant : 580
% 63.34/9.76  # ...aggressively subsumed             : 0
% 63.34/9.76  # Contextual simplify-reflections      : 9
% 63.34/9.76  # Paramodulations                      : 0
% 63.34/9.76  # Factorizations                       : 0
% 63.34/9.76  # NegExts                              : 0
% 63.34/9.76  # Equation resolutions                 : 947
% 63.34/9.76  # Disequality decompositions           : 0
% 63.34/9.76  # Total rewrite steps                  : 2443
% 63.34/9.76  # ...of those cached                   : 1621
% 63.34/9.76  # Propositional unsat checks           : 1
% 63.34/9.76  #    Propositional check models        : 0
% 63.34/9.76  #    Propositional check unsatisfiable : 1
% 63.34/9.76  #    Propositional clauses             : 55206
% 63.34/9.76  #    Propositional clauses after purity: 3944
% 63.34/9.76  #    Propositional unsat core size     : 2
% 63.34/9.76  #    Propositional preprocessing time  : 0.000
% 63.34/9.76  #    Propositional encoding time       : 0.265
% 63.34/9.76  #    Propositional solver time         : 0.004
% 63.34/9.76  #    Success case prop preproc time    : 0.000
% 63.34/9.76  #    Success case prop encoding time   : 0.265
% 63.34/9.76  #    Success case prop solver time     : 0.004
% 63.34/9.76  # Current number of processed clauses  : 3980
% 63.34/9.76  #    Positive orientable unit clauses  : 1065
% 63.34/9.76  #    Positive unorientable unit clauses: 49
% 63.34/9.76  #    Negative unit clauses             : 167
% 63.34/9.76  #    Non-unit-clauses                  : 2699
% 63.34/9.76  # Current number of unprocessed clauses: 51226
% 63.34/9.76  # ...number of literals in the above   : 434258
% 63.34/9.76  # Current number of archived formulas  : 0
% 63.34/9.76  # Current number of archived clauses   : 159
% 63.34/9.76  # Clause-clause subsumption calls (NU) : 1006531
% 63.34/9.76  # Rec. Clause-clause subsumption calls : 544731
% 63.34/9.76  # Non-unit clause-clause subsumptions  : 1231
% 63.34/9.76  # Unit Clause-clause subsumption calls : 13773
% 63.34/9.76  # Rewrite failures with RHS unbound    : 0
% 63.34/9.76  # BW rewrite match attempts            : 6454
% 63.34/9.76  # BW rewrite match successes           : 414
% 63.34/9.76  # Condensation attempts                : 0
% 63.34/9.76  # Condensation successes               : 0
% 63.34/9.76  # Termbank termtop insertions          : 8873031
% 63.34/9.76  # Search garbage collected termcells   : 522308
% 63.34/9.76  
% 63.34/9.76  # -------------------------------------------------
% 63.34/9.76  # User time                : 7.589 s
% 63.34/9.76  # System time              : 0.383 s
% 63.34/9.76  # Total time               : 7.972 s
% 63.34/9.76  # Maximum resident set size: 176536 pages
% 63.34/9.76  
% 63.34/9.76  # -------------------------------------------------
% 63.34/9.76  # User time                : 8.661 s
% 63.34/9.76  # System time              : 0.427 s
% 63.34/9.76  # Total time               : 9.088 s
% 63.34/9.76  # Maximum resident set size: 31488 pages
% 63.34/9.76  % E---3.1 exiting
% 63.34/9.76  % E exiting
%------------------------------------------------------------------------------