TSTP Solution File: SEV521+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SEV521+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:35:42 EDT 2023

% Result   : Theorem 10.05s 1.71s
% Output   : CNFRefutation 10.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   54 (   5 unt;   0 def)
%            Number of atoms       :  273 (  36 equ)
%            Maximal formula atoms :  105 (   5 avg)
%            Number of connectives :  309 (  90   ~; 177   |;  32   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   39 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   2 con; 0-3 aty)
%            Number of variables   :   99 (   0 sgn;  30   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(partition,axiom,
    ! [X1,X4] :
      ( partition(X1,X4)
    <=> ( ! [X3] :
            ( member(X3,X1)
           => subset(X3,X4) )
        & ! [X3] :
            ( member(X3,X4)
           => ? [X5] :
                ( member(X5,X1)
                & member(X3,X5) ) )
        & ! [X3,X5] :
            ( ( member(X3,X1)
              & member(X5,X1) )
           => ( ? [X6] :
                  ( member(X6,X3)
                  & member(X6,X5) )
             => X3 = X5 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sulOisKBYJ/E---3.1_11713.p',partition) ).

fof(singleton,axiom,
    ! [X3,X1] :
      ( member(X3,singleton(X1))
    <=> X3 = X1 ),
    file('/export/starexec/sandbox/tmp/tmp.sulOisKBYJ/E---3.1_11713.p',singleton) ).

fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/tmp/tmp.sulOisKBYJ/E---3.1_11713.p',subset) ).

fof(set_partitions_itself,conjecture,
    ! [X4] :
      ( X4 != empty_set
     => partition(singleton(X4),X4) ),
    file('/export/starexec/sandbox/tmp/tmp.sulOisKBYJ/E---3.1_11713.p',set_partitions_itself) ).

fof(c_0_4,plain,
    ! [X12,X13,X14,X15,X17,X18,X19,X20,X21,X24] :
      ( ( ~ member(X14,X12)
        | subset(X14,X13)
        | ~ partition(X12,X13) )
      & ( member(esk2_3(X12,X13,X15),X12)
        | ~ member(X15,X13)
        | ~ partition(X12,X13) )
      & ( member(X15,esk2_3(X12,X13,X15))
        | ~ member(X15,X13)
        | ~ partition(X12,X13) )
      & ( ~ member(X17,X12)
        | ~ member(X18,X12)
        | ~ member(X19,X17)
        | ~ member(X19,X18)
        | X17 = X18
        | ~ partition(X12,X13) )
      & ( member(esk5_2(X20,X21),X20)
        | member(esk4_2(X20,X21),X21)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk6_2(X20,X21),X20)
        | member(esk4_2(X20,X21),X21)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk5_2(X20,X21))
        | member(esk4_2(X20,X21),X21)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk6_2(X20,X21))
        | member(esk4_2(X20,X21),X21)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( esk5_2(X20,X21) != esk6_2(X20,X21)
        | member(esk4_2(X20,X21),X21)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk5_2(X20,X21),X20)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk6_2(X20,X21),X20)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk5_2(X20,X21))
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk6_2(X20,X21))
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( esk5_2(X20,X21) != esk6_2(X20,X21)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | member(esk3_2(X20,X21),X20)
        | partition(X20,X21) )
      & ( member(esk5_2(X20,X21),X20)
        | member(esk4_2(X20,X21),X21)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk6_2(X20,X21),X20)
        | member(esk4_2(X20,X21),X21)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk5_2(X20,X21))
        | member(esk4_2(X20,X21),X21)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk6_2(X20,X21))
        | member(esk4_2(X20,X21),X21)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( esk5_2(X20,X21) != esk6_2(X20,X21)
        | member(esk4_2(X20,X21),X21)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk5_2(X20,X21),X20)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk6_2(X20,X21),X20)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk5_2(X20,X21))
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( member(esk7_2(X20,X21),esk6_2(X20,X21))
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) )
      & ( esk5_2(X20,X21) != esk6_2(X20,X21)
        | ~ member(X24,X20)
        | ~ member(esk4_2(X20,X21),X24)
        | ~ subset(esk3_2(X20,X21),X21)
        | partition(X20,X21) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[partition])])])])])]) ).

fof(c_0_5,plain,
    ! [X28,X29] :
      ( ( ~ member(X28,singleton(X29))
        | X28 = X29 )
      & ( X28 != X29
        | member(X28,singleton(X29)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])]) ).

cnf(c_0_6,plain,
    ( member(esk6_2(X1,X2),X1)
    | member(esk3_2(X1,X2),X1)
    | partition(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( member(esk6_2(X1,X2),X1)
    | member(esk4_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1)
    | partition(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( member(X1,singleton(X2))
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( member(esk5_2(X1,X2),X1)
    | member(esk3_2(X1,X2),X1)
    | partition(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,plain,
    ( member(esk5_2(X1,X2),X1)
    | member(esk4_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1)
    | partition(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,plain,
    ( partition(X1,X2)
    | member(esk6_2(X1,X2),X1)
    | member(esk3_2(X1,X2),X1)
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,plain,
    member(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( partition(X1,X2)
    | member(esk5_2(X1,X2),X1)
    | member(esk3_2(X1,X2),X1)
    | ~ member(X2,X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( X1 = X2
    | ~ member(X1,singleton(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,plain,
    ( partition(singleton(X1),X1)
    | member(esk3_2(singleton(X1),X1),singleton(X1))
    | member(esk6_2(singleton(X1),X1),singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( partition(singleton(X1),X1)
    | member(esk3_2(singleton(X1),X1),singleton(X1))
    | member(esk5_2(singleton(X1),X1),singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_17,plain,
    ( esk6_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | member(esk3_2(singleton(X1),X1),singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    ( esk5_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | member(esk3_2(singleton(X1),X1),singleton(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_19,plain,
    ( member(esk4_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1)
    | partition(X1,X2)
    | esk5_2(X1,X2) != esk6_2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_20,plain,
    ( esk6_2(singleton(X1),X1) = X1
    | esk3_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_21,plain,
    ( esk5_2(singleton(X1),X1) = X1
    | esk3_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_18]) ).

cnf(c_0_22,plain,
    ( member(esk3_2(X1,X2),X1)
    | partition(X1,X2)
    | esk5_2(X1,X2) != esk6_2(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_23,plain,
    ( esk3_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_14]) ).

fof(c_0_24,plain,
    ! [X31,X32,X33,X34,X35] :
      ( ( ~ subset(X31,X32)
        | ~ member(X33,X31)
        | member(X33,X32) )
      & ( member(esk8_2(X34,X35),X34)
        | subset(X34,X35) )
      & ( ~ member(esk8_2(X34,X35),X35)
        | subset(X34,X35) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subset])])])])])]) ).

cnf(c_0_25,plain,
    ( esk3_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | esk6_2(singleton(X1),X1) != esk5_2(singleton(X1),X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]),c_0_14]) ).

cnf(c_0_26,plain,
    ( subset(X1,X2)
    | ~ member(esk8_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_27,plain,
    ( member(esk8_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_28,plain,
    ( member(esk5_2(X1,X2),X1)
    | member(esk4_2(X1,X2),X2)
    | partition(X1,X2)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_29,plain,
    ( esk3_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_21]) ).

cnf(c_0_30,plain,
    subset(X1,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,plain,
    ( partition(singleton(X1),X1)
    | member(esk5_2(singleton(X1),X1),singleton(X1))
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_32,plain,
    ( member(esk6_2(X1,X2),X1)
    | member(esk4_2(X1,X2),X2)
    | partition(X1,X2)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_33,plain,
    ( member(esk5_2(X1,X2),X1)
    | partition(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_34,plain,
    ( esk5_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_31]) ).

cnf(c_0_35,plain,
    ( member(esk4_2(X1,X2),X2)
    | partition(X1,X2)
    | esk5_2(X1,X2) != esk6_2(X1,X2)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_36,plain,
    ( partition(singleton(X1),X1)
    | member(esk6_2(singleton(X1),X1),singleton(X1))
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_30])]) ).

cnf(c_0_37,plain,
    ( esk5_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | ~ subset(esk3_2(singleton(X1),X1),X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_12])]),c_0_14]) ).

cnf(c_0_38,plain,
    ( partition(singleton(X1),X1)
    | member(esk4_2(singleton(X1),X1),X1)
    | esk6_2(singleton(X1),X1) != esk5_2(singleton(X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_30])]) ).

cnf(c_0_39,plain,
    ( esk6_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1)
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_36]) ).

cnf(c_0_40,plain,
    ( esk5_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_29]),c_0_30])]) ).

cnf(c_0_41,plain,
    ( member(esk6_2(X1,X2),X1)
    | partition(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_42,plain,
    ( partition(singleton(X1),X1)
    | member(esk4_2(singleton(X1),X1),X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).

cnf(c_0_43,plain,
    ( partition(X1,X2)
    | esk5_2(X1,X2) != esk6_2(X1,X2)
    | ~ member(X3,X1)
    | ~ member(esk4_2(X1,X2),X3)
    | ~ subset(esk3_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_44,plain,
    ( partition(singleton(X1),X1)
    | member(esk6_2(singleton(X1),X1),singleton(X1))
    | ~ subset(esk3_2(singleton(X1),X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_12])]) ).

fof(c_0_45,negated_conjecture,
    ~ ! [X4] :
        ( X4 != empty_set
       => partition(singleton(X4),X4) ),
    inference(assume_negation,[status(cth)],[set_partitions_itself]) ).

cnf(c_0_46,plain,
    ( partition(singleton(X1),X1)
    | esk6_2(singleton(X1),X1) != esk5_2(singleton(X1),X1)
    | ~ subset(esk3_2(singleton(X1),X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_12])]) ).

cnf(c_0_47,plain,
    ( partition(singleton(X1),X1)
    | member(esk6_2(singleton(X1),X1),singleton(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_29]),c_0_30])]) ).

fof(c_0_48,negated_conjecture,
    ( esk1_0 != empty_set
    & ~ partition(singleton(esk1_0),esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])]) ).

cnf(c_0_49,plain,
    ( partition(singleton(X1),X1)
    | esk6_2(singleton(X1),X1) != esk5_2(singleton(X1),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_29]),c_0_30])]) ).

cnf(c_0_50,plain,
    ( esk6_2(singleton(X1),X1) = X1
    | partition(singleton(X1),X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    ~ partition(singleton(esk1_0),esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_52,plain,
    partition(singleton(X1),X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_40]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SEV521+1 : TPTP v8.1.2. Released v7.3.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n022.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Mon Oct  2 09:46:54 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.44  Running first-order model finding
% 0.17/0.44  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.sulOisKBYJ/E---3.1_11713.p
% 10.05/1.71  # Version: 3.1pre001
% 10.05/1.71  # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.05/1.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.05/1.71  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.05/1.71  # Starting new_bool_3 with 300s (1) cores
% 10.05/1.71  # Starting new_bool_1 with 300s (1) cores
% 10.05/1.71  # Starting sh5l with 300s (1) cores
% 10.05/1.71  # new_bool_1 with pid 11792 completed with status 0
% 10.05/1.71  # Result found by new_bool_1
% 10.05/1.71  # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.05/1.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.05/1.71  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.05/1.71  # Starting new_bool_3 with 300s (1) cores
% 10.05/1.71  # Starting new_bool_1 with 300s (1) cores
% 10.05/1.71  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.05/1.71  # Search class: FGUSF-FFMF32-SFFFFFNN
% 10.05/1.71  # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 10.05/1.71  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.05/1.71  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.05/1.71  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11794 completed with status 0
% 10.05/1.71  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.05/1.71  # Preprocessing class: FSMSSMSSSSSNFFN.
% 10.05/1.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.05/1.71  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.05/1.71  # Starting new_bool_3 with 300s (1) cores
% 10.05/1.71  # Starting new_bool_1 with 300s (1) cores
% 10.05/1.71  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 10.05/1.71  # Search class: FGUSF-FFMF32-SFFFFFNN
% 10.05/1.71  # partial match(1): FGHSF-FFMF32-SFFFFFNN
% 10.05/1.71  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.05/1.71  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 10.05/1.71  # Preprocessing time       : 0.001 s
% 10.05/1.71  # Presaturation interreduction done
% 10.05/1.71  
% 10.05/1.71  # Proof found!
% 10.05/1.71  # SZS status Theorem
% 10.05/1.71  # SZS output start CNFRefutation
% See solution above
% 10.05/1.71  # Parsed axioms                        : 20
% 10.05/1.71  # Removed by relevancy pruning/SinE    : 15
% 10.05/1.71  # Initial clauses                      : 32
% 10.05/1.71  # Removed in clause preprocessing      : 0
% 10.05/1.71  # Initial clauses in saturation        : 32
% 10.05/1.71  # Processed clauses                    : 3950
% 10.05/1.71  # ...of these trivial                  : 13
% 10.05/1.71  # ...subsumed                          : 2569
% 10.05/1.71  # ...remaining for further processing  : 1368
% 10.05/1.71  # Other redundant clauses eliminated   : 7
% 10.05/1.71  # Clauses deleted for lack of memory   : 0
% 10.05/1.71  # Backward-subsumed                    : 391
% 10.05/1.71  # Backward-rewritten                   : 164
% 10.05/1.71  # Generated clauses                    : 44272
% 10.05/1.71  # ...of the previous two non-redundant : 41466
% 10.05/1.71  # ...aggressively subsumed             : 0
% 10.05/1.71  # Contextual simplify-reflections      : 35
% 10.05/1.71  # Paramodulations                      : 44262
% 10.05/1.71  # Factorizations                       : 3
% 10.05/1.71  # NegExts                              : 0
% 10.05/1.71  # Equation resolutions                 : 7
% 10.05/1.71  # Total rewrite steps                  : 10231
% 10.05/1.71  # Propositional unsat checks           : 0
% 10.05/1.71  #    Propositional check models        : 0
% 10.05/1.71  #    Propositional check unsatisfiable : 0
% 10.05/1.71  #    Propositional clauses             : 0
% 10.05/1.71  #    Propositional clauses after purity: 0
% 10.05/1.71  #    Propositional unsat core size     : 0
% 10.05/1.71  #    Propositional preprocessing time  : 0.000
% 10.05/1.71  #    Propositional encoding time       : 0.000
% 10.05/1.71  #    Propositional solver time         : 0.000
% 10.05/1.71  #    Success case prop preproc time    : 0.000
% 10.05/1.71  #    Success case prop encoding time   : 0.000
% 10.05/1.71  #    Success case prop solver time     : 0.000
% 10.05/1.71  # Current number of processed clauses  : 780
% 10.05/1.71  #    Positive orientable unit clauses  : 6
% 10.05/1.71  #    Positive unorientable unit clauses: 0
% 10.05/1.71  #    Negative unit clauses             : 2
% 10.05/1.71  #    Non-unit-clauses                  : 772
% 10.05/1.71  # Current number of unprocessed clauses: 34818
% 10.05/1.71  # ...number of literals in the above   : 229849
% 10.05/1.71  # Current number of archived formulas  : 0
% 10.05/1.71  # Current number of archived clauses   : 587
% 10.05/1.71  # Clause-clause subsumption calls (NU) : 186759
% 10.05/1.71  # Rec. Clause-clause subsumption calls : 22648
% 10.05/1.71  # Non-unit clause-clause subsumptions  : 2363
% 10.05/1.71  # Unit Clause-clause subsumption calls : 801
% 10.05/1.71  # Rewrite failures with RHS unbound    : 0
% 10.05/1.71  # BW rewrite match attempts            : 96
% 10.05/1.71  # BW rewrite match successes           : 31
% 10.05/1.71  # Condensation attempts                : 0
% 10.05/1.71  # Condensation successes               : 0
% 10.05/1.71  # Termbank termtop insertions          : 1516055
% 10.05/1.71  
% 10.05/1.71  # -------------------------------------------------
% 10.05/1.71  # User time                : 1.207 s
% 10.05/1.71  # System time              : 0.024 s
% 10.05/1.71  # Total time               : 1.231 s
% 10.05/1.71  # Maximum resident set size: 1888 pages
% 10.05/1.71  
% 10.05/1.71  # -------------------------------------------------
% 10.05/1.71  # User time                : 1.208 s
% 10.05/1.71  # System time              : 0.024 s
% 10.05/1.71  # Total time               : 1.233 s
% 10.05/1.71  # Maximum resident set size: 1732 pages
% 10.05/1.71  % E---3.1 exiting
%------------------------------------------------------------------------------