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

View Problem - Process Solution

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

% Computer : n023.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:56 EDT 2023

% Result   : Theorem 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   55 (  27 unt;   0 def)
%            Number of atoms       :  173 (  51 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  206 (  88   ~;  90   |;  18   &)
%                                         (   3 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    3 (   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   :   55 (   0 sgn;  25   !;   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.64g4GrLuH2/E---3.1_25018.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.64g4GrLuH2/E---3.1_25018.p',mDefDiff) ).

fof(mDefLE,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & sdtpldt0(X1,X3) = X2 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.64g4GrLuH2/E---3.1_25018.p',mDefLE) ).

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

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

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

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

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

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

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

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

fof(m__1459,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    file('/export/starexec/sandbox2/tmp/tmp.64g4GrLuH2/E---3.1_25018.p',m__1459) ).

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

fof(m__,conjecture,
    xn = sdtasdt0(xl,xr),
    file('/export/starexec/sandbox2/tmp/tmp.64g4GrLuH2/E---3.1_25018.p',m__) ).

fof(c_0_14,plain,
    ! [X48,X49,X50] :
      ( ( aNaturalNumber0(X50)
        | X50 != sdtsldt0(X49,X48)
        | X48 = sz00
        | ~ doDivides0(X48,X49)
        | ~ aNaturalNumber0(X48)
        | ~ aNaturalNumber0(X49) )
      & ( X49 = sdtasdt0(X48,X50)
        | X50 != sdtsldt0(X49,X48)
        | X48 = sz00
        | ~ doDivides0(X48,X49)
        | ~ aNaturalNumber0(X48)
        | ~ aNaturalNumber0(X49) )
      & ( ~ aNaturalNumber0(X50)
        | X49 != sdtasdt0(X48,X50)
        | X50 = sdtsldt0(X49,X48)
        | X48 = sz00
        | ~ doDivides0(X48,X49)
        | ~ aNaturalNumber0(X48)
        | ~ aNaturalNumber0(X49) ) ),
    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,
    ! [X59,X60,X61] :
      ( ( aNaturalNumber0(X61)
        | X61 != sdtmndt0(X60,X59)
        | ~ sdtlseqdt0(X59,X60)
        | ~ aNaturalNumber0(X59)
        | ~ aNaturalNumber0(X60) )
      & ( sdtpldt0(X59,X61) = X60
        | X61 != sdtmndt0(X60,X59)
        | ~ sdtlseqdt0(X59,X60)
        | ~ aNaturalNumber0(X59)
        | ~ aNaturalNumber0(X60) )
      & ( ~ aNaturalNumber0(X61)
        | sdtpldt0(X59,X61) != X60
        | X61 = sdtmndt0(X60,X59)
        | ~ sdtlseqdt0(X59,X60)
        | ~ aNaturalNumber0(X59)
        | ~ aNaturalNumber0(X60) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiff])])])]) ).

fof(c_0_16,plain,
    ! [X30,X31,X33] :
      ( ( aNaturalNumber0(esk2_2(X30,X31))
        | ~ sdtlseqdt0(X30,X31)
        | ~ aNaturalNumber0(X30)
        | ~ aNaturalNumber0(X31) )
      & ( sdtpldt0(X30,esk2_2(X30,X31)) = X31
        | ~ sdtlseqdt0(X30,X31)
        | ~ aNaturalNumber0(X30)
        | ~ aNaturalNumber0(X31) )
      & ( ~ aNaturalNumber0(X33)
        | sdtpldt0(X30,X33) != X31
        | sdtlseqdt0(X30,X31)
        | ~ aNaturalNumber0(X30)
        | ~ aNaturalNumber0(X31) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefLE])])])])]) ).

fof(c_0_17,plain,
    ! [X14,X15] :
      ( ~ aNaturalNumber0(X14)
      | ~ aNaturalNumber0(X15)
      | aNaturalNumber0(sdtpldt0(X14,X15)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).

cnf(c_0_18,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]) ).

cnf(c_0_19,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_20,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_21,plain,
    ( sdtlseqdt0(X2,X3)
    | ~ aNaturalNumber0(X1)
    | sdtpldt0(X2,X1) != X3
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c_0_36,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_22]) ).

cnf(c_0_37,hypothesis,
    sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr)) = sdtpldt0(sdtasdt0(xl,xp),xn),
    inference(split_conjunct,[status(thm)],[m__1459]) ).

cnf(c_0_38,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_23,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).

cnf(c_0_39,hypothesis,
    ( aNaturalNumber0(xr)
    | ~ aNaturalNumber0(xp)
    | ~ aNaturalNumber0(xq) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_40,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_32,c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]) ).

cnf(c_0_41,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_32,c_0_33]),c_0_34]),c_0_26])]),c_0_28]) ).

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

cnf(c_0_43,plain,
    ( sdtmndt0(sdtpldt0(X1,X2),X1) = X2
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_22]),c_0_36]) ).

cnf(c_0_44,hypothesis,
    sdtpldt0(xm,sdtasdt0(xl,xr)) = sdtpldt0(xm,xn),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).

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

cnf(c_0_46,hypothesis,
    ( aNaturalNumber0(xr)
    | ~ aNaturalNumber0(xq) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_47,hypothesis,
    aNaturalNumber0(xq),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_22]),c_0_42]),c_0_27])]) ).

cnf(c_0_48,hypothesis,
    ( sdtmndt0(sdtpldt0(xm,xn),xm) = sdtasdt0(xl,xr)
    | ~ aNaturalNumber0(sdtasdt0(xl,xr)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_27])]) ).

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

cnf(c_0_50,hypothesis,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).

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

cnf(c_0_52,hypothesis,
    sdtmndt0(sdtpldt0(xm,xn),xm) = sdtasdt0(xl,xr),
    inference(cn,[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_26])]) ).

cnf(c_0_53,negated_conjecture,
    xn != sdtasdt0(xl,xr),
    inference(split_conjunct,[status(thm)],[c_0_51]) ).

cnf(c_0_54,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_52]),c_0_27]),c_0_42])]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : NUM475+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n023.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:50:22 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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.64g4GrLuH2/E---3.1_25018.p
% 0.19/0.49  # Version: 3.1pre001
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # new_bool_1 with pid 25098 completed with status 0
% 0.19/0.49  # Result found by new_bool_1
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.19/0.49  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 25101 completed with status 0
% 0.19/0.49  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.19/0.49  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGUSF-FFMM22-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Theorem
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 42
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 5
% 0.19/0.49  # Initial clauses                      : 61
% 0.19/0.49  # Removed in clause preprocessing      : 1
% 0.19/0.49  # Initial clauses in saturation        : 60
% 0.19/0.49  # Processed clauses                    : 245
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 65
% 0.19/0.49  # ...remaining for further processing  : 180
% 0.19/0.49  # Other redundant clauses eliminated   : 13
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 2
% 0.19/0.49  # Backward-rewritten                   : 14
% 0.19/0.49  # Generated clauses                    : 400
% 0.19/0.49  # ...of the previous two non-redundant : 375
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 7
% 0.19/0.49  # Paramodulations                      : 381
% 0.19/0.49  # Factorizations                       : 2
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 17
% 0.19/0.49  # Total rewrite steps                  : 372
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 100
% 0.19/0.49  #    Positive orientable unit clauses  : 23
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 2
% 0.19/0.49  #    Non-unit-clauses                  : 75
% 0.19/0.49  # Current number of unprocessed clauses: 242
% 0.19/0.49  # ...number of literals in the above   : 1037
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 71
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 973
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 451
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 73
% 0.19/0.49  # Unit Clause-clause subsumption calls : 27
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 7
% 0.19/0.49  # BW rewrite match successes           : 7
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 10385
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.019 s
% 0.19/0.49  # System time              : 0.001 s
% 0.19/0.49  # Total time               : 0.020 s
% 0.19/0.49  # Maximum resident set size: 1872 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.020 s
% 0.19/0.49  # System time              : 0.004 s
% 0.19/0.49  # Total time               : 0.024 s
% 0.19/0.49  # Maximum resident set size: 1732 pages
% 0.19/0.49  % E---3.1 exiting
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------