TSTP Solution File: ITP232^3 by E---3.1.00

View Problem - Process Solution

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

% Computer : n007.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:15 EDT 2024

% Result   : Theorem 90.64s 24.21s
% Output   : CNFRefutation 90.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   23 (   8 unt;  11 typ;   0 def)
%            Number of atoms       :   16 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   65 (   8   ~;   2   |;   0   &;  53   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   10 (   0   ^   6   !;   4   ?;  10   :)

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

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

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

thf(decl_417,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_835,type,
    vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).

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

thf(decl_852,type,
    vEBT_VEBT_minNull: vEBT_VEBT > $o ).

thf(decl_886,type,
    mi: nat ).

thf(decl_887,type,
    na: nat ).

thf(decl_889,type,
    treeList: list_VEBT_VEBT ).

thf(decl_1127,type,
    esk221_1: vEBT_VEBT > nat ).

thf(conj_0,conjecture,
    ? [X261: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ X261 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_0_not__min__Null__member,axiom,
    ! [X1: vEBT_VEBT] :
      ( ~ ( vEBT_VEBT_minNull @ X1 )
     => ? [X2: nat] : ( vEBT_V8194947554948674370ptions @ X1 @ X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_not__min__Null__member) ).

thf(fact_1_False,axiom,
    ~ ( vEBT_VEBT_minNull @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_False) ).

thf(c_0_3,negated_conjecture,
    ~ ? [X261: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ X261 ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_4,plain,
    ! [X1: vEBT_VEBT] :
      ( ~ ( vEBT_VEBT_minNull @ X1 )
     => ? [X2: nat] : ( vEBT_V8194947554948674370ptions @ X1 @ X2 ) ),
    inference(fof_simplification,[status(thm)],[fact_0_not__min__Null__member]) ).

thf(c_0_5,negated_conjecture,
    ! [X22942: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ X22942 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).

thf(c_0_6,plain,
    ! [X25015: vEBT_VEBT] :
      ( ( vEBT_VEBT_minNull @ X25015 )
      | ( vEBT_V8194947554948674370ptions @ X25015 @ ( esk221_1 @ X25015 ) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

thf(c_0_7,plain,
    ~ ( vEBT_VEBT_minNull @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) ),
    inference(fof_simplification,[status(thm)],[fact_1_False]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) @ X2 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,plain,
    ! [X1: vEBT_VEBT] :
      ( ( vEBT_VEBT_minNull @ X1 )
      | ( vEBT_V8194947554948674370ptions @ X1 @ ( esk221_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ~ ( vEBT_VEBT_minNull @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ mi @ na ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : ITP232^3 : TPTP v8.2.0. Released v8.1.0.
% 0.13/0.16  % Command    : run_E %s %d THM
% 0.16/0.38  % Computer : n007.cluster.edu
% 0.16/0.38  % Model    : x86_64 x86_64
% 0.16/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38  % Memory   : 8042.1875MB
% 0.16/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38  % CPULimit   : 300
% 0.16/0.38  % WCLimit    : 300
% 0.16/0.38  % DateTime   : Sat May 18 16:08:38 EDT 2024
% 0.16/0.38  % CPUTime    : 
% 0.23/0.54  Running higher-order theorem proving
% 0.23/0.54  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
% 90.64/24.21  # Version: 3.1.0-ho
% 90.64/24.21  # partial match(1): HMLMSMSMSSLCHFA
% 90.64/24.21  # Preprocessing class: HMLMSMLMSSLCHFA.
% 90.64/24.21  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 90.64/24.21  # Starting new_ho_10 with 1495s (5) cores
% 90.64/24.21  # Starting sh5l with 299s (1) cores
% 90.64/24.21  # Starting new_bool_1 with 299s (1) cores
% 90.64/24.21  # Starting new_bool_2 with 299s (1) cores
% 90.64/24.21  # new_bool_2 with pid 30694 completed with status 0
% 90.64/24.21  # Result found by new_bool_2
% 90.64/24.21  # partial match(1): HMLMSMSMSSLCHFA
% 90.64/24.21  # Preprocessing class: HMLMSMLMSSLCHFA.
% 90.64/24.21  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 90.64/24.21  # Starting new_ho_10 with 1495s (5) cores
% 90.64/24.21  # Starting sh5l with 299s (1) cores
% 90.64/24.21  # Starting new_bool_1 with 299s (1) cores
% 90.64/24.21  # Starting new_bool_2 with 299s (1) cores
% 90.64/24.21  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 90.64/24.21  # Search class: HGHSM-SMLM32-DHFFFSBN
% 90.64/24.21  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 90.64/24.21  # Starting new_ho_10 with 179s (1) cores
% 90.64/24.21  # new_ho_10 with pid 30695 completed with status 0
% 90.64/24.21  # Result found by new_ho_10
% 90.64/24.21  # partial match(1): HMLMSMSMSSLCHFA
% 90.64/24.21  # Preprocessing class: HMLMSMLMSSLCHFA.
% 90.64/24.21  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 90.64/24.21  # Starting new_ho_10 with 1495s (5) cores
% 90.64/24.21  # Starting sh5l with 299s (1) cores
% 90.64/24.21  # Starting new_bool_1 with 299s (1) cores
% 90.64/24.21  # Starting new_bool_2 with 299s (1) cores
% 90.64/24.21  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 90.64/24.21  # Search class: HGHSM-SMLM32-DHFFFSBN
% 90.64/24.21  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 90.64/24.21  # Starting new_ho_10 with 179s (1) cores
% 90.64/24.21  # Preprocessing time       : 0.157 s
% 90.64/24.21  # Presaturation interreduction done
% 90.64/24.21  
% 90.64/24.21  # Proof found!
% 90.64/24.21  # SZS status Theorem
% 90.64/24.21  # SZS output start CNFRefutation
% See solution above
% 90.64/24.21  # Parsed axioms                        : 10550
% 90.64/24.21  # Removed by relevancy pruning/SinE    : 8377
% 90.64/24.21  # Initial clauses                      : 6516
% 90.64/24.21  # Removed in clause preprocessing      : 1832
% 90.64/24.21  # Initial clauses in saturation        : 4684
% 90.64/24.21  # Processed clauses                    : 5658
% 90.64/24.21  # ...of these trivial                  : 156
% 90.64/24.21  # ...subsumed                          : 1227
% 90.64/24.21  # ...remaining for further processing  : 4275
% 90.64/24.21  # Other redundant clauses eliminated   : 1052
% 90.64/24.21  # Clauses deleted for lack of memory   : 0
% 90.64/24.21  # Backward-subsumed                    : 20
% 90.64/24.21  # Backward-rewritten                   : 20
% 90.64/24.21  # Generated clauses                    : 1106
% 90.64/24.21  # ...of the previous two non-redundant : 887
% 90.64/24.21  # ...aggressively subsumed             : 0
% 90.64/24.21  # Contextual simplify-reflections      : 91
% 90.64/24.21  # Paramodulations                      : 360
% 90.64/24.21  # Factorizations                       : 0
% 90.64/24.21  # NegExts                              : 0
% 90.64/24.21  # Equation resolutions                 : 1059
% 90.64/24.21  # Disequality decompositions           : 0
% 90.64/24.21  # Total rewrite steps                  : 3524
% 90.64/24.21  # ...of those cached                   : 3282
% 90.64/24.21  # Propositional unsat checks           : 0
% 90.64/24.21  #    Propositional check models        : 0
% 90.64/24.21  #    Propositional check unsatisfiable : 0
% 90.64/24.21  #    Propositional clauses             : 0
% 90.64/24.21  #    Propositional clauses after purity: 0
% 90.64/24.21  #    Propositional unsat core size     : 0
% 90.64/24.21  #    Propositional preprocessing time  : 0.000
% 90.64/24.21  #    Propositional encoding time       : 0.000
% 90.64/24.21  #    Propositional solver time         : 0.000
% 90.64/24.21  #    Success case prop preproc time    : 0.000
% 90.64/24.21  #    Success case prop encoding time   : 0.000
% 90.64/24.21  #    Success case prop solver time     : 0.000
% 90.64/24.21  # Current number of processed clauses  : 322
% 90.64/24.21  #    Positive orientable unit clauses  : 130
% 90.64/24.21  #    Positive unorientable unit clauses: 0
% 90.64/24.21  #    Negative unit clauses             : 109
% 90.64/24.21  #    Non-unit-clauses                  : 83
% 90.64/24.21  # Current number of unprocessed clauses: 3118
% 90.64/24.21  # ...number of literals in the above   : 12905
% 90.64/24.21  # Current number of archived formulas  : 0
% 90.64/24.21  # Current number of archived clauses   : 3245
% 90.64/24.21  # Clause-clause subsumption calls (NU) : 10135883
% 90.64/24.21  # Rec. Clause-clause subsumption calls : 505078
% 90.64/24.21  # Non-unit clause-clause subsumptions  : 1152
% 90.64/24.21  # Unit Clause-clause subsumption calls : 10773
% 90.64/24.21  # Rewrite failures with RHS unbound    : 0
% 90.64/24.21  # BW rewrite match attempts            : 332
% 90.64/24.21  # BW rewrite match successes           : 79
% 90.64/24.21  # Condensation attempts                : 5658
% 90.64/24.21  # Condensation successes               : 36
% 90.64/24.21  # Termbank termtop insertions          : 2572909
% 90.64/24.21  # Search garbage collected termcells   : 159781
% 90.64/24.21  
% 90.64/24.21  # -------------------------------------------------
% 90.64/24.21  # User time                : 22.061 s
% 90.64/24.21  # System time              : 0.152 s
% 90.64/24.21  # Total time               : 22.213 s
% 90.64/24.21  # Maximum resident set size: 36812 pages
% 90.64/24.21  
% 90.64/24.21  # -------------------------------------------------
% 90.64/24.21  # User time                : 23.367 s
% 90.64/24.21  # System time              : 0.197 s
% 90.64/24.21  # Total time               : 23.564 s
% 90.64/24.21  # Maximum resident set size: 25520 pages
% 90.64/24.21  % E---3.1 exiting
% 90.64/24.21  % E exiting
%------------------------------------------------------------------------------