TSTP Solution File: NUN071+2 by E---3.1

View Problem - Process Solution

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

% Computer : n024.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:09:10 EDT 2023

% Result   : Theorem 0.12s 0.43s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   79 (  44 unt;   0 def)
%            Number of atoms       :  195 (  69 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  183 (  67   ~;  52   |;  64   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   17 (  17 usr;   1 con; 0-2 aty)
%            Number of variables   :  166 (  14 sgn;  44   !;  31   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
    ? [X1] :
    ! [X2] :
      ( ( ~ r1(X2)
        & X2 != X1 )
      | ( r1(X2)
        & X2 = X1 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_1) ).

fof(axiom_5a,axiom,
    ! [X33] :
    ? [X34] :
      ( ? [X35] :
          ( r1(X35)
          & r4(X33,X35,X34) )
      & ? [X36] :
          ( r1(X36)
          & X34 = X36 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_5a) ).

fof(axiom_4a,axiom,
    ! [X30] :
    ? [X31] :
      ( ? [X32] :
          ( r1(X32)
          & r3(X30,X32,X31) )
      & X31 = X30 ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_4a) ).

fof(axiom_4,axiom,
    ! [X10,X11] :
    ? [X12] :
    ! [X13] :
      ( ( ~ r4(X10,X11,X13)
        & X13 != X12 )
      | ( r4(X10,X11,X13)
        & X13 = X12 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_4) ).

fof(axiom_3,axiom,
    ! [X6,X7] :
    ? [X8] :
    ! [X9] :
      ( ( ~ r3(X6,X7,X9)
        & X9 != X8 )
      | ( r3(X6,X7,X9)
        & X9 = X8 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_3) ).

fof(axiom_2,axiom,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( ~ r2(X3,X5)
        & X5 != X4 )
      | ( r2(X3,X5)
        & X5 = X4 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_2) ).

fof(axiom_2a,axiom,
    ! [X20,X21] :
    ? [X22] :
      ( ? [X23] :
          ( ? [X24] :
              ( r2(X21,X24)
              & r4(X20,X24,X23) )
          & X23 = X22 )
      & ? [X25] :
          ( r3(X25,X20,X22)
          & r4(X20,X21,X25) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_2a) ).

fof(axiom_1a,axiom,
    ! [X14,X15] :
    ? [X16] :
      ( ? [X17] :
          ( ? [X18] :
              ( r2(X15,X18)
              & r3(X14,X18,X17) )
          & X17 = X16 )
      & ? [X19] :
          ( r2(X19,X16)
          & r3(X14,X15,X19) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',axiom_1a) ).

fof(onetimesoneeqone,conjecture,
    ? [X39] :
      ( ? [X22] :
          ( r4(X22,X22,X39)
          & ? [X16] :
              ( r1(X16)
              & r2(X16,X22) ) )
      & ? [X23] :
          ( X39 = X23
          & ? [X17] :
              ( r1(X17)
              & r2(X17,X23) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.jPLPsLfa0l/E---3.1_15861.p',onetimesoneeqone) ).

fof(c_0_9,plain,
    ? [X1] :
    ! [X2] :
      ( ( ~ r1(X2)
        & X2 != X1 )
      | ( r1(X2)
        & X2 = X1 ) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

fof(c_0_10,plain,
    ! [X76] :
      ( r1(esk16_1(X76))
      & r4(X76,esk16_1(X76),esk15_1(X76))
      & r1(esk17_1(X76))
      & esk15_1(X76) = esk17_1(X76) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).

fof(c_0_11,plain,
    ! [X45] :
      ( ( r1(X45)
        | ~ r1(X45) )
      & ( X45 = esk1_0
        | ~ r1(X45) )
      & ( r1(X45)
        | X45 != esk1_0 )
      & ( X45 = esk1_0
        | X45 != esk1_0 ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_9])])]) ).

cnf(c_0_12,plain,
    r1(esk17_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_13,plain,
    esk15_1(X1) = esk17_1(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,plain,
    ! [X73] :
      ( r1(esk14_1(X73))
      & r3(X73,esk14_1(X73),esk13_1(X73))
      & esk13_1(X73) = X73 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).

fof(c_0_15,plain,
    ! [X10,X11] :
    ? [X12] :
    ! [X13] :
      ( ( ~ r4(X10,X11,X13)
        & X13 != X12 )
      | ( r4(X10,X11,X13)
        & X13 = X12 ) ),
    inference(fof_simplification,[status(thm)],[axiom_4]) ).

cnf(c_0_16,plain,
    ( X1 = esk1_0
    | ~ r1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    r1(esk16_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    r1(esk15_1(X1)),
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_19,plain,
    ! [X6,X7] :
    ? [X8] :
    ! [X9] :
      ( ( ~ r3(X6,X7,X9)
        & X9 != X8 )
      | ( r3(X6,X7,X9)
        & X9 = X8 ) ),
    inference(fof_simplification,[status(thm)],[axiom_3]) ).

cnf(c_0_20,plain,
    r3(X1,esk14_1(X1),esk13_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    esk13_1(X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    r1(esk14_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_23,plain,
    ! [X3] :
    ? [X4] :
    ! [X5] :
      ( ( ~ r2(X3,X5)
        & X5 != X4 )
      | ( r2(X3,X5)
        & X5 = X4 ) ),
    inference(fof_simplification,[status(thm)],[axiom_2]) ).

fof(c_0_24,plain,
    ! [X53,X54,X56] :
      ( ( r4(X53,X54,X56)
        | ~ r4(X53,X54,X56) )
      & ( X56 = esk4_2(X53,X54)
        | ~ r4(X53,X54,X56) )
      & ( r4(X53,X54,X56)
        | X56 != esk4_2(X53,X54) )
      & ( X56 = esk4_2(X53,X54)
        | X56 != esk4_2(X53,X54) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_15])])]) ).

cnf(c_0_25,plain,
    r4(X1,esk16_1(X1),esk15_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,plain,
    esk16_1(X1) = esk1_0,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_27,plain,
    esk15_1(X1) = esk1_0,
    inference(spm,[status(thm)],[c_0_16,c_0_18]) ).

fof(c_0_28,plain,
    ! [X63,X64] :
      ( r2(X64,esk11_2(X63,X64))
      & r4(X63,esk11_2(X63,X64),esk10_2(X63,X64))
      & esk10_2(X63,X64) = esk9_2(X63,X64)
      & r3(esk12_2(X63,X64),X63,esk9_2(X63,X64))
      & r4(X63,X64,esk12_2(X63,X64)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_2a])]) ).

fof(c_0_29,plain,
    ! [X49,X50,X52] :
      ( ( r3(X49,X50,X52)
        | ~ r3(X49,X50,X52) )
      & ( X52 = esk3_2(X49,X50)
        | ~ r3(X49,X50,X52) )
      & ( r3(X49,X50,X52)
        | X52 != esk3_2(X49,X50) )
      & ( X52 = esk3_2(X49,X50)
        | X52 != esk3_2(X49,X50) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_19])])]) ).

cnf(c_0_30,plain,
    r3(X1,esk14_1(X1),X1),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_31,plain,
    esk14_1(X1) = esk1_0,
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

fof(c_0_32,plain,
    ! [X57,X58] :
      ( r2(X58,esk7_2(X57,X58))
      & r3(X57,esk7_2(X57,X58),esk6_2(X57,X58))
      & esk6_2(X57,X58) = esk5_2(X57,X58)
      & r2(esk8_2(X57,X58),esk5_2(X57,X58))
      & r3(X57,X58,esk8_2(X57,X58)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).

fof(c_0_33,negated_conjecture,
    ~ ? [X39] :
        ( ? [X22] :
            ( r4(X22,X22,X39)
            & ? [X16] :
                ( r1(X16)
                & r2(X16,X22) ) )
        & ? [X23] :
            ( X39 = X23
            & ? [X17] :
                ( r1(X17)
                & r2(X17,X23) ) ) ),
    inference(assume_negation,[status(cth)],[onetimesoneeqone]) ).

fof(c_0_34,plain,
    ! [X46,X48] :
      ( ( r2(X46,X48)
        | ~ r2(X46,X48) )
      & ( X48 = esk2_1(X46)
        | ~ r2(X46,X48) )
      & ( r2(X46,X48)
        | X48 != esk2_1(X46) )
      & ( X48 = esk2_1(X46)
        | X48 != esk2_1(X46) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])])]) ).

cnf(c_0_35,plain,
    ( X1 = esk4_2(X2,X3)
    | ~ r4(X2,X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_36,plain,
    r4(X1,esk1_0,esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_37,plain,
    r4(X1,X2,esk12_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_38,plain,
    ( X1 = esk3_2(X2,X3)
    | ~ r3(X2,X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_39,plain,
    r3(X1,esk1_0,X1),
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_40,plain,
    r3(X1,X2,esk8_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

fof(c_0_41,negated_conjecture,
    ! [X87,X88,X89,X90,X91] :
      ( ~ r4(X88,X88,X87)
      | ~ r1(X89)
      | ~ r2(X89,X88)
      | X87 != X90
      | ~ r1(X91)
      | ~ r2(X91,X90) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).

cnf(c_0_42,plain,
    r4(X1,esk11_2(X1,X2),esk10_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_43,plain,
    esk10_2(X1,X2) = esk9_2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_44,plain,
    ( X1 = esk2_1(X2)
    | ~ r2(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_45,plain,
    r2(X1,esk11_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_46,plain,
    esk4_2(X1,esk1_0) = esk1_0,
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_47,plain,
    esk4_2(X1,X2) = esk12_2(X1,X2),
    inference(spm,[status(thm)],[c_0_35,c_0_37]) ).

cnf(c_0_48,plain,
    r3(X1,esk7_2(X1,X2),esk6_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_49,plain,
    esk6_2(X1,X2) = esk5_2(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_50,plain,
    r2(X1,esk7_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_51,plain,
    esk3_2(X1,esk1_0) = X1,
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_52,plain,
    esk3_2(X1,X2) = esk8_2(X1,X2),
    inference(spm,[status(thm)],[c_0_38,c_0_40]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ r4(X1,X1,X2)
    | ~ r1(X3)
    | ~ r2(X3,X1)
    | X2 != X4
    | ~ r1(X5)
    | ~ r2(X5,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

cnf(c_0_54,plain,
    r4(X1,esk11_2(X1,X2),esk9_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_55,plain,
    esk11_2(X1,X2) = esk2_1(X2),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_56,plain,
    r3(esk12_2(X1,X2),X1,esk9_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_57,plain,
    esk12_2(X1,esk1_0) = esk1_0,
    inference(rw,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_58,plain,
    r3(X1,esk7_2(X1,X2),esk5_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_59,plain,
    esk7_2(X1,X2) = esk2_1(X2),
    inference(spm,[status(thm)],[c_0_44,c_0_50]) ).

cnf(c_0_60,plain,
    r2(esk8_2(X1,X2),esk5_2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_61,plain,
    esk8_2(X1,esk1_0) = X1,
    inference(rw,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_62,negated_conjecture,
    ( ~ r4(X1,X1,X2)
    | ~ r2(X3,X2)
    | ~ r2(X4,X1)
    | ~ r1(X3)
    | ~ r1(X4) ),
    inference(er,[status(thm)],[c_0_53]) ).

cnf(c_0_63,plain,
    r4(X1,esk2_1(X2),esk9_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_64,plain,
    ( X1 = esk8_2(X2,X3)
    | ~ r3(X2,X3,X1) ),
    inference(rw,[status(thm)],[c_0_38,c_0_52]) ).

cnf(c_0_65,plain,
    r3(esk1_0,X1,esk9_2(X1,esk1_0)),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_66,plain,
    r3(X1,esk2_1(X2),esk5_2(X1,X2)),
    inference(rw,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_67,plain,
    r2(X1,esk5_2(X1,esk1_0)),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_68,negated_conjecture,
    ( ~ r2(X1,esk9_2(esk2_1(X2),X2))
    | ~ r2(X3,esk2_1(X2))
    | ~ r1(X1)
    | ~ r1(X3) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_69,plain,
    esk9_2(X1,esk1_0) = esk8_2(esk1_0,X1),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_70,plain,
    esk8_2(X1,esk2_1(X2)) = esk5_2(X1,X2),
    inference(spm,[status(thm)],[c_0_64,c_0_66]) ).

cnf(c_0_71,plain,
    esk5_2(X1,esk1_0) = esk2_1(X1),
    inference(spm,[status(thm)],[c_0_44,c_0_67]) ).

cnf(c_0_72,plain,
    ( r2(X1,X2)
    | X2 != esk2_1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_73,plain,
    ( r1(X1)
    | X1 != esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_74,negated_conjecture,
    ( ~ r2(X1,esk2_1(esk1_0))
    | ~ r2(X2,esk2_1(esk1_0))
    | ~ r1(X1)
    | ~ r1(X2) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),c_0_71]) ).

cnf(c_0_75,plain,
    r2(X1,esk2_1(X1)),
    inference(er,[status(thm)],[c_0_72]) ).

cnf(c_0_76,plain,
    r1(esk1_0),
    inference(er,[status(thm)],[c_0_73]) ).

cnf(c_0_77,negated_conjecture,
    ( ~ r2(X1,esk2_1(esk1_0))
    | ~ r1(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).

cnf(c_0_78,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_75]),c_0_76])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : NUN071+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.09  % Command    : run_E %s %d THM
% 0.08/0.27  % Computer : n024.cluster.edu
% 0.08/0.27  % Model    : x86_64 x86_64
% 0.08/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27  % Memory   : 8042.1875MB
% 0.08/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27  % CPULimit   : 2400
% 0.08/0.27  % WCLimit    : 300
% 0.08/0.27  % DateTime   : Mon Oct  2 20:45:12 EDT 2023
% 0.08/0.28  % CPUTime    : 
% 0.12/0.41  Running first-order theorem proving
% 0.12/0.41  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.jPLPsLfa0l/E---3.1_15861.p
% 0.12/0.43  # Version: 3.1pre001
% 0.12/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.12/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.12/0.43  # Starting sh5l with 300s (1) cores
% 0.12/0.43  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16017 completed with status 0
% 0.12/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43  # No SInE strategy applied
% 0.12/0.43  # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.12/0.43  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.43  # Starting new_bool_3 with 136s (1) cores
% 0.12/0.43  # Starting new_bool_1 with 136s (1) cores
% 0.12/0.43  # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.43  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 16022 completed with status 0
% 0.12/0.43  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.43  # No SInE strategy applied
% 0.12/0.43  # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.12/0.43  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.12/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.43  # Preprocessing time       : 0.001 s
% 0.12/0.43  # Presaturation interreduction done
% 0.12/0.43  
% 0.12/0.43  # Proof found!
% 0.12/0.43  # SZS status Theorem
% 0.12/0.43  # SZS output start CNFRefutation
% See solution above
% 0.12/0.43  # Parsed axioms                        : 12
% 0.12/0.43  # Removed by relevancy pruning/SinE    : 0
% 0.12/0.43  # Initial clauses                      : 40
% 0.12/0.43  # Removed in clause preprocessing      : 12
% 0.12/0.43  # Initial clauses in saturation        : 28
% 0.12/0.43  # Processed clauses                    : 136
% 0.12/0.43  # ...of these trivial                  : 0
% 0.12/0.43  # ...subsumed                          : 24
% 0.12/0.43  # ...remaining for further processing  : 112
% 0.12/0.43  # Other redundant clauses eliminated   : 7
% 0.12/0.43  # Clauses deleted for lack of memory   : 0
% 0.12/0.43  # Backward-subsumed                    : 1
% 0.12/0.43  # Backward-rewritten                   : 20
% 0.12/0.43  # Generated clauses                    : 139
% 0.12/0.43  # ...of the previous two non-redundant : 134
% 0.12/0.43  # ...aggressively subsumed             : 0
% 0.12/0.43  # Contextual simplify-reflections      : 1
% 0.12/0.43  # Paramodulations                      : 132
% 0.12/0.43  # Factorizations                       : 0
% 0.12/0.43  # NegExts                              : 0
% 0.12/0.43  # Equation resolutions                 : 7
% 0.12/0.43  # Total rewrite steps                  : 54
% 0.12/0.43  # Propositional unsat checks           : 0
% 0.12/0.43  #    Propositional check models        : 0
% 0.12/0.43  #    Propositional check unsatisfiable : 0
% 0.12/0.43  #    Propositional clauses             : 0
% 0.12/0.43  #    Propositional clauses after purity: 0
% 0.12/0.43  #    Propositional unsat core size     : 0
% 0.12/0.43  #    Propositional preprocessing time  : 0.000
% 0.12/0.43  #    Propositional encoding time       : 0.000
% 0.12/0.43  #    Propositional solver time         : 0.000
% 0.12/0.43  #    Success case prop preproc time    : 0.000
% 0.12/0.43  #    Success case prop encoding time   : 0.000
% 0.12/0.43  #    Success case prop solver time     : 0.000
% 0.12/0.43  # Current number of processed clauses  : 56
% 0.12/0.43  #    Positive orientable unit clauses  : 24
% 0.12/0.43  #    Positive unorientable unit clauses: 0
% 0.12/0.43  #    Negative unit clauses             : 2
% 0.12/0.43  #    Non-unit-clauses                  : 30
% 0.12/0.43  # Current number of unprocessed clauses: 50
% 0.12/0.43  # ...number of literals in the above   : 121
% 0.12/0.43  # Current number of archived formulas  : 0
% 0.12/0.43  # Current number of archived clauses   : 53
% 0.12/0.43  # Clause-clause subsumption calls (NU) : 422
% 0.12/0.43  # Rec. Clause-clause subsumption calls : 229
% 0.12/0.43  # Non-unit clause-clause subsumptions  : 21
% 0.12/0.43  # Unit Clause-clause subsumption calls : 38
% 0.12/0.43  # Rewrite failures with RHS unbound    : 0
% 0.12/0.43  # BW rewrite match attempts            : 31
% 0.12/0.43  # BW rewrite match successes           : 19
% 0.12/0.43  # Condensation attempts                : 0
% 0.12/0.43  # Condensation successes               : 0
% 0.12/0.43  # Termbank termtop insertions          : 2768
% 0.12/0.43  
% 0.12/0.43  # -------------------------------------------------
% 0.12/0.43  # User time                : 0.011 s
% 0.12/0.43  # System time              : 0.002 s
% 0.12/0.43  # Total time               : 0.013 s
% 0.12/0.43  # Maximum resident set size: 1820 pages
% 0.12/0.43  
% 0.12/0.43  # -------------------------------------------------
% 0.12/0.43  # User time                : 0.043 s
% 0.12/0.43  # System time              : 0.010 s
% 0.12/0.43  # Total time               : 0.052 s
% 0.12/0.43  # Maximum resident set size: 1716 pages
% 0.12/0.43  % E---3.1 exiting
% 0.12/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------