TSTP Solution File: NUM595+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : NUM595+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.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 18:56:32 EDT 2023

% Result   : Theorem 3.67s 0.88s
% Output   : CNFRefutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   51 (  12 unt;   0 def)
%            Number of atoms       :  192 (  41 equ)
%            Maximal formula atoms :   39 (   3 avg)
%            Number of connectives :  238 (  97   ~;  96   |;  32   &)
%                                         (   4 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   21 (  21 usr;  12 con; 0-3 aty)
%            Number of variables   :   65 (   1 sgn;  33   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefSel,axiom,
    ! [X1,X2] :
      ( ( aSet0(X1)
        & aElementOf0(X2,szNzAzT0) )
     => ! [X3] :
          ( X3 = slbdtsldtrb0(X1,X2)
        <=> ( aSet0(X3)
            & ! [X4] :
                ( aElementOf0(X4,X3)
              <=> ( aSubsetOf0(X4,X1)
                  & sbrdtbr0(X4) = X2 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',mDefSel) ).

fof(mDefSub,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aSubsetOf0(X2,X1)
        <=> ( aSet0(X2)
            & ! [X3] :
                ( aElementOf0(X3,X2)
               => aElementOf0(X3,X1) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',mDefSub) ).

fof(m__4826,hypothesis,
    ( xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk)
    & xX != slcrc0 ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__4826) ).

fof(m__3533,hypothesis,
    ( aElementOf0(xk,szNzAzT0)
    & szszuzczcdt0(xk) = xK ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__3533) ).

fof(m__3671,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
        & isCountable0(sdtlpdtrp0(xN,X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__3671) ).

fof(mNATSet,axiom,
    ( aSet0(szNzAzT0)
    & isCountable0(szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',mNATSet) ).

fof(mSuccNum,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
        & szszuzczcdt0(X1) != sz00 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',mSuccNum) ).

fof(m__4618,hypothesis,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ? [X2] :
          ( aElementOf0(X2,xT)
          & ! [X3] :
              ( ( aSet0(X3)
                & aElementOf0(X3,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) )
             => sdtlpdtrp0(sdtlpdtrp0(xC,X1),X3) = X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__4618) ).

fof(m__4806,hypothesis,
    ( aElementOf0(xi,szNzAzT0)
    & sdtlpdtrp0(xd,xi) = xx ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__4806) ).

fof(m__4730,hypothesis,
    ( aFunction0(xd)
    & szDzozmdt0(xd) = szNzAzT0
    & ! [X1] :
        ( aElementOf0(X1,szNzAzT0)
       => ! [X2] :
            ( ( aSet0(X2)
              & aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) )
           => sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__4730) ).

fof(mDefEmp,axiom,
    ! [X1] :
      ( X1 = slcrc0
    <=> ( aSet0(X1)
        & ~ ? [X2] : aElementOf0(X2,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',mDefEmp) ).

fof(m__,conjecture,
    aElementOf0(xx,xT),
    file('/export/starexec/sandbox2/tmp/tmp.ps1YCGiKnU/E---3.1_17437.p',m__) ).

fof(c_0_12,plain,
    ! [X112,X113,X114,X115,X116,X117] :
      ( ( aSet0(X114)
        | X114 != slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( aSubsetOf0(X115,X112)
        | ~ aElementOf0(X115,X114)
        | X114 != slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( sbrdtbr0(X115) = X113
        | ~ aElementOf0(X115,X114)
        | X114 != slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( ~ aSubsetOf0(X116,X112)
        | sbrdtbr0(X116) != X113
        | aElementOf0(X116,X114)
        | X114 != slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( ~ aElementOf0(esk11_3(X112,X113,X117),X117)
        | ~ aSubsetOf0(esk11_3(X112,X113,X117),X112)
        | sbrdtbr0(esk11_3(X112,X113,X117)) != X113
        | ~ aSet0(X117)
        | X117 = slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( aSubsetOf0(esk11_3(X112,X113,X117),X112)
        | aElementOf0(esk11_3(X112,X113,X117),X117)
        | ~ aSet0(X117)
        | X117 = slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) )
      & ( sbrdtbr0(esk11_3(X112,X113,X117)) = X113
        | aElementOf0(esk11_3(X112,X113,X117),X117)
        | ~ aSet0(X117)
        | X117 = slbdtsldtrb0(X112,X113)
        | ~ aSet0(X112)
        | ~ aElementOf0(X113,szNzAzT0) ) ),
    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)],[mDefSel])])])])])]) ).

cnf(c_0_13,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aElementOf0(X1,X3)
    | X3 != slbdtsldtrb0(X2,X4)
    | ~ aSet0(X2)
    | ~ aElementOf0(X4,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_14,plain,
    ! [X15,X16,X17,X18] :
      ( ( aSet0(X16)
        | ~ aSubsetOf0(X16,X15)
        | ~ aSet0(X15) )
      & ( ~ aElementOf0(X17,X16)
        | aElementOf0(X17,X15)
        | ~ aSubsetOf0(X16,X15)
        | ~ aSet0(X15) )
      & ( aElementOf0(esk2_2(X15,X18),X18)
        | ~ aSet0(X18)
        | aSubsetOf0(X18,X15)
        | ~ aSet0(X15) )
      & ( ~ aElementOf0(esk2_2(X15,X18),X15)
        | ~ aSet0(X18)
        | aSubsetOf0(X18,X15)
        | ~ aSet0(X15) ) ),
    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)],[mDefSub])])])])])]) ).

cnf(c_0_15,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
    | ~ aElementOf0(X3,szNzAzT0)
    | ~ aSet0(X2) ),
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_16,hypothesis,
    xX = slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(xi)),xk),
    inference(split_conjunct,[status(thm)],[m__4826]) ).

cnf(c_0_17,hypothesis,
    aElementOf0(xk,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__3533]) ).

fof(c_0_18,hypothesis,
    ! [X175] :
      ( ( aSubsetOf0(sdtlpdtrp0(xN,X175),szNzAzT0)
        | ~ aElementOf0(X175,szNzAzT0) )
      & ( isCountable0(sdtlpdtrp0(xN,X175))
        | ~ aElementOf0(X175,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3671])])]) ).

cnf(c_0_19,plain,
    ( aSet0(X1)
    | ~ aSubsetOf0(X1,X2)
    | ~ aSet0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,hypothesis,
    ( aSubsetOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xi)))
    | ~ aElementOf0(X1,xX)
    | ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_21,hypothesis,
    ( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_22,plain,
    aSet0(szNzAzT0),
    inference(split_conjunct,[status(thm)],[mNATSet]) ).

cnf(c_0_23,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,xX)
    | ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi))) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,hypothesis,
    ( aSet0(sdtlpdtrp0(xN,X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_21]),c_0_22])]) ).

fof(c_0_25,plain,
    ! [X54] :
      ( ( aElementOf0(szszuzczcdt0(X54),szNzAzT0)
        | ~ aElementOf0(X54,szNzAzT0) )
      & ( szszuzczcdt0(X54) != sz00
        | ~ aElementOf0(X54,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).

cnf(c_0_26,plain,
    ( aSet0(X1)
    | X1 != slbdtsldtrb0(X2,X3)
    | ~ aSet0(X2)
    | ~ aElementOf0(X3,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_27,hypothesis,
    ! [X192,X194] :
      ( ( aElementOf0(esk24_1(X192),xT)
        | ~ aElementOf0(X192,szNzAzT0) )
      & ( ~ aSet0(X194)
        | ~ aElementOf0(X194,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X192)),xk))
        | sdtlpdtrp0(sdtlpdtrp0(xC,X192),X194) = esk24_1(X192)
        | ~ aElementOf0(X192,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4618])])])])]) ).

cnf(c_0_28,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(szszuzczcdt0(xi),szNzAzT0)
    | ~ aElementOf0(X1,xX) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_30,hypothesis,
    aElementOf0(xi,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__4806]) ).

fof(c_0_31,hypothesis,
    ! [X196,X197] :
      ( aFunction0(xd)
      & szDzozmdt0(xd) = szNzAzT0
      & ( ~ aElementOf0(X196,szNzAzT0)
        | ~ aSet0(X197)
        | ~ aElementOf0(X197,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X196)),xk))
        | sdtlpdtrp0(xd,X196) = sdtlpdtrp0(sdtlpdtrp0(xC,X196),X197) ) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4730])])]) ).

cnf(c_0_32,plain,
    ( aSet0(slbdtsldtrb0(X1,X2))
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aSet0(X1) ),
    inference(er,[status(thm)],[c_0_26]) ).

cnf(c_0_33,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1) = esk24_1(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X1,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X2)),xk))
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_34,hypothesis,
    ( aSet0(X1)
    | ~ aElementOf0(X1,xX) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_35,hypothesis,
    ( sdtlpdtrp0(xd,X1) = sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSet0(X2)
    | ~ aElementOf0(X2,slbdtsldtrb0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),xk)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_36,hypothesis,
    sdtlpdtrp0(xd,xi) = xx,
    inference(split_conjunct,[status(thm)],[m__4806]) ).

cnf(c_0_37,hypothesis,
    ( aSet0(xX)
    | ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xi))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_17])]) ).

cnf(c_0_38,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = esk24_1(xi)
    | ~ aElementOf0(X1,xX) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_16]),c_0_30])]),c_0_34]) ).

cnf(c_0_39,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,xi),X1) = xx
    | ~ aElementOf0(X1,xX) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_16]),c_0_36]),c_0_30])]),c_0_34]) ).

fof(c_0_40,plain,
    ! [X9,X10,X11] :
      ( ( aSet0(X9)
        | X9 != slcrc0 )
      & ( ~ aElementOf0(X10,X9)
        | X9 != slcrc0 )
      & ( ~ aSet0(X11)
        | aElementOf0(esk1_1(X11),X11)
        | X11 = slcrc0 ) ),
    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)],[mDefEmp])])])])])]) ).

cnf(c_0_41,hypothesis,
    ( aSet0(xX)
    | ~ aElementOf0(szszuzczcdt0(xi),szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_24]) ).

cnf(c_0_42,hypothesis,
    ( esk24_1(xi) = xx
    | ~ aElementOf0(X1,xX) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,plain,
    ( aElementOf0(esk1_1(X1),X1)
    | X1 = slcrc0
    | ~ aSet0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_44,hypothesis,
    aSet0(xX),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_29]),c_0_30])]) ).

cnf(c_0_45,hypothesis,
    xX != slcrc0,
    inference(split_conjunct,[status(thm)],[m__4826]) ).

fof(c_0_46,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

cnf(c_0_47,hypothesis,
    ( aElementOf0(esk24_1(X1),xT)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_48,hypothesis,
    esk24_1(xi) = xx,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).

cnf(c_0_49,negated_conjecture,
    ~ aElementOf0(xx,xT),
    inference(split_conjunct,[status(thm)],[c_0_46]) ).

cnf(c_0_50,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_30])]),c_0_49]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : NUM595+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n011.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.33  % CPULimit   : 2400
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Oct  2 15:01:23 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.17/0.43  Running first-order theorem proving
% 0.17/0.43  Running: /export/starexec/sandbox2/solver/bin/eprover --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.ps1YCGiKnU/E---3.1_17437.p
% 3.67/0.88  # Version: 3.1pre001
% 3.67/0.88  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.67/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/0.88  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.67/0.88  # Starting new_bool_3 with 300s (1) cores
% 3.67/0.88  # Starting new_bool_1 with 300s (1) cores
% 3.67/0.88  # Starting sh5l with 300s (1) cores
% 3.67/0.88  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17515 completed with status 0
% 3.67/0.88  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.67/0.88  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.67/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/0.88  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.67/0.88  # No SInE strategy applied
% 3.67/0.88  # Search class: FGHSF-FSLM31-MFFFFFNN
% 3.67/0.88  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.67/0.88  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 3.67/0.88  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.67/0.88  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 3.67/0.88  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 3.67/0.88  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 3.67/0.88  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17522 completed with status 0
% 3.67/0.88  # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 3.67/0.88  # Preprocessing class: FSLSSMSMSSSNFFN.
% 3.67/0.88  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.67/0.88  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 3.67/0.88  # No SInE strategy applied
% 3.67/0.88  # Search class: FGHSF-FSLM31-MFFFFFNN
% 3.67/0.88  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 3.67/0.88  # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 3.67/0.88  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 3.67/0.88  # Preprocessing time       : 0.003 s
% 3.67/0.88  # Presaturation interreduction done
% 3.67/0.88  
% 3.67/0.88  # Proof found!
% 3.67/0.88  # SZS status Theorem
% 3.67/0.88  # SZS output start CNFRefutation
% See solution above
% 3.67/0.88  # Parsed axioms                        : 97
% 3.67/0.88  # Removed by relevancy pruning/SinE    : 0
% 3.67/0.88  # Initial clauses                      : 196
% 3.67/0.88  # Removed in clause preprocessing      : 7
% 3.67/0.88  # Initial clauses in saturation        : 189
% 3.67/0.88  # Processed clauses                    : 3517
% 3.67/0.88  # ...of these trivial                  : 46
% 3.67/0.88  # ...subsumed                          : 1980
% 3.67/0.88  # ...remaining for further processing  : 1491
% 3.67/0.88  # Other redundant clauses eliminated   : 75
% 3.67/0.88  # Clauses deleted for lack of memory   : 0
% 3.67/0.88  # Backward-subsumed                    : 102
% 3.67/0.88  # Backward-rewritten                   : 18
% 3.67/0.88  # Generated clauses                    : 13509
% 3.67/0.88  # ...of the previous two non-redundant : 12169
% 3.67/0.88  # ...aggressively subsumed             : 0
% 3.67/0.88  # Contextual simplify-reflections      : 192
% 3.67/0.88  # Paramodulations                      : 13436
% 3.67/0.88  # Factorizations                       : 0
% 3.67/0.88  # NegExts                              : 0
% 3.67/0.88  # Equation resolutions                 : 78
% 3.67/0.88  # Total rewrite steps                  : 8299
% 3.67/0.88  # Propositional unsat checks           : 0
% 3.67/0.88  #    Propositional check models        : 0
% 3.67/0.88  #    Propositional check unsatisfiable : 0
% 3.67/0.88  #    Propositional clauses             : 0
% 3.67/0.88  #    Propositional clauses after purity: 0
% 3.67/0.88  #    Propositional unsat core size     : 0
% 3.67/0.88  #    Propositional preprocessing time  : 0.000
% 3.67/0.88  #    Propositional encoding time       : 0.000
% 3.67/0.88  #    Propositional solver time         : 0.000
% 3.67/0.88  #    Success case prop preproc time    : 0.000
% 3.67/0.88  #    Success case prop encoding time   : 0.000
% 3.67/0.88  #    Success case prop solver time     : 0.000
% 3.67/0.88  # Current number of processed clauses  : 1143
% 3.67/0.88  #    Positive orientable unit clauses  : 99
% 3.67/0.88  #    Positive unorientable unit clauses: 0
% 3.67/0.88  #    Negative unit clauses             : 21
% 3.67/0.88  #    Non-unit-clauses                  : 1023
% 3.67/0.88  # Current number of unprocessed clauses: 8793
% 3.67/0.88  # ...number of literals in the above   : 54321
% 3.67/0.88  # Current number of archived formulas  : 0
% 3.67/0.88  # Current number of archived clauses   : 308
% 3.67/0.88  # Clause-clause subsumption calls (NU) : 179041
% 3.67/0.88  # Rec. Clause-clause subsumption calls : 54218
% 3.67/0.88  # Non-unit clause-clause subsumptions  : 1759
% 3.67/0.88  # Unit Clause-clause subsumption calls : 5469
% 3.67/0.88  # Rewrite failures with RHS unbound    : 0
% 3.67/0.88  # BW rewrite match attempts            : 20
% 3.67/0.88  # BW rewrite match successes           : 17
% 3.67/0.88  # Condensation attempts                : 0
% 3.67/0.88  # Condensation successes               : 0
% 3.67/0.88  # Termbank termtop insertions          : 267250
% 3.67/0.88  
% 3.67/0.88  # -------------------------------------------------
% 3.67/0.88  # User time                : 0.410 s
% 3.67/0.88  # System time              : 0.015 s
% 3.67/0.88  # Total time               : 0.425 s
% 3.67/0.88  # Maximum resident set size: 2440 pages
% 3.67/0.88  
% 3.67/0.88  # -------------------------------------------------
% 3.67/0.88  # User time                : 2.032 s
% 3.67/0.88  # System time              : 0.072 s
% 3.67/0.88  # Total time               : 2.104 s
% 3.67/0.88  # Maximum resident set size: 1804 pages
% 3.67/0.88  % E---3.1 exiting
% 3.67/0.88  % E---3.1 exiting
%------------------------------------------------------------------------------