TSTP Solution File: SEU674^2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU674^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 03:29:02 EDT 2024

% Result   : Theorem 0.09s 0.33s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   50 (  17 unt;  20 typ;   0 def)
%            Number of atoms       :  154 (  26 equ;   0 cnn)
%            Maximal formula atoms :   21 (   5 avg)
%            Number of connectives :  578 (  24   ~;  24   |;  21   &; 487   @)
%                                         (   2 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   35 (  35   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   22 (  20 usr;   7 con; 0-4 aty)
%            Number of variables   :  131 (  71   ^  51   !;   9   ?; 131   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    in: $i > $i > $o ).

thf(decl_23,type,
    emptyset: $i ).

thf(decl_24,type,
    setadjoin: $i > $i > $i ).

thf(decl_25,type,
    setunion: $i > $i ).

thf(decl_26,type,
    dsetconstr: $i > ( $i > $o ) > $i ).

thf(decl_27,type,
    subset: $i > $i > $o ).

thf(decl_28,type,
    kpair: $i > $i > $i ).

thf(decl_29,type,
    cartprod: $i > $i > $i ).

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

thf(decl_31,type,
    ex1: $i > ( $i > $o ) > $o ).

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

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

thf(decl_34,type,
    apProp: $o ).

thf(decl_35,type,
    ap: $i > $i > $i > $i > $i ).

thf(decl_36,type,
    esk1_3: $i > $i > $i > $i ).

thf(decl_37,type,
    esk2_0: $i ).

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

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

thf(decl_40,type,
    esk5_1: $i > $i ).

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

thf(ex1,axiom,
    ( ex1
    = ( ^ [X1: $i,X3: $i > $o] :
          ( singleton
          @ ( dsetconstr @ X1
            @ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ex1) ).

thf(singleton,axiom,
    ( singleton
    = ( ^ [X1: $i] :
        ? [X2: $i] :
          ( ( in @ X2 @ X1 )
          & ( X1
            = ( setadjoin @ X2 @ emptyset ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).

thf(func,axiom,
    ( func
    = ( ^ [X1: $i,X4: $i,X6: $i] :
          ( ( breln @ X1 @ X4 @ X6 )
          & ! [X2: $i] :
              ( ( in @ X2 @ X1 )
             => ( ex1 @ X4
                @ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X6 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',func) ).

thf(breln,axiom,
    ( breln
    = ( ^ [X1: $i,X4: $i,X5: $i] : ( subset @ X5 @ ( cartprod @ X1 @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln) ).

thf(apProp,axiom,
    ( apProp
  <=> ! [X1: $i,X4: $i,X8: $i] :
        ( ( func @ X1 @ X4 @ X8 )
       => ! [X2: $i] :
            ( ( in @ X2 @ X1 )
           => ( in
              @ ( setunion
                @ ( dsetconstr @ X4
                  @ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X8 ) ) )
              @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apProp) ).

thf(ap,axiom,
    ( ap
    = ( ^ [X1: $i,X4: $i,X8: $i,X2: $i] :
          ( setunion
          @ ( dsetconstr @ X4
            @ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X8 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap) ).

thf(app,conjecture,
    ( apProp
   => ! [X1: $i,X4: $i,X8: $i] :
        ( ( func @ X1 @ X4 @ X8 )
       => ! [X2: $i] :
            ( ( in @ X2 @ X1 )
           => ( in @ ( ap @ X1 @ X4 @ X8 @ X2 ) @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',app) ).

thf(c_0_7,plain,
    ( ex1
    = ( ^ [Z0: $i,Z1: $i > $o] :
        ? [X17: $i] :
          ( ( in @ X17
            @ ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
          & ( ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) )
            = ( setadjoin @ X17 @ emptyset ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[ex1]) ).

thf(c_0_8,plain,
    ( singleton
    = ( ^ [Z0: $i] :
        ? [X2: $i] :
          ( ( in @ X2 @ Z0 )
          & ( Z0
            = ( setadjoin @ X2 @ emptyset ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[singleton]) ).

thf(c_0_9,plain,
    ( func
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
          & ! [X2: $i] :
              ( ( in @ X2 @ Z0 )
             => ? [X18: $i] :
                  ( ( in @ X18
                    @ ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
                  & ( ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
                    = ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[func]) ).

thf(c_0_10,plain,
    ( breln
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[breln]) ).

thf(c_0_11,plain,
    ( ex1
    = ( ^ [Z0: $i,Z1: $i > $o] :
        ? [X17: $i] :
          ( ( in @ X17
            @ ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
          & ( ( dsetconstr @ Z0
              @ ^ [Z2: $i] : ( Z1 @ Z2 ) )
            = ( setadjoin @ X17 @ emptyset ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_12,plain,
    ( apProp
  <=> ! [X1: $i,X4: $i,X8: $i] :
        ( ( func @ X1 @ X4 @ X8 )
       => ! [X2: $i] :
            ( ( in @ X2 @ X1 )
           => ( in
              @ ( setunion
                @ ( dsetconstr @ X4
                  @ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
              @ X4 ) ) ) ),
    inference(fof_simplification,[status(thm)],[apProp]) ).

thf(c_0_13,plain,
    ( func
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] :
          ( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
          & ! [X2: $i] :
              ( ( in @ X2 @ Z0 )
             => ? [X18: $i] :
                  ( ( in @ X18
                    @ ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
                  & ( ( dsetconstr @ Z1
                      @ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
                    = ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

thf(c_0_14,plain,
    ( ap
    = ( ^ [Z0: $i,Z1: $i,Z2: $i,Z3: $i] :
          ( setunion
          @ ( dsetconstr @ Z1
            @ ^ [Z4: $i] : ( in @ ( kpair @ Z3 @ Z4 ) @ Z2 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[ap]) ).

thf(c_0_15,plain,
    ( apProp
    = ( ! [X1: $i,X4: $i,X8: $i] :
          ( ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
            & ! [X19: $i] :
                ( ( in @ X19 @ X1 )
               => ? [X20: $i] :
                    ( ( in @ X20
                      @ ( dsetconstr @ X4
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X19 @ Z0 ) @ X8 ) ) )
                    & ( ( dsetconstr @ X4
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X19 @ Z0 ) @ X8 ) )
                      = ( setadjoin @ X20 @ emptyset ) ) ) ) )
         => ! [X2: $i] :
              ( ( in @ X2 @ X1 )
             => ( in
                @ ( setunion
                  @ ( dsetconstr @ X4
                    @ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
                @ X4 ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_16,negated_conjecture,
    ~ ( ! [X21: $i,X22: $i,X23: $i] :
          ( ( ( subset @ X23 @ ( cartprod @ X21 @ X22 ) )
            & ! [X24: $i] :
                ( ( in @ X24 @ X21 )
               => ? [X25: $i] :
                    ( ( in @ X25
                      @ ( dsetconstr @ X22
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X23 ) ) )
                    & ( ( dsetconstr @ X22
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X23 ) )
                      = ( setadjoin @ X25 @ emptyset ) ) ) ) )
         => ! [X26: $i] :
              ( ( in @ X26 @ X21 )
             => ( in
                @ ( setunion
                  @ ( dsetconstr @ X22
                    @ ^ [Z0: $i] : ( in @ ( kpair @ X26 @ Z0 ) @ X23 ) ) )
                @ X22 ) ) )
     => ! [X1: $i,X4: $i,X8: $i] :
          ( ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
            & ! [X27: $i] :
                ( ( in @ X27 @ X1 )
               => ? [X28: $i] :
                    ( ( in @ X28
                      @ ( dsetconstr @ X4
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X27 @ Z0 ) @ X8 ) ) )
                    & ( ( dsetconstr @ X4
                        @ ^ [Z0: $i] : ( in @ ( kpair @ X27 @ Z0 ) @ X8 ) )
                      = ( setadjoin @ X28 @ emptyset ) ) ) ) )
         => ! [X2: $i] :
              ( ( in @ X2 @ X1 )
             => ( in
                @ ( setunion
                  @ ( dsetconstr @ X4
                    @ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
                @ X4 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[app]),c_0_14]),c_0_15]),c_0_13]) ).

thf(c_0_17,negated_conjecture,
    ! [X29: $i,X30: $i,X31: $i,X33: $i,X34: $i,X38: $i] :
      ( ( ( in @ ( esk1_3 @ X29 @ X30 @ X31 ) @ X29 )
        | ~ ( subset @ X31 @ ( cartprod @ X29 @ X30 ) )
        | ~ ( in @ X34 @ X29 )
        | ( in
          @ ( setunion
            @ ( dsetconstr @ X30
              @ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X31 ) ) )
          @ X30 ) )
      & ( ~ ( in @ X33
            @ ( dsetconstr @ X30
              @ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X29 @ X30 @ X31 ) @ Z0 ) @ X31 ) ) )
        | ( ( dsetconstr @ X30
            @ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X29 @ X30 @ X31 ) @ Z0 ) @ X31 ) )
         != ( setadjoin @ X33 @ emptyset ) )
        | ~ ( subset @ X31 @ ( cartprod @ X29 @ X30 ) )
        | ~ ( in @ X34 @ X29 )
        | ( in
          @ ( setunion
            @ ( dsetconstr @ X30
              @ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X31 ) ) )
          @ X30 ) )
      & ( subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk3_0 ) )
      & ( ( in @ ( esk5_1 @ X38 )
          @ ( dsetconstr @ esk3_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ X38 @ Z0 ) @ esk4_0 ) ) )
        | ~ ( in @ X38 @ esk2_0 ) )
      & ( ( ( dsetconstr @ esk3_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ X38 @ Z0 ) @ esk4_0 ) )
          = ( setadjoin @ ( esk5_1 @ X38 ) @ emptyset ) )
        | ~ ( in @ X38 @ esk2_0 ) )
      & ( in @ esk6_0 @ esk2_0 )
      & ~ ( in
          @ ( setunion
            @ ( dsetconstr @ esk3_0
              @ ^ [Z0: $i] : ( in @ ( kpair @ esk6_0 @ Z0 ) @ esk4_0 ) ) )
          @ esk3_0 ) ),
    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_16])])])])])]) ).

thf(c_0_18,negated_conjecture,
    ! [X2: $i,X5: $i,X4: $i,X1: $i] :
      ( ( in @ ( esk1_3 @ X1 @ X2 @ X4 ) @ X1 )
      | ( in
        @ ( setunion
          @ ( dsetconstr @ X2
            @ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X4 ) ) )
        @ X2 )
      | ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( in @ X5 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_19,negated_conjecture,
    subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_20,negated_conjecture,
    ! [X1: $i,X2: $i,X5: $i,X6: $i,X4: $i] :
      ( ( in
        @ ( setunion
          @ ( dsetconstr @ X2
            @ ^ [Z0: $i] : ( in @ ( kpair @ X6 @ Z0 ) @ X5 ) ) )
        @ X2 )
      | ~ ( in @ X1
          @ ( dsetconstr @ X2
            @ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) ) )
      | ( ( dsetconstr @ X2
          @ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) )
       != ( setadjoin @ X1 @ emptyset ) )
      | ~ ( subset @ X5 @ ( cartprod @ X4 @ X2 ) )
      | ~ ( in @ X6 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_21,negated_conjecture,
    ! [X1: $i] :
      ( ( in @ ( esk5_1 @ X1 )
        @ ( dsetconstr @ esk3_0
          @ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
      | ~ ( in @ X1 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_22,negated_conjecture,
    ! [X1: $i] :
      ( ( ( dsetconstr @ esk3_0
          @ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) )
        = ( setadjoin @ ( esk5_1 @ X1 ) @ emptyset ) )
      | ~ ( in @ X1 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_23,negated_conjecture,
    ~ ( in
      @ ( setunion
        @ ( dsetconstr @ esk3_0
          @ ^ [Z0: $i] : ( in @ ( kpair @ esk6_0 @ Z0 ) @ esk4_0 ) ) )
      @ esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_24,negated_conjecture,
    ! [X1: $i] :
      ( ( in
        @ ( setunion
          @ ( dsetconstr @ esk3_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
        @ esk3_0 )
      | ( in @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk2_0 )
      | ~ ( in @ X1 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_25,negated_conjecture,
    in @ esk6_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

thf(c_0_26,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( in
        @ ( setunion
          @ ( dsetconstr @ esk3_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
        @ esk3_0 )
      | ~ ( in @ ( esk1_3 @ X2 @ esk3_0 @ esk4_0 ) @ esk2_0 )
      | ~ ( subset @ esk4_0 @ ( cartprod @ X2 @ esk3_0 ) )
      | ~ ( in @ X1 @ X2 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

thf(c_0_27,negated_conjecture,
    in @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

thf(c_0_28,negated_conjecture,
    ! [X1: $i] :
      ( ( in
        @ ( setunion
          @ ( dsetconstr @ esk3_0
            @ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
        @ esk3_0 )
      | ~ ( in @ X1 @ esk2_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_27])]) ).

thf(c_0_29,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_28]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : SEU674^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.07  % Command    : run_E %s %d THM
% 0.06/0.25  % Computer : n010.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit   : 300
% 0.06/0.25  % WCLimit    : 300
% 0.06/0.25  % DateTime   : Sun May 19 16:15:52 EDT 2024
% 0.06/0.25  % CPUTime    : 
% 0.09/0.32  Running higher-order theorem proving
% 0.09/0.32  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
% 0.09/0.33  # Version: 3.1.0-ho
% 0.09/0.33  # partial match(1): HSSSSMSSSLMNHSN
% 0.09/0.33  # Preprocessing class: HSSSSMSSSLMNHFN.
% 0.09/0.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.33  # Starting ho_unfolding_6 with 1500s (5) cores
% 0.09/0.33  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.09/0.33  # Starting sh2l with 300s (1) cores
% 0.09/0.33  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.09/0.33  # ehoh_best_sine_rwall with pid 24007 completed with status 0
% 0.09/0.33  # Result found by ehoh_best_sine_rwall
% 0.09/0.33  # partial match(1): HSSSSMSSSLMNHSN
% 0.09/0.33  # Preprocessing class: HSSSSMSSSLMNHFN.
% 0.09/0.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.33  # Starting ho_unfolding_6 with 1500s (5) cores
% 0.09/0.33  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.09/0.33  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.33  # Search class: HGUSF-FFSF31-MHFFMFNN
% 0.09/0.33  # partial match(1): HGUSF-FFSF32-MHFFMFNN
% 0.09/0.33  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.33  # Starting new_ho_10 with 163s (1) cores
% 0.09/0.33  # new_ho_10 with pid 24010 completed with status 0
% 0.09/0.33  # Result found by new_ho_10
% 0.09/0.33  # partial match(1): HSSSSMSSSLMNHSN
% 0.09/0.33  # Preprocessing class: HSSSSMSSSLMNHFN.
% 0.09/0.33  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.33  # Starting ho_unfolding_6 with 1500s (5) cores
% 0.09/0.33  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.09/0.33  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.09/0.33  # Search class: HGUSF-FFSF31-MHFFMFNN
% 0.09/0.33  # partial match(1): HGUSF-FFSF32-MHFFMFNN
% 0.09/0.33  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.33  # Starting new_ho_10 with 163s (1) cores
% 0.09/0.33  # Preprocessing time       : 0.001 s
% 0.09/0.33  # Presaturation interreduction done
% 0.09/0.33  
% 0.09/0.33  # Proof found!
% 0.09/0.33  # SZS status Theorem
% 0.09/0.33  # SZS output start CNFRefutation
% See solution above
% 0.09/0.33  # Parsed axioms                        : 21
% 0.09/0.33  # Removed by relevancy pruning/SinE    : 14
% 0.09/0.33  # Initial clauses                      : 7
% 0.09/0.33  # Removed in clause preprocessing      : 0
% 0.09/0.33  # Initial clauses in saturation        : 7
% 0.09/0.33  # Processed clauses                    : 18
% 0.09/0.33  # ...of these trivial                  : 0
% 0.09/0.33  # ...subsumed                          : 0
% 0.09/0.33  # ...remaining for further processing  : 18
% 0.09/0.33  # Other redundant clauses eliminated   : 0
% 0.09/0.33  # Clauses deleted for lack of memory   : 0
% 0.09/0.33  # Backward-subsumed                    : 0
% 0.09/0.33  # Backward-rewritten                   : 1
% 0.09/0.33  # Generated clauses                    : 5
% 0.09/0.33  # ...of the previous two non-redundant : 4
% 0.09/0.33  # ...aggressively subsumed             : 0
% 0.09/0.33  # Contextual simplify-reflections      : 1
% 0.09/0.33  # Paramodulations                      : 5
% 0.09/0.33  # Factorizations                       : 0
% 0.09/0.33  # NegExts                              : 0
% 0.09/0.33  # Equation resolutions                 : 0
% 0.09/0.33  # Disequality decompositions           : 0
% 0.09/0.33  # Total rewrite steps                  : 4
% 0.09/0.33  # ...of those cached                   : 2
% 0.09/0.33  # Propositional unsat checks           : 0
% 0.09/0.33  #    Propositional check models        : 0
% 0.09/0.33  #    Propositional check unsatisfiable : 0
% 0.09/0.33  #    Propositional clauses             : 0
% 0.09/0.33  #    Propositional clauses after purity: 0
% 0.09/0.33  #    Propositional unsat core size     : 0
% 0.09/0.33  #    Propositional preprocessing time  : 0.000
% 0.09/0.33  #    Propositional encoding time       : 0.000
% 0.09/0.33  #    Propositional solver time         : 0.000
% 0.09/0.33  #    Success case prop preproc time    : 0.000
% 0.09/0.33  #    Success case prop encoding time   : 0.000
% 0.09/0.33  #    Success case prop solver time     : 0.000
% 0.09/0.33  # Current number of processed clauses  : 10
% 0.09/0.33  #    Positive orientable unit clauses  : 3
% 0.09/0.33  #    Positive unorientable unit clauses: 0
% 0.09/0.33  #    Negative unit clauses             : 1
% 0.09/0.33  #    Non-unit-clauses                  : 6
% 0.09/0.33  # Current number of unprocessed clauses: 0
% 0.09/0.33  # ...number of literals in the above   : 0
% 0.09/0.33  # Current number of archived formulas  : 0
% 0.09/0.33  # Current number of archived clauses   : 8
% 0.09/0.33  # Clause-clause subsumption calls (NU) : 7
% 0.09/0.33  # Rec. Clause-clause subsumption calls : 2
% 0.09/0.33  # Non-unit clause-clause subsumptions  : 1
% 0.09/0.33  # Unit Clause-clause subsumption calls : 0
% 0.09/0.33  # Rewrite failures with RHS unbound    : 0
% 0.09/0.33  # BW rewrite match attempts            : 1
% 0.09/0.33  # BW rewrite match successes           : 1
% 0.09/0.33  # Condensation attempts                : 18
% 0.09/0.33  # Condensation successes               : 0
% 0.09/0.33  # Termbank termtop insertions          : 1912
% 0.09/0.33  # Search garbage collected termcells   : 464
% 0.09/0.33  
% 0.09/0.33  # -------------------------------------------------
% 0.09/0.33  # User time                : 0.002 s
% 0.09/0.33  # System time              : 0.002 s
% 0.09/0.33  # Total time               : 0.004 s
% 0.09/0.33  # Maximum resident set size: 1856 pages
% 0.09/0.33  
% 0.09/0.33  # -------------------------------------------------
% 0.09/0.33  # User time                : 0.003 s
% 0.09/0.33  # System time              : 0.003 s
% 0.09/0.33  # Total time               : 0.006 s
% 0.09/0.33  # Maximum resident set size: 1732 pages
% 0.09/0.33  % E---3.1 exiting
% 0.09/0.33  % E exiting
%------------------------------------------------------------------------------