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

View Problem - Process Solution

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

% Computer : n012.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 : Tue May 21 02:18:14 EDT 2024

% Result   : Theorem 0.18s 0.46s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   35
% Syntax   : Number of formulae    :   64 (  27 unt;  19 typ;   0 def)
%            Number of atoms       :  132 (  28 equ;   0 cnn)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  380 (  39   ~;  35   |;  12   &; 285   @)
%                                         (   5 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :  147 ( 147   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   21 (  18 usr;   3 con; 0-3 aty)
%            Number of variables   :  113 (  61   ^  44   !;   8   ?; 113   :)

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

thf(decl_25,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(decl_28,type,
    mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_30,type,
    mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_32,type,
    mforall_ind: ( mu > $i > $o ) > $i > $o ).

thf(decl_33,type,
    mforall_indset: ( ( mu > $i > $o ) > $i > $o ) > $i > $o ).

thf(decl_35,type,
    mexists_ind: ( mu > $i > $o ) > $i > $o ).

thf(decl_38,type,
    mbox_generic: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_39,type,
    mdia_generic: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_40,type,
    rel: $i > $i > $o ).

thf(decl_41,type,
    mbox: ( $i > $o ) > $i > $o ).

thf(decl_42,type,
    mdia: ( $i > $o ) > $i > $o ).

thf(decl_43,type,
    mvalid: ( $i > $o ) > $o ).

thf(decl_45,type,
    p: ( mu > $i > $o ) > $i > $o ).

thf(decl_46,type,
    esk1_0: $i ).

thf(decl_47,type,
    epred1_0: mu > $i > $o ).

thf(decl_48,type,
    esk2_3: $i > ( mu > $i > $o ) > ( mu > $i > $o ) > $i ).

thf(decl_49,type,
    esk3_3: $i > ( mu > $i > $o ) > ( mu > $i > $o ) > mu ).

thf(decl_50,type,
    epred2_0: mu > $i > $o ).

thf(mbox_generic,axiom,
    ( mbox_generic
    = ( ^ [X15: $i > $i > $o,X4: $i > $o,X3: $i] :
        ! [X16: $i] :
          ( ~ ( X15 @ X3 @ X16 )
          | ( X4 @ X16 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mbox_generic) ).

thf(mdia_generic,axiom,
    ( mdia_generic
    = ( ^ [X15: $i > $i > $o,X4: $i > $o,X3: $i] :
        ? [X16: $i] :
          ( ( X15 @ X3 @ X16 )
          & ( X4 @ X16 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mdia_generic) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X4: $i > $o] :
        ! [X3: $i] : ( X4 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mvalid) ).

thf(mforall_ind,axiom,
    ( mforall_ind
    = ( ^ [X6: mu > $i > $o,X3: $i] :
        ! [X1: mu] : ( X6 @ X1 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mforall_ind) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X20: $i] :
          ( ~ ( rel @ Z1 @ X20 )
          | ( Z0 @ X20 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mbox) ).

thf(mequiv,axiom,
    ( mequiv
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
        <=> ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mequiv) ).

thf(mimplies,axiom,
    ( mimplies
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
         => ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mimplies) ).

thf(mforall_indset,axiom,
    ( mforall_indset
    = ( ^ [X7: ( mu > $i > $o ) > $i > $o,X3: $i] :
        ! [X8: mu > $i > $o] : ( X7 @ X8 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mforall_indset) ).

thf(mexists_ind,axiom,
    ( mexists_ind
    = ( ^ [X11: mu > $i > $o,X3: $i] :
        ? [X1: mu] : ( X11 @ X1 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mexists_ind) ).

thf(mdia,axiom,
    ( mdia
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ? [X21: $i] :
          ( ( rel @ Z1 @ X21 )
          & ( Z0 @ X21 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mdia) ).

thf(ax17,axiom,
    ( mvalid
    @ ( mforall_indset
      @ ^ [X17: mu > $i > $o] :
          ( mforall_indset
          @ ^ [X18: mu > $i > $o] :
              ( mimplies
              @ ( mbox
                @ ( mforall_ind
                  @ ^ [X1: mu] : ( mequiv @ ( X17 @ X1 ) @ ( X18 @ X1 ) ) ) )
              @ ( mequiv @ ( p @ X17 ) @ ( p @ X18 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).

thf(possible_instantiation_of_the_positive,conjecture,
    ( mvalid
    @ ( mforall_indset
      @ ^ [X19: mu > $i > $o] :
          ( mimplies @ ( p @ X19 )
          @ ( mdia
            @ ( mexists_ind
              @ ^ [X1: mu] : ( X19 @ X1 ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',possible_instantiation_of_the_positive) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X4: $i > $o,X3: $i] :
          ~ ( X4 @ X3 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL016^0.ax',mnot) ).

thf(ax16,axiom,
    ( mvalid
    @ ( mnot
      @ ( p
        @ ^ [X1: mu,X3: $i] : ( X1 != X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).

thf(c_0_14,plain,
    ( mbox_generic
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X16: $i] :
          ( ~ ( Z0 @ Z2 @ X16 )
          | ( Z1 @ X16 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_generic]) ).

thf(c_0_15,plain,
    ( mdia_generic
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
        ? [X16: $i] :
          ( ( Z0 @ Z2 @ X16 )
          & ( Z1 @ X16 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mdia_generic]) ).

thf(c_0_16,plain,
    ( mvalid
    = ( ^ [Z0: $i > $o] :
        ! [X3: $i] : ( Z0 @ X3 ) ) ),
    inference(fof_simplification,[status(thm)],[mvalid]) ).

thf(c_0_17,plain,
    ( mforall_ind
    = ( ^ [Z0: mu > $i > $o,Z1: $i] :
        ! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_ind]) ).

thf(c_0_18,axiom,
    ( mbox
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X20: $i] :
          ( ~ ( rel @ Z1 @ X20 )
          | ( Z0 @ X20 ) ) ) ),
    inference(apply_def,[status(thm)],[mbox,c_0_14]) ).

thf(c_0_19,plain,
    ( mequiv
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ( Z0 @ Z2 )
        <=> ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mequiv]) ).

thf(c_0_20,plain,
    ( mimplies
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ( Z0 @ Z2 )
         => ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimplies]) ).

thf(c_0_21,plain,
    ( mforall_indset
    = ( ^ [Z0: ( mu > $i > $o ) > $i > $o,Z1: $i] :
        ! [X8: mu > $i > $o] : ( Z0 @ X8 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mforall_indset]) ).

thf(c_0_22,plain,
    ( mexists_ind
    = ( ^ [Z0: mu > $i > $o,Z1: $i] :
        ? [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mexists_ind]) ).

thf(c_0_23,axiom,
    ( mdia
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ? [X21: $i] :
          ( ( rel @ Z1 @ X21 )
          & ( Z0 @ X21 ) ) ) ),
    inference(apply_def,[status(thm)],[mdia,c_0_15]) ).

thf(c_0_24,plain,
    ! [X31: $i,X30: mu > $i > $o,X29: mu > $i > $o] :
      ( ! [X28: $i] :
          ( ~ ( rel @ X31 @ X28 )
          | ! [X27: mu] :
              ( ( X30 @ X27 @ X28 )
            <=> ( X29 @ X27 @ X28 ) ) )
     => ( ( p @ X30 @ X31 )
      <=> ( p @ X29 @ X31 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax17]),c_0_16]),c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).

thf(c_0_25,negated_conjecture,
    ~ ! [X25: $i,X24: mu > $i > $o] :
        ( ( p @ X24 @ X25 )
       => ? [X23: $i] :
            ( ( rel @ X25 @ X23 )
            & ? [X22: mu] : ( X24 @ X22 @ X23 ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[possible_instantiation_of_the_positive])]),c_0_16]),c_0_22]),c_0_23]),c_0_20]),c_0_21]) ).

thf(c_0_26,plain,
    ( mnot
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot]) ).

thf(c_0_27,plain,
    ! [X37: $i,X38: mu > $i > $o,X39: mu > $i > $o] :
      ( ( ~ ( p @ X38 @ X37 )
        | ( p @ X39 @ X37 )
        | ( rel @ X37 @ ( esk2_3 @ X37 @ X38 @ X39 ) ) )
      & ( ~ ( p @ X39 @ X37 )
        | ( p @ X38 @ X37 )
        | ( rel @ X37 @ ( esk2_3 @ X37 @ X38 @ X39 ) ) )
      & ( ~ ( p @ X38 @ X37 )
        | ( p @ X39 @ X37 )
        | ~ ( X38 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) )
        | ~ ( X39 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) ) )
      & ( ~ ( p @ X39 @ X37 )
        | ( p @ X38 @ X37 )
        | ~ ( X38 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) )
        | ~ ( X39 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) ) )
      & ( ~ ( p @ X38 @ X37 )
        | ( p @ X39 @ X37 )
        | ( X38 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) )
        | ( X39 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) ) )
      & ( ~ ( p @ X39 @ X37 )
        | ( p @ X38 @ X37 )
        | ( X38 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) )
        | ( X39 @ ( esk3_3 @ X37 @ X38 @ X39 ) @ ( esk2_3 @ X37 @ X38 @ X39 ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])]) ).

thf(c_0_28,negated_conjecture,
    ! [X34: $i,X35: mu] :
      ( ( p @ epred1_0 @ esk1_0 )
      & ( ~ ( rel @ esk1_0 @ X34 )
        | ~ ( epred1_0 @ X35 @ X34 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])]) ).

thf(c_0_29,plain,
    ! [X26: $i] :
      ~ ( p
        @ ^ [Z0: mu,Z1: $i] : ~ Z0
        @ X26 ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax16]),c_0_16]),c_0_26])]) ).

thf(c_0_30,plain,
    ! [X44: $i,X45: mu] :
      ( ( ~ ( epred2_0 @ X45 @ X44 )
        | ( X45 != X45 ) )
      & ( ( X45 = X45 )
        | ( epred2_0 @ X45 @ X44 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[])])])]) ).

thf(c_0_31,plain,
    ! [X8: mu > $i > $o,X6: mu > $i > $o,X3: $i] :
      ( ( p @ X8 @ X3 )
      | ( X8 @ ( esk3_3 @ X3 @ X8 @ X6 ) @ ( esk2_3 @ X3 @ X8 @ X6 ) )
      | ( X6 @ ( esk3_3 @ X3 @ X8 @ X6 ) @ ( esk2_3 @ X3 @ X8 @ X6 ) )
      | ~ ( p @ X6 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_32,negated_conjecture,
    p @ epred1_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

thf(c_0_33,plain,
    ! [X36: $i] :
      ~ ( p
        @ ^ [Z0: mu,Z1: $i] : ~ Z0
        @ X36 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_29])]) ).

thf(c_0_34,plain,
    ! [X43: $i,X42: mu] :
      ( ( epred2_0 @ X42 @ X43 )
    <=> ( X42 != X42 ) ),
    introduced(definition) ).

thf(c_0_35,plain,
    ! [X3: $i,X1: mu] :
      ( ~ ( epred2_0 @ X1 @ X3 )
      | ( X1 != X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

thf(c_0_36,negated_conjecture,
    ! [X1: mu,X3: $i] :
      ( ~ ( rel @ esk1_0 @ X3 )
      | ~ ( epred1_0 @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

thf(c_0_37,negated_conjecture,
    ! [X6: mu > $i > $o] :
      ( ( epred1_0 @ ( esk3_3 @ esk1_0 @ X6 @ epred1_0 ) @ ( esk2_3 @ esk1_0 @ X6 @ epred1_0 ) )
      | ( X6 @ ( esk3_3 @ esk1_0 @ X6 @ epred1_0 ) @ ( esk2_3 @ esk1_0 @ X6 @ epred1_0 ) )
      | ( p @ X6 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

thf(c_0_38,plain,
    ! [X3: $i] :
      ( ( p @ epred2_0 @ X3 )
     != $true ),
    inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_33]),c_0_34]) ).

thf(c_0_39,plain,
    ! [X1: mu,X3: $i] :
      ~ ( epred2_0 @ X1 @ X3 ),
    inference(cn,[status(thm)],[c_0_35]) ).

thf(c_0_40,negated_conjecture,
    ! [X6: mu > $i > $o] :
      ( ( X6 @ ( esk3_3 @ esk1_0 @ X6 @ epred1_0 ) @ ( esk2_3 @ esk1_0 @ X6 @ epred1_0 ) )
      | ( p @ X6 @ esk1_0 )
      | ~ ( rel @ esk1_0 @ ( esk2_3 @ esk1_0 @ X6 @ epred1_0 ) ) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

thf(c_0_41,plain,
    ! [X3: $i] :
      ~ ( p @ epred2_0 @ X3 ),
    inference(cn,[status(thm)],[c_0_38]) ).

thf(c_0_42,plain,
    ~ ( rel @ esk1_0 @ ( esk2_3 @ esk1_0 @ epred2_0 @ epred1_0 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

thf(c_0_43,plain,
    ! [X8: mu > $i > $o,X6: mu > $i > $o,X3: $i] :
      ( ( p @ X8 @ X3 )
      | ( rel @ X3 @ ( esk2_3 @ X3 @ X8 @ X6 ) )
      | ~ ( p @ X6 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_44,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_32])]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : PHI043^1 : TPTP v8.2.0. Released v7.5.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n012.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Sat May 18 14:49:22 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.18/0.44  Running higher-order theorem proving
% 0.18/0.44  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  # Version: 3.1.0-ho
% 0.18/0.46  # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.18/0.46  # Starting lpo9_lambda_fix with 300s (1) cores
% 0.18/0.46  # Starting sh5l with 300s (1) cores
% 0.18/0.46  # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.46  # lpo9_lambda_fix with pid 16186 completed with status 0
% 0.18/0.46  # Result found by lpo9_lambda_fix
% 0.18/0.46  # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.18/0.46  # Starting lpo9_lambda_fix with 300s (1) cores
% 0.18/0.46  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46  # Search class: HGHNF-FFSF33-SHHSMSBN
% 0.18/0.46  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46  # new_ho_10 with pid 16194 completed with status 0
% 0.18/0.46  # Result found by new_ho_10
% 0.18/0.46  # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.18/0.46  # Starting lpo9_lambda_fix with 300s (1) cores
% 0.18/0.46  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46  # Search class: HGHNF-FFSF33-SHHSMSBN
% 0.18/0.46  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting new_ho_10 with 163s (1) cores
% 0.18/0.46  # Preprocessing time       : 0.001 s
% 0.18/0.46  # Presaturation interreduction done
% 0.18/0.46  
% 0.18/0.46  # Proof found!
% 0.18/0.46  # SZS status Theorem
% 0.18/0.46  # SZS output start CNFRefutation
% See solution above
% 0.18/0.46  # Parsed axioms                        : 50
% 0.18/0.46  # Removed by relevancy pruning/SinE    : 36
% 0.18/0.46  # Initial clauses                      : 11
% 0.18/0.46  # Removed in clause preprocessing      : 1
% 0.18/0.46  # Initial clauses in saturation        : 10
% 0.18/0.46  # Processed clauses                    : 23
% 0.18/0.46  # ...of these trivial                  : 0
% 0.18/0.46  # ...subsumed                          : 0
% 0.18/0.46  # ...remaining for further processing  : 23
% 0.18/0.46  # Other redundant clauses eliminated   : 0
% 0.18/0.46  # Clauses deleted for lack of memory   : 0
% 0.18/0.46  # Backward-subsumed                    : 0
% 0.18/0.46  # Backward-rewritten                   : 0
% 0.18/0.46  # Generated clauses                    : 13
% 0.18/0.46  # ...of the previous two non-redundant : 5
% 0.18/0.46  # ...aggressively subsumed             : 0
% 0.18/0.46  # Contextual simplify-reflections      : 0
% 0.18/0.46  # Paramodulations                      : 11
% 0.18/0.46  # Factorizations                       : 2
% 0.18/0.46  # NegExts                              : 0
% 0.18/0.46  # Equation resolutions                 : 0
% 0.18/0.46  # Disequality decompositions           : 0
% 0.18/0.46  # Total rewrite steps                  : 9
% 0.18/0.46  # ...of those cached                   : 8
% 0.18/0.46  # Propositional unsat checks           : 0
% 0.18/0.46  #    Propositional check models        : 0
% 0.18/0.46  #    Propositional check unsatisfiable : 0
% 0.18/0.46  #    Propositional clauses             : 0
% 0.18/0.46  #    Propositional clauses after purity: 0
% 0.18/0.46  #    Propositional unsat core size     : 0
% 0.18/0.46  #    Propositional preprocessing time  : 0.000
% 0.18/0.46  #    Propositional encoding time       : 0.000
% 0.18/0.46  #    Propositional solver time         : 0.000
% 0.18/0.46  #    Success case prop preproc time    : 0.000
% 0.18/0.46  #    Success case prop encoding time   : 0.000
% 0.18/0.46  #    Success case prop solver time     : 0.000
% 0.18/0.46  # Current number of processed clauses  : 13
% 0.18/0.46  #    Positive orientable unit clauses  : 1
% 0.18/0.46  #    Positive unorientable unit clauses: 0
% 0.18/0.46  #    Negative unit clauses             : 3
% 0.18/0.46  #    Non-unit-clauses                  : 9
% 0.18/0.46  # Current number of unprocessed clauses: 2
% 0.18/0.46  # ...number of literals in the above   : 6
% 0.18/0.46  # Current number of archived formulas  : 0
% 0.18/0.46  # Current number of archived clauses   : 10
% 0.18/0.46  # Clause-clause subsumption calls (NU) : 23
% 0.18/0.46  # Rec. Clause-clause subsumption calls : 14
% 0.18/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.18/0.46  # Unit Clause-clause subsumption calls : 0
% 0.18/0.46  # Rewrite failures with RHS unbound    : 0
% 0.18/0.46  # BW rewrite match attempts            : 0
% 0.18/0.46  # BW rewrite match successes           : 0
% 0.18/0.46  # Condensation attempts                : 23
% 0.18/0.46  # Condensation successes               : 0
% 0.18/0.46  # Termbank termtop insertions          : 2195
% 0.18/0.46  # Search garbage collected termcells   : 637
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.003 s
% 0.18/0.46  # System time              : 0.002 s
% 0.18/0.46  # Total time               : 0.005 s
% 0.18/0.46  # Maximum resident set size: 1908 pages
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.004 s
% 0.18/0.46  # System time              : 0.005 s
% 0.18/0.46  # Total time               : 0.009 s
% 0.18/0.46  # Maximum resident set size: 1784 pages
% 0.18/0.46  % E---3.1 exiting
% 0.18/0.46  % E exiting
%------------------------------------------------------------------------------