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

View Problem - Process Solution

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

% Computer : n027.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:55:55 EDT 2023

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   61 (  29 unt;   0 def)
%            Number of atoms       :  194 (  56 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  233 ( 100   ~; 100   |;  22   &)
%                                         (   3 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   63 (   0 sgn;  31   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mDefQuot,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( X3 = sdtsldt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & X2 = sdtasdt0(X1,X3) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mDefQuot) ).

fof(mDefDiff,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
       => ! [X3] :
            ( X3 = sdtmndt0(X2,X1)
          <=> ( aNaturalNumber0(X3)
              & sdtpldt0(X1,X3) = X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mDefDiff) ).

fof(m__1324_04,hypothesis,
    ( doDivides0(xl,xm)
    & doDivides0(xl,sdtpldt0(xm,xn)) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1324_04) ).

fof(m__1379,hypothesis,
    xq = sdtsldt0(sdtpldt0(xm,xn),xl),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1379) ).

fof(m__1324,hypothesis,
    ( aNaturalNumber0(xl)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xn) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1324) ).

fof(m__1347,hypothesis,
    xl != sz00,
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1347) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mSortsB) ).

fof(m__1395,hypothesis,
    sdtlseqdt0(xp,xq),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1395) ).

fof(m__1422,hypothesis,
    xr = sdtmndt0(xq,xp),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1422) ).

fof(m__1360,hypothesis,
    xp = sdtsldt0(xm,xl),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__1360) ).

fof(mDefDiv,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( doDivides0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & X2 = sdtasdt0(X1,X3) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mDefDiv) ).

fof(m__,conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',m__) ).

fof(mAMDistr,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
        & sdtasdt0(sdtpldt0(X2,X3),X1) = sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mAMDistr) ).

fof(mSortsB_02,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtasdt0(X1,X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.Kn7fPcciqw/E---3.1_21665.p',mSortsB_02) ).

fof(c_0_14,plain,
    ! [X53,X54,X55] :
      ( ( aNaturalNumber0(X55)
        | X55 != sdtsldt0(X54,X53)
        | X53 = sz00
        | ~ doDivides0(X53,X54)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54) )
      & ( X54 = sdtasdt0(X53,X55)
        | X55 != sdtsldt0(X54,X53)
        | X53 = sz00
        | ~ doDivides0(X53,X54)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54) )
      & ( ~ aNaturalNumber0(X55)
        | X54 != sdtasdt0(X53,X55)
        | X55 = sdtsldt0(X54,X53)
        | X53 = sz00
        | ~ doDivides0(X53,X54)
        | ~ aNaturalNumber0(X53)
        | ~ aNaturalNumber0(X54) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])]) ).

fof(c_0_15,plain,
    ! [X68,X69,X70] :
      ( ( aNaturalNumber0(X70)
        | X70 != sdtmndt0(X69,X68)
        | ~ sdtlseqdt0(X68,X69)
        | ~ aNaturalNumber0(X68)
        | ~ aNaturalNumber0(X69) )
      & ( sdtpldt0(X68,X70) = X69
        | X70 != sdtmndt0(X69,X68)
        | ~ sdtlseqdt0(X68,X69)
        | ~ aNaturalNumber0(X68)
        | ~ aNaturalNumber0(X69) )
      & ( ~ aNaturalNumber0(X70)
        | sdtpldt0(X68,X70) != X69
        | X70 = sdtmndt0(X69,X68)
        | ~ sdtlseqdt0(X68,X69)
        | ~ aNaturalNumber0(X68)
        | ~ aNaturalNumber0(X69) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])]) ).

cnf(c_0_16,plain,
    ( aNaturalNumber0(X1)
    | X3 = sz00
    | X1 != sdtsldt0(X2,X3)
    | ~ doDivides0(X3,X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_17,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ sdtlseqdt0(X3,X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_18,plain,
    ( X1 = sz00
    | aNaturalNumber0(sdtsldt0(X2,X1))
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(er,[status(thm)],[c_0_16]) ).

cnf(c_0_19,hypothesis,
    doDivides0(xl,sdtpldt0(xm,xn)),
    inference(split_conjunct,[status(thm)],[m__1324_04]) ).

cnf(c_0_20,hypothesis,
    xq = sdtsldt0(sdtpldt0(xm,xn),xl),
    inference(split_conjunct,[status(thm)],[m__1379]) ).

cnf(c_0_21,hypothesis,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_22,hypothesis,
    xl != sz00,
    inference(split_conjunct,[status(thm)],[m__1347]) ).

fof(c_0_23,plain,
    ! [X4,X5] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | aNaturalNumber0(sdtpldt0(X4,X5)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

cnf(c_0_24,plain,
    ( aNaturalNumber0(sdtmndt0(X1,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_25,hypothesis,
    sdtlseqdt0(xp,xq),
    inference(split_conjunct,[status(thm)],[m__1395]) ).

cnf(c_0_26,hypothesis,
    xr = sdtmndt0(xq,xp),
    inference(split_conjunct,[status(thm)],[m__1422]) ).

cnf(c_0_27,hypothesis,
    doDivides0(xl,xm),
    inference(split_conjunct,[status(thm)],[m__1324_04]) ).

cnf(c_0_28,hypothesis,
    xp = sdtsldt0(xm,xl),
    inference(split_conjunct,[status(thm)],[m__1360]) ).

cnf(c_0_29,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

fof(c_0_30,plain,
    ! [X49,X50,X52] :
      ( ( aNaturalNumber0(esk2_2(X49,X50))
        | ~ doDivides0(X49,X50)
        | ~ aNaturalNumber0(X49)
        | ~ aNaturalNumber0(X50) )
      & ( X50 = sdtasdt0(X49,esk2_2(X49,X50))
        | ~ doDivides0(X49,X50)
        | ~ aNaturalNumber0(X49)
        | ~ aNaturalNumber0(X50) )
      & ( ~ aNaturalNumber0(X52)
        | X50 != sdtasdt0(X49,X52)
        | doDivides0(X49,X50)
        | ~ aNaturalNumber0(X49)
        | ~ aNaturalNumber0(X50) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])]) ).

cnf(c_0_31,plain,
    ( sdtpldt0(X1,X2) = X3
    | X2 != sdtmndt0(X3,X1)
    | ~ sdtlseqdt0(X1,X3)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_32,hypothesis,
    ( aNaturalNumber0(xq)
    | ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).

cnf(c_0_33,plain,
    ( aNaturalNumber0(sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_34,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1324]) ).

cnf(c_0_35,hypothesis,
    ( aNaturalNumber0(xr)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xq) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_36,hypothesis,
    aNaturalNumber0(xp),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_28]),c_0_21]),c_0_29])]),c_0_22]) ).

cnf(c_0_37,plain,
    ( X1 = sdtasdt0(X2,esk2_2(X2,X1))
    | ~ doDivides0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,plain,
    ( aNaturalNumber0(esk2_2(X1,X2))
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_39,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).

fof(c_0_40,plain,
    ! [X12,X13,X14] :
      ( ( sdtasdt0(X12,sdtpldt0(X13,X14)) = sdtpldt0(sdtasdt0(X12,X13),sdtasdt0(X12,X14))
        | ~ aNaturalNumber0(X12)
        | ~ aNaturalNumber0(X13)
        | ~ aNaturalNumber0(X14) )
      & ( sdtasdt0(sdtpldt0(X13,X14),X12) = sdtpldt0(sdtasdt0(X13,X12),sdtasdt0(X14,X12))
        | ~ aNaturalNumber0(X12)
        | ~ aNaturalNumber0(X13)
        | ~ aNaturalNumber0(X14) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAMDistr])])]) ).

cnf(c_0_41,plain,
    ( sdtpldt0(X1,sdtmndt0(X2,X1)) = X2
    | ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_31]) ).

cnf(c_0_42,hypothesis,
    aNaturalNumber0(xq),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_29])]) ).

cnf(c_0_43,hypothesis,
    ( aNaturalNumber0(xr)
    | ~ aNaturalNumber0(xq) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).

cnf(c_0_44,plain,
    ( X1 = sdtasdt0(X2,X3)
    | X2 = sz00
    | X3 != sdtsldt0(X1,X2)
    | ~ doDivides0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_45,plain,
    ! [X30,X31] :
      ( ~ aNaturalNumber0(X30)
      | ~ aNaturalNumber0(X31)
      | aNaturalNumber0(sdtasdt0(X30,X31)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB_02])]) ).

cnf(c_0_46,hypothesis,
    ( sdtasdt0(xl,esk2_2(xl,sdtpldt0(xm,xn))) = sdtpldt0(xm,xn)
    | ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_19]),c_0_21])]) ).

cnf(c_0_47,hypothesis,
    ( aNaturalNumber0(esk2_2(xl,sdtpldt0(xm,xn)))
    | ~ aNaturalNumber0(sdtpldt0(xm,xn)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_19]),c_0_21])]) ).

cnf(c_0_48,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) != sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_49,plain,
    ( sdtasdt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_40]) ).

cnf(c_0_50,hypothesis,
    sdtpldt0(xp,xr) = xq,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_25]),c_0_26]),c_0_42]),c_0_36])]) ).

cnf(c_0_51,hypothesis,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_42])]) ).

cnf(c_0_52,plain,
    ( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
    | X1 = sz00
    | ~ doDivides0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(er,[status(thm)],[c_0_44]) ).

cnf(c_0_53,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_54,hypothesis,
    sdtasdt0(xl,esk2_2(xl,sdtpldt0(xm,xn))) = sdtpldt0(xm,xn),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_34]),c_0_29])]) ).

cnf(c_0_55,hypothesis,
    aNaturalNumber0(esk2_2(xl,sdtpldt0(xm,xn))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_34]),c_0_29])]) ).

cnf(c_0_56,negated_conjecture,
    sdtpldt0(sdtasdt0(xl,xp),xn) != sdtasdt0(xl,xq),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]),c_0_36]),c_0_21])]) ).

cnf(c_0_57,hypothesis,
    sdtasdt0(xl,xp) = xm,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_27]),c_0_28]),c_0_21]),c_0_29])]),c_0_22]) ).

cnf(c_0_58,hypothesis,
    aNaturalNumber0(sdtpldt0(xm,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21])]),c_0_55])]) ).

cnf(c_0_59,negated_conjecture,
    sdtpldt0(xm,xn) != sdtasdt0(xl,xq),
    inference(rw,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_19]),c_0_20]),c_0_21]),c_0_58])]),c_0_22]),c_0_59]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : NUM474+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n027.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 2400
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Oct  2 13:47:45 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  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.Kn7fPcciqw/E---3.1_21665.p
% 0.18/0.48  # Version: 3.1pre001
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # sh5l with pid 21812 completed with status 0
% 0.18/0.48  # Result found by sh5l
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.18/0.48  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 163s (1) cores
% 0.18/0.48  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 21816 completed with status 0
% 0.18/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.18/0.48  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.18/0.48  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 163s (1) cores
% 0.18/0.48  # Preprocessing time       : 0.002 s
% 0.18/0.48  # Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  # Proof found!
% 0.18/0.48  # SZS status Theorem
% 0.18/0.48  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 41
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 2
% 0.18/0.48  # Initial clauses                      : 66
% 0.18/0.48  # Removed in clause preprocessing      : 2
% 0.18/0.48  # Initial clauses in saturation        : 64
% 0.18/0.48  # Processed clauses                    : 238
% 0.18/0.48  # ...of these trivial                  : 2
% 0.18/0.48  # ...subsumed                          : 53
% 0.18/0.48  # ...remaining for further processing  : 182
% 0.18/0.48  # Other redundant clauses eliminated   : 17
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 1
% 0.18/0.48  # Backward-rewritten                   : 15
% 0.18/0.48  # Generated clauses                    : 440
% 0.18/0.48  # ...of the previous two non-redundant : 404
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 6
% 0.18/0.48  # Paramodulations                      : 417
% 0.18/0.48  # Factorizations                       : 2
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 21
% 0.18/0.48  # Total rewrite steps                  : 414
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 98
% 0.18/0.48  #    Positive orientable unit clauses  : 24
% 0.18/0.48  #    Positive unorientable unit clauses: 0
% 0.18/0.48  #    Negative unit clauses             : 5
% 0.18/0.48  #    Non-unit-clauses                  : 69
% 0.18/0.48  # Current number of unprocessed clauses: 289
% 0.18/0.48  # ...number of literals in the above   : 1199
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 75
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 813
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 330
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 58
% 0.18/0.48  # Unit Clause-clause subsumption calls : 53
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 6
% 0.18/0.48  # BW rewrite match successes           : 6
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 10858
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.018 s
% 0.18/0.48  # System time              : 0.006 s
% 0.18/0.48  # Total time               : 0.024 s
% 0.18/0.48  # Maximum resident set size: 1884 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.022 s
% 0.18/0.48  # System time              : 0.006 s
% 0.18/0.48  # Total time               : 0.028 s
% 0.18/0.48  # Maximum resident set size: 1732 pages
% 0.18/0.48  % E---3.1 exiting
% 0.18/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------