↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV426^4 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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 : Wed Sep 30 08:39:42 AM UTC 2026

% Result   : Theorem 0.30s 0.26s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   48 (  32 unt;   0 typ;   0 def)
%            Number of atoms       :  196 (  25 equ;   0 cnn)
%            Maximal formula atoms :   21 (   4 avg)
%            Number of connectives :  385 (  48   ~;  56   |;   8   &; 253   @)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   46 (  46   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   22 (  20 usr;   6 con; 0-3 aty)
%            Number of variables   :  111 (  52   ^;  59   !;   0   ?; 111   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_29,type,
    mnot: ( $i > $o ) > $i > $o ).

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

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

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

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

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

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

thf(decl_44,type,
    icl_princ: ( $i > $o ) > $i > $o ).

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

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

thf(decl_51,type,
    iclval: ( $i > $o ) > $o ).

thf(decl_52,type,
    s: $i > $o ).

thf(decl_53,type,
    a: $i > $o ).

thf(decl_54,type,
    b: $i > $o ).

thf(decl_56,type,
    esk2_2: ( $i > $o ) > $i > $i ).

thf(decl_57,type,
    esk3_0: $i ).

thf(decl_58,type,
    esk4_0: $i ).

thf(decl_59,type,
    esk5_0: $i ).

thf(decl_60,type,
    esk6_0: $i ).

thf(decl_61,type,
    esk7_0: $i ).

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',mimpl) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X2: $i > $o,X3: $i] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
          | ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',mor) ).

thf(icl_atom,axiom,
    ( icl_atom
    = ( ^ [X11: $i > $o] : ( mbox @ rel @ X11 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',icl_atom) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
        ! [X12: $i] :
          ( ( X10 @ X1 @ X12 )
         => ( X11 @ X12 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',mbox) ).

thf(icl_impl,axiom,
    ( icl_impl
    = ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',icl_impl) ).

thf(icl_says,axiom,
    ( icl_says
    = ( ^ [X19: $i > $o,X21: $i > $o] : ( mbox @ rel @ ( mor @ X19 @ X21 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',icl_says) ).

thf(icl_s4_valid,axiom,
    ( iclval
    = ( ^ [X22: $i > $o] : ( mvalid @ X22 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',icl_s4_valid) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X11: $i > $o] :
        ! [X15: $i] : ( X11 @ X15 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',mvalid) ).

thf(cuc,conjecture,
    iclval @ ( icl_impl @ ( icl_says @ ( icl_impl @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_atom @ s ) ) @ ( icl_impl @ ( icl_says @ ( icl_princ @ a ) @ ( icl_atom @ s ) ) @ ( icl_says @ ( icl_princ @ b ) @ ( icl_atom @ s ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',cuc) ).

thf(icl_princ,axiom,
    ( icl_princ
    = ( ^ [X11: $i > $o] : X11 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',icl_princ) ).

thf(trans_axiom,axiom,
    ! [X20: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ rel @ X20 ) @ ( mbox @ rel @ ( mbox @ rel @ X20 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.34GJE5afvY/E---3.1_1476070.p',trans_axiom) ).

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

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

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

thf(c_0_15,plain,
    ( icl_atom
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X25: $i] :
          ( ( rel @ Z1 @ X25 )
         => ( Z0 @ X25 ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_atom]) ).

thf(c_0_16,plain,
    ( mbox
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X12: $i] :
          ( ( Z0 @ Z2 @ X12 )
         => ( Z1 @ X12 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox]) ).

thf(c_0_17,plain,
    ( icl_impl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X26: $i] :
          ( ( rel @ Z2 @ X26 )
         => ( ~ ( Z0 @ X26 )
            | ( Z1 @ X26 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_impl]) ).

thf(c_0_18,plain,
    ( mimpl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

thf(c_0_19,plain,
    ( icl_says
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X27: $i] :
          ( ( rel @ Z2 @ X27 )
         => ( ( Z0 @ X27 )
            | ( Z1 @ X27 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_says]) ).

thf(c_0_20,plain,
    ( iclval
    = ( ^ [Z0: $i > $o] :
        ! [X28: $i] : ( Z0 @ X28 ) ) ),
    inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).

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

thf(c_0_22,negated_conjecture,
    ~ ( iclval @ ( icl_impl @ ( icl_says @ ( icl_impl @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_atom @ s ) ) @ ( icl_impl @ ( icl_says @ ( icl_princ @ a ) @ ( icl_atom @ s ) ) @ ( icl_says @ ( icl_princ @ b ) @ ( icl_atom @ s ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cuc]) ).

thf(c_0_23,plain,
    ( icl_atom
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X25: $i] :
          ( ( rel @ Z1 @ X25 )
         => ( Z0 @ X25 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).

thf(c_0_24,plain,
    ( icl_princ
    = ( ^ [Z0: $i > $o] : Z0 ) ),
    inference(fof_simplification,[status(thm)],[icl_princ]) ).

thf(c_0_25,plain,
    ( icl_impl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X26: $i] :
          ( ( rel @ Z2 @ X26 )
         => ( ~ ( Z0 @ X26 )
            | ( Z1 @ X26 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).

thf(c_0_26,plain,
    ( icl_says
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X27: $i] :
          ( ( rel @ Z2 @ X27 )
         => ( ( Z0 @ X27 )
            | ( Z1 @ X27 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_14]),c_0_16]) ).

thf(c_0_27,plain,
    ( iclval
    = ( ^ [Z0: $i > $o] :
        ! [X28: $i] : ( Z0 @ X28 ) ) ),
    inference(apply_def,[status(thm)],[c_0_20,c_0_21]) ).

thf(c_0_28,plain,
    ! [X20: $i > $o,X34: $i] :
      ( ~ ! [X31: $i] :
            ( ( rel @ X34 @ X31 )
           => ( X20 @ X31 ) )
      | ! [X33: $i] :
          ( ( rel @ X34 @ X33 )
         => ! [X32: $i] :
              ( ( rel @ X33 @ X32 )
             => ( X20 @ X32 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[trans_axiom,c_0_18]),c_0_16]),c_0_21]) ).

thf(c_0_29,negated_conjecture,
    ~ ! [X44: $i,X43: $i] :
        ( ( rel @ X44 @ X43 )
       => ( ~ ! [X37: $i] :
                ( ( rel @ X43 @ X37 )
               => ( ! [X35: $i] :
                      ( ( rel @ X37 @ X35 )
                     => ( ~ ( a @ X35 )
                        | ( b @ X35 ) ) )
                  | ! [X36: $i] :
                      ( ( rel @ X37 @ X36 )
                     => ( s @ X36 ) ) ) )
          | ! [X42: $i] :
              ( ( rel @ X43 @ X42 )
             => ( ~ ! [X39: $i] :
                      ( ( rel @ X42 @ X39 )
                     => ( ( a @ X39 )
                        | ! [X38: $i] :
                            ( ( rel @ X39 @ X38 )
                           => ( s @ X38 ) ) ) )
                | ! [X41: $i] :
                    ( ( rel @ X42 @ X41 )
                   => ( ( b @ X41 )
                      | ! [X40: $i] :
                          ( ( rel @ X41 @ X40 )
                         => ( s @ X40 ) ) ) ) ) ) ) ),
    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)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).

thf(c_0_30,plain,
    ! [X48: $i > $o,X49: $i,X51: $i,X52: $i] :
      ( ( ( rel @ X49 @ ( esk2_2 @ X48 @ X49 ) )
        | ~ ( rel @ X49 @ X51 )
        | ~ ( rel @ X51 @ X52 )
        | ( X48 @ X52 ) )
      & ( ~ ( X48 @ ( esk2_2 @ X48 @ X49 ) )
        | ~ ( rel @ X49 @ X51 )
        | ~ ( rel @ X51 @ X52 )
        | ( X48 @ X52 ) ) ),
    inference(distribute,[status(thm)],[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_28])])])])])]) ).

thf(c_0_31,negated_conjecture,
    ! [X55: $i,X56: $i,X57: $i,X59: $i,X60: $i] :
      ( ( rel @ esk3_0 @ esk4_0 )
      & ( ~ ( rel @ esk4_0 @ X55 )
        | ~ ( rel @ X55 @ X56 )
        | ~ ( a @ X56 )
        | ( b @ X56 )
        | ~ ( rel @ X55 @ X57 )
        | ( s @ X57 ) )
      & ( rel @ esk4_0 @ esk5_0 )
      & ( ~ ( rel @ esk5_0 @ X59 )
        | ( a @ X59 )
        | ~ ( rel @ X59 @ X60 )
        | ( s @ X60 ) )
      & ( rel @ esk5_0 @ esk6_0 )
      & ~ ( b @ esk6_0 )
      & ( rel @ esk6_0 @ esk7_0 )
      & ~ ( s @ esk7_0 ) ),
    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_29])])])])]) ).

thf(c_0_32,plain,
    ! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ X12 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

thf(c_0_33,negated_conjecture,
    rel @ esk6_0 @ esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_34,plain,
    ! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
      ( ( X2 @ X12 )
      | ~ ( X2 @ ( esk2_2 @ X2 @ X1 ) )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

thf(c_0_35,negated_conjecture,
    ! [X2: $i > $o,X1: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ esk7_0 )
      | ~ ( rel @ X1 @ esk6_0 ) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

thf(c_0_36,negated_conjecture,
    ! [X1: $i,X3: $i,X12: $i] :
      ( ( b @ X3 )
      | ( s @ X12 )
      | ~ ( rel @ esk4_0 @ X1 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( a @ X3 )
      | ~ ( rel @ X1 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_37,negated_conjecture,
    rel @ esk4_0 @ esk5_0,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_38,negated_conjecture,
    ! [X1: $i,X3: $i,X12: $i] :
      ( ( rel @ X1 @ esk7_0 )
      | ( rel @ X1 @ X3 )
      | ~ ( rel @ X1 @ esk6_0 )
      | ~ ( rel @ X12 @ X3 )
      | ~ ( rel @ X1 @ X12 ) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

thf(c_0_39,negated_conjecture,
    ! [X1: $i,X3: $i] :
      ( ( s @ X1 )
      | ( b @ X3 )
      | ~ ( rel @ esk5_0 @ X1 )
      | ~ ( rel @ esk5_0 @ X3 )
      | ~ ( a @ X3 ) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

thf(c_0_40,negated_conjecture,
    ! [X1: $i] :
      ( ( rel @ X1 @ esk7_0 )
      | ~ ( rel @ X1 @ esk6_0 ) ),
    inference(spm,[status(thm)],[c_0_38,c_0_33]) ).

thf(c_0_41,negated_conjecture,
    rel @ esk5_0 @ esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_42,negated_conjecture,
    ~ ( s @ esk7_0 ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_43,negated_conjecture,
    ! [X1: $i,X3: $i] :
      ( ( a @ X1 )
      | ( s @ X3 )
      | ~ ( rel @ esk5_0 @ X1 )
      | ~ ( rel @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_44,negated_conjecture,
    ~ ( b @ esk6_0 ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

thf(c_0_45,negated_conjecture,
    ! [X1: $i] :
      ( ( b @ X1 )
      | ~ ( rel @ esk5_0 @ X1 )
      | ~ ( a @ X1 ) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]),c_0_42]) ).

thf(c_0_46,negated_conjecture,
    a @ esk6_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_33]),c_0_41])]),c_0_42]) ).

thf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_41]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV426^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n004.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 16:01:47 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running higher-order theorem proving
% 0.09/0.23  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/tmp/tmp.34GJE5afvY/E---3.1_1476070.p
% 0.30/0.26  % Version: 3.5.1-ho
% 0.30/0.26  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.30/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.26  % Starting post_as_ho3 with 300s (1) cores
% 0.30/0.26  % Starting post_as_ho11 with 300s (1) cores
% 0.30/0.26  % Starting full_lambda_8 with 300s (1) cores
% 0.30/0.26  % post_as_ho11 with pid 1476085 completed with status 0
% 0.30/0.26  % Result found by post_as_ho11
% 0.30/0.26  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.30/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.26  % Starting post_as_ho3 with 300s (1) cores
% 0.30/0.26  % Starting post_as_ho11 with 300s (1) cores
% 0.30/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26  % No SInE strategy applied
% 0.30/0.26  % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.30/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26  % SubtermCWHack with pid 1476091 completed with status 0
% 0.30/0.26  % Result found by SubtermCWHack
% 0.30/0.26  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.30/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.26  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.30/0.26  % Starting post_as_ho3 with 300s (1) cores
% 0.30/0.26  % Starting post_as_ho11 with 300s (1) cores
% 0.30/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.26  % No SInE strategy applied
% 0.30/0.26  % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.30/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.26  % Preprocessing time       : 0.001 s
% 0.30/0.26  
% 0.30/0.26  % Proof found!
% 0.30/0.26  % SZS status Theorem
% 0.30/0.26  % SZS output start CNFRefutation
% See solution above
% 0.30/0.26  % Parsed axioms                        : 60
% 0.30/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.30/0.26  % Initial clauses                      : 45
% 0.30/0.26  % Removed in clause preprocessing      : 33
% 0.30/0.26  % Initial clauses in saturation        : 12
% 0.30/0.26  % Processed clauses                    : 91
% 0.30/0.26  % ...of these trivial                  : 1
% 0.30/0.26  % ...subsumed                          : 9
% 0.30/0.26  % ...remaining for further processing  : 81
% 0.30/0.26  % Other redundant clauses eliminated   : 0
% 0.30/0.26  % Clauses deleted for lack of memory   : 0
% 0.30/0.26  % Backward-subsumed                    : 4
% 0.30/0.26  % Backward-rewritten                   : 5
% 0.30/0.26  % Generated clauses                    : 555
% 0.30/0.26  % ...of the previous two non-redundant : 526
% 0.30/0.26  % ...aggressively subsumed             : 0
% 0.30/0.26  % Contextual simplify-reflections      : 0
% 0.30/0.26  % Paramodulations                      : 543
% 0.30/0.26  % Factorizations                       : 12
% 0.30/0.26  % NegExts                              : 0
% 0.30/0.26  % Equation resolutions                 : 0
% 0.30/0.26  % Disequality decompositions           : 0
% 0.30/0.26  % Total rewrite steps                  : 67
% 0.30/0.26  % ...of those cached                   : 55
% 0.30/0.26  % Propositional unsat checks           : 0
% 0.30/0.26  %    Propositional check models        : 0
% 0.30/0.26  %    Propositional check unsatisfiable : 0
% 0.30/0.26  %    Propositional clauses             : 0
% 0.30/0.26  %    Propositional clauses after purity: 0
% 0.30/0.26  %    Propositional unsat core size     : 0
% 0.30/0.26  %    Propositional preprocessing time  : 0.000
% 0.30/0.26  %    Propositional encoding time       : 0.000
% 0.30/0.26  %    Propositional solver time         : 0.000
% 0.30/0.26  %    Success case prop preproc time    : 0.000
% 0.30/0.26  %    Success case prop encoding time   : 0.000
% 0.30/0.26  %    Success case prop solver time     : 0.000
% 0.30/0.26  % Current number of processed clauses  : 72
% 0.30/0.26  %    Positive orientable unit clauses  : 8
% 0.30/0.26  %    Positive unorientable unit clauses: 0
% 0.30/0.26  %    Negative unit clauses             : 2
% 0.30/0.26  %    Non-unit-clauses                  : 62
% 0.30/0.26  % Current number of unprocessed clauses: 443
% 0.30/0.26  % ...number of literals in the above   : 2463
% 0.30/0.26  % Current number of archived formulas  : 0
% 0.30/0.26  % Current number of archived clauses   : 9
% 0.30/0.26  % Clause-clause subsumption calls (NU) : 549
% 0.30/0.26  % Rec. Clause-clause subsumption calls : 271
% 0.30/0.26  % Non-unit clause-clause subsumptions  : 12
% 0.30/0.26  % Unit Clause-clause subsumption calls : 26
% 0.30/0.26  % Rewrite failures with RHS unbound    : 0
% 0.30/0.26  % BW rewrite match attempts            : 7
% 0.30/0.26  % BW rewrite match successes           : 2
% 0.30/0.26  % Condensation attempts                : 0
% 0.30/0.26  % Condensation successes               : 0
% 0.30/0.26  % Termbank termtop insertions          : 13609
% 0.30/0.26  % Search garbage collected termcells   : 886
% 0.30/0.26  
% 0.30/0.26  % -------------------------------------------------
% 0.30/0.26  % User time                : 0.012 s
% 0.30/0.26  % System time              : 0.004 s
% 0.30/0.26  % Total time               : 0.016 s
% 0.30/0.26  % Maximum resident set size: 3680 pages
% 0.30/0.26  
% 0.30/0.26  % -------------------------------------------------
% 0.30/0.26  % User time                : 0.014 s
% 0.30/0.26  % System time              : 0.008 s
% 0.30/0.26  % Total time               : 0.023 s
% 0.30/0.26  % Maximum resident set size: 4864 pages
% 0.30/0.26  % E exiting
%------------------------------------------------------------------------------