TSTP Solution File: ITP243^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP243^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.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:25 EDT 2024

% Result   : Theorem 52.72s 14.37s
% Output   : CNFRefutation 52.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   26
% Syntax   : Number of formulae    :   37 (  13 unt;  21 typ;   0 def)
%            Number of atoms       :   21 (  12 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  115 (   6   ~;   3   |;   1   &; 104   @)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   18 (  16 usr;   8 con; 0-3 aty)
%            Number of variables   :    6 (   0   ^   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    num: $tType ).

thf(decl_sort2,type,
    nat: $tType ).

thf(decl_sort3,type,
    set_nat: $tType ).

thf(decl_sort4,type,
    option_nat: $tType ).

thf(decl_sort5,type,
    vEBT_VEBT: $tType ).

thf(decl_256,type,
    one_one_nat: nat ).

thf(decl_465,type,
    suc: nat > nat ).

thf(decl_533,type,
    bit0: num > num ).

thf(decl_535,type,
    one: num ).

thf(decl_543,type,
    numeral_numeral_nat: num > nat ).

thf(decl_552,type,
    some_nat: nat > option_nat ).

thf(decl_736,type,
    divide_divide_nat: nat > nat > nat ).

thf(decl_879,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_897,type,
    vEBT_VEBT_set_vebt: vEBT_VEBT > set_nat ).

thf(decl_915,type,
    vEBT_is_succ_in_set: set_nat > nat > nat > $o ).

thf(decl_916,type,
    vEBT_vebt_succ: vEBT_VEBT > nat > option_nat ).

thf(decl_939,type,
    deg: nat ).

thf(decl_943,type,
    na: nat ).

thf(decl_944,type,
    sc: nat ).

thf(decl_945,type,
    summary: vEBT_VEBT ).

thf(decl_947,type,
    xa: nat ).

thf(conj_0,conjecture,
    vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

thf(fact_2717_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2717_Suc__1) ).

thf(fact_0__C4_Ohyps_C_I3_J,axiom,
    ! [X1: nat,X2: nat] :
      ( ( ( vEBT_vebt_succ @ summary @ X1 )
        = ( some_nat @ X2 ) )
    <=> ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X1 @ X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0__C4_Ohyps_C_I3_J) ).

thf(fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062,axiom,
    ( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) )
    = ( some_nat @ sc ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062) ).

thf(c_0_5,negated_conjecture,
    ~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_6,plain,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    inference(split_conjunct,[status(thm)],[fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

thf(c_0_7,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_2717_Suc__1]) ).

thf(c_0_8,negated_conjecture,
    ~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ sc ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ( ( divide_divide_nat @ deg @ ( suc @ one_one_nat ) )
    = na ),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

thf(c_0_10,plain,
    ! [X30931: nat,X30932: nat] :
      ( ( ( ( vEBT_vebt_succ @ summary @ X30931 )
         != ( some_nat @ X30932 ) )
        | ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X30931 @ X30932 ) )
      & ( ~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X30931 @ X30932 )
        | ( ( vEBT_vebt_succ @ summary @ X30931 )
          = ( some_nat @ X30932 ) ) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__C4_Ohyps_C_I3_J])]) ).

thf(c_0_11,plain,
    ( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) )
    = ( some_nat @ sc ) ),
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062]) ).

thf(c_0_12,negated_conjecture,
    ~ ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ ( vEBT_VEBT_high @ xa @ na ) @ sc ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9]) ).

thf(c_0_13,plain,
    ! [X1: nat,X2: nat] :
      ( ( vEBT_is_succ_in_set @ ( vEBT_VEBT_set_vebt @ summary ) @ X1 @ X2 )
      | ( ( vEBT_vebt_succ @ summary @ X1 )
       != ( some_nat @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,plain,
    ( ( vEBT_vebt_succ @ summary @ ( vEBT_VEBT_high @ xa @ na ) )
    = ( some_nat @ sc ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7]),c_0_9]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : ITP243^1 : TPTP v8.2.0. Released v8.1.0.
% 0.13/0.16  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n005.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Sat May 18 15:17:53 EDT 2024
% 0.16/0.38  % CPUTime    : 
% 0.23/0.53  Running higher-order theorem proving
% 0.23/0.53  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 52.72/14.37  # Version: 3.1.0-ho
% 52.72/14.37  # partial match(1): HMLMSMSMSSLCHFA
% 52.72/14.37  # Preprocessing class: HMLMSMLMSSLCHFA.
% 52.72/14.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.72/14.37  # Starting new_ho_10 with 1500s (5) cores
% 52.72/14.37  # Starting sh5l with 300s (1) cores
% 52.72/14.37  # Starting new_bool_1 with 300s (1) cores
% 52.72/14.37  # Starting new_bool_2 with 300s (1) cores
% 52.72/14.37  # new_bool_2 with pid 11987 completed with status 0
% 52.72/14.37  # Result found by new_bool_2
% 52.72/14.37  # partial match(1): HMLMSMSMSSLCHFA
% 52.72/14.37  # Preprocessing class: HMLMSMLMSSLCHFA.
% 52.72/14.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.72/14.37  # Starting new_ho_10 with 1500s (5) cores
% 52.72/14.37  # Starting sh5l with 300s (1) cores
% 52.72/14.37  # Starting new_bool_1 with 300s (1) cores
% 52.72/14.37  # Starting new_bool_2 with 300s (1) cores
% 52.72/14.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 52.72/14.37  # Search class: HGHSM-SMLM32-DHFFFSBN
% 52.72/14.37  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 52.72/14.37  # Starting new_ho_10 with 179s (1) cores
% 52.72/14.37  # new_ho_10 with pid 11989 completed with status 0
% 52.72/14.37  # Result found by new_ho_10
% 52.72/14.37  # partial match(1): HMLMSMSMSSLCHFA
% 52.72/14.37  # Preprocessing class: HMLMSMLMSSLCHFA.
% 52.72/14.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 52.72/14.37  # Starting new_ho_10 with 1500s (5) cores
% 52.72/14.37  # Starting sh5l with 300s (1) cores
% 52.72/14.37  # Starting new_bool_1 with 300s (1) cores
% 52.72/14.37  # Starting new_bool_2 with 300s (1) cores
% 52.72/14.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 52.72/14.37  # Search class: HGHSM-SMLM32-DHFFFSBN
% 52.72/14.37  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 52.72/14.37  # Starting new_ho_10 with 179s (1) cores
% 52.72/14.37  # Preprocessing time       : 0.196 s
% 52.72/14.37  # Presaturation interreduction done
% 52.72/14.37  
% 52.72/14.37  # Proof found!
% 52.72/14.37  # SZS status Theorem
% 52.72/14.37  # SZS output start CNFRefutation
% See solution above
% 52.72/14.37  # Parsed axioms                        : 11271
% 52.72/14.37  # Removed by relevancy pruning/SinE    : 6753
% 52.72/14.37  # Initial clauses                      : 11113
% 52.72/14.37  # Removed in clause preprocessing      : 2112
% 52.72/14.37  # Initial clauses in saturation        : 9001
% 52.72/14.37  # Processed clauses                    : 10877
% 52.72/14.37  # ...of these trivial                  : 388
% 52.72/14.37  # ...subsumed                          : 2358
% 52.72/14.37  # ...remaining for further processing  : 8131
% 52.72/14.37  # Other redundant clauses eliminated   : 1921
% 52.72/14.37  # Clauses deleted for lack of memory   : 0
% 52.72/14.37  # Backward-subsumed                    : 63
% 52.72/14.37  # Backward-rewritten                   : 124
% 52.72/14.37  # Generated clauses                    : 2093
% 52.72/14.37  # ...of the previous two non-redundant : 1572
% 52.72/14.37  # ...aggressively subsumed             : 0
% 52.72/14.37  # Contextual simplify-reflections      : 116
% 52.72/14.37  # Paramodulations                      : 493
% 52.72/14.37  # Factorizations                       : 0
% 52.72/14.37  # NegExts                              : 0
% 52.72/14.37  # Equation resolutions                 : 1936
% 52.72/14.37  # Disequality decompositions           : 0
% 52.72/14.37  # Total rewrite steps                  : 8651
% 52.72/14.37  # ...of those cached                   : 7731
% 52.72/14.37  # Propositional unsat checks           : 0
% 52.72/14.37  #    Propositional check models        : 0
% 52.72/14.37  #    Propositional check unsatisfiable : 0
% 52.72/14.37  #    Propositional clauses             : 0
% 52.72/14.37  #    Propositional clauses after purity: 0
% 52.72/14.37  #    Propositional unsat core size     : 0
% 52.72/14.37  #    Propositional preprocessing time  : 0.000
% 52.72/14.37  #    Propositional encoding time       : 0.000
% 52.72/14.37  #    Propositional solver time         : 0.000
% 52.72/14.37  #    Success case prop preproc time    : 0.000
% 52.72/14.37  #    Success case prop encoding time   : 0.000
% 52.72/14.37  #    Success case prop solver time     : 0.000
% 52.72/14.37  # Current number of processed clauses  : 549
% 52.72/14.37  #    Positive orientable unit clauses  : 241
% 52.72/14.37  #    Positive unorientable unit clauses: 0
% 52.72/14.37  #    Negative unit clauses             : 182
% 52.72/14.37  #    Non-unit-clauses                  : 126
% 52.72/14.37  # Current number of unprocessed clauses: 5552
% 52.72/14.37  # ...number of literals in the above   : 20180
% 52.72/14.37  # Current number of archived formulas  : 0
% 52.72/14.37  # Current number of archived clauses   : 6054
% 52.72/14.37  # Clause-clause subsumption calls (NU) : 21148340
% 52.72/14.37  # Rec. Clause-clause subsumption calls : 1824459
% 52.72/14.37  # Non-unit clause-clause subsumptions  : 2152
% 52.72/14.37  # Unit Clause-clause subsumption calls : 26732
% 52.72/14.37  # Rewrite failures with RHS unbound    : 0
% 52.72/14.37  # BW rewrite match attempts            : 1139
% 52.72/14.37  # BW rewrite match successes           : 300
% 52.72/14.37  # Condensation attempts                : 10877
% 52.72/14.37  # Condensation successes               : 48
% 52.72/14.37  # Termbank termtop insertions          : 3021814
% 52.72/14.37  # Search garbage collected termcells   : 203422
% 52.72/14.37  
% 52.72/14.37  # -------------------------------------------------
% 52.72/14.37  # User time                : 12.693 s
% 52.72/14.37  # System time              : 0.131 s
% 52.72/14.37  # Total time               : 12.824 s
% 52.72/14.37  # Maximum resident set size: 51104 pages
% 52.72/14.37  
% 52.72/14.37  # -------------------------------------------------
% 52.72/14.37  # User time                : 13.566 s
% 52.72/14.37  # System time              : 0.157 s
% 52.72/14.37  # Total time               : 13.724 s
% 52.72/14.37  # Maximum resident set size: 27292 pages
% 52.72/14.37  % E---3.1 exiting
% 52.72/14.37  % E exiting
%------------------------------------------------------------------------------