TSTP Solution File: NUM460+1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n004.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 01:14:04 EDT 2024

% Result   : Theorem 1.23s 0.64s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   50 (  21 unt;   0 def)
%            Number of atoms       :  139 (  36 equ)
%            Maximal formula atoms :   13 (   2 avg)
%            Number of connectives :  154 (  65   ~;  63   |;  17   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   55 (   0 sgn  25   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( sdtlseqdt0(xm,xn)
      & sdtlseqdt0(xn,xl) )
   => sdtlseqdt0(xm,xl) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mDefLE,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( sdtlseqdt0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & sdtpldt0(X1,X3) = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefLE) ).

fof(mSortsB,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => aNaturalNumber0(sdtpldt0(X1,X2)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsB) ).

fof(mAddComm,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddComm) ).

fof(mAddCanc,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => ( ( sdtpldt0(X1,X2) = sdtpldt0(X1,X3)
          | sdtpldt0(X2,X1) = sdtpldt0(X3,X1) )
       => X2 = X3 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddCanc) ).

fof(m__773,hypothesis,
    ( aNaturalNumber0(xm)
    & aNaturalNumber0(xn)
    & aNaturalNumber0(xl) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__773) ).

fof(mAddAsso,axiom,
    ! [X1,X2,X3] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2)
        & aNaturalNumber0(X3) )
     => sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mAddAsso) ).

fof(c_0_7,negated_conjecture,
    ~ ( ( sdtlseqdt0(xm,xn)
        & sdtlseqdt0(xn,xl) )
     => sdtlseqdt0(xm,xl) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_8,plain,
    ! [X5,X6,X8] :
      ( ( aNaturalNumber0(esk1_2(X5,X6))
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( sdtpldt0(X5,esk1_2(X5,X6)) = X6
        | ~ sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) )
      & ( ~ aNaturalNumber0(X8)
        | sdtpldt0(X5,X8) != X6
        | sdtlseqdt0(X5,X6)
        | ~ aNaturalNumber0(X5)
        | ~ aNaturalNumber0(X6) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_9,plain,
    ! [X12,X13] :
      ( ~ aNaturalNumber0(X12)
      | ~ aNaturalNumber0(X13)
      | aNaturalNumber0(sdtpldt0(X12,X13)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])])]) ).

fof(c_0_10,negated_conjecture,
    ( sdtlseqdt0(xm,xn)
    & sdtlseqdt0(xn,xl)
    & ~ sdtlseqdt0(xm,xl) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).

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

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

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

fof(c_0_14,plain,
    ! [X23,X24,X25] :
      ( ( sdtpldt0(X23,X24) != sdtpldt0(X23,X25)
        | X24 = X25
        | ~ aNaturalNumber0(X23)
        | ~ aNaturalNumber0(X24)
        | ~ aNaturalNumber0(X25) )
      & ( sdtpldt0(X24,X23) != sdtpldt0(X25,X23)
        | X24 = X25
        | ~ aNaturalNumber0(X23)
        | ~ aNaturalNumber0(X24)
        | ~ aNaturalNumber0(X25) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddCanc])])])]) ).

cnf(c_0_15,plain,
    ( sdtpldt0(X1,esk1_2(X1,X2)) = X2
    | ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    sdtlseqdt0(xm,xn),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__773]) ).

cnf(c_0_18,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__773]) ).

cnf(c_0_19,plain,
    ( aNaturalNumber0(esk1_2(X1,X2))
    | ~ sdtlseqdt0(X1,X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_20,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X1,X2))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]) ).

cnf(c_0_21,plain,
    ( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    ( X1 = X3
    | sdtpldt0(X1,X2) != sdtpldt0(X3,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    sdtpldt0(xm,esk1_2(xm,xn)) = xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_24,negated_conjecture,
    aNaturalNumber0(esk1_2(xm,xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_25,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X2,X1))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    sdtlseqdt0(xn,xl),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_27,hypothesis,
    aNaturalNumber0(xl),
    inference(split_conjunct,[status(thm)],[m__773]) ).

cnf(c_0_28,negated_conjecture,
    ( X1 = xm
    | sdtpldt0(X1,esk1_2(xm,xn)) != xn
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_18]),c_0_24])]) ).

cnf(c_0_29,negated_conjecture,
    sdtlseqdt0(esk1_2(xm,xn),xn),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24]),c_0_18])]) ).

cnf(c_0_30,negated_conjecture,
    sdtpldt0(xn,esk1_2(xn,xl)) = xl,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_26]),c_0_27]),c_0_17])]) ).

cnf(c_0_31,negated_conjecture,
    aNaturalNumber0(esk1_2(xn,xl)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_26]),c_0_27]),c_0_17])]) ).

fof(c_0_32,plain,
    ! [X16,X17,X18] :
      ( ~ aNaturalNumber0(X16)
      | ~ aNaturalNumber0(X17)
      | ~ aNaturalNumber0(X18)
      | sdtpldt0(sdtpldt0(X16,X17),X18) = sdtpldt0(X16,sdtpldt0(X17,X18)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])])]) ).

cnf(c_0_33,negated_conjecture,
    ( X1 = xm
    | sdtpldt0(esk1_2(xm,xn),X1) != xn
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_24])]) ).

cnf(c_0_34,negated_conjecture,
    sdtpldt0(esk1_2(xm,xn),esk1_2(esk1_2(xm,xn),xn)) = xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_29]),c_0_17]),c_0_24])]) ).

cnf(c_0_35,negated_conjecture,
    aNaturalNumber0(esk1_2(esk1_2(xm,xn),xn)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_17]),c_0_24])]) ).

cnf(c_0_36,negated_conjecture,
    ( X1 = xn
    | sdtpldt0(X1,esk1_2(xn,xl)) != xl
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_30]),c_0_17]),c_0_31])]) ).

cnf(c_0_37,negated_conjecture,
    sdtlseqdt0(esk1_2(xn,xl),xl),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_31]),c_0_17])]) ).

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

cnf(c_0_39,negated_conjecture,
    esk1_2(esk1_2(xm,xn),xn) = xm,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).

cnf(c_0_40,negated_conjecture,
    ( X1 = xn
    | sdtpldt0(esk1_2(xn,xl),X1) != xl
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_21]),c_0_31])]) ).

cnf(c_0_41,negated_conjecture,
    sdtpldt0(esk1_2(xn,xl),esk1_2(esk1_2(xn,xl),xl)) = xl,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_27]),c_0_31])]) ).

cnf(c_0_42,negated_conjecture,
    aNaturalNumber0(esk1_2(esk1_2(xn,xl),xl)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_37]),c_0_27]),c_0_31])]) ).

cnf(c_0_43,plain,
    ( sdtlseqdt0(X1,sdtpldt0(X2,sdtpldt0(X3,X1)))
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_38]),c_0_12]) ).

cnf(c_0_44,negated_conjecture,
    sdtpldt0(esk1_2(xm,xn),xm) = xn,
    inference(rw,[status(thm)],[c_0_34,c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    esk1_2(esk1_2(xn,xl),xl) = xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).

cnf(c_0_46,negated_conjecture,
    ( sdtlseqdt0(xm,sdtpldt0(X1,xn))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_18]),c_0_24])]) ).

cnf(c_0_47,negated_conjecture,
    sdtpldt0(esk1_2(xn,xl),xn) = xl,
    inference(rw,[status(thm)],[c_0_41,c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    ~ sdtlseqdt0(xm,xl),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_31])]),c_0_48]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem    : NUM460+1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n004.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon May 20 06:14:52 EDT 2024
% 0.09/0.30  % CPUTime    : 
% 0.14/0.42  Running first-order theorem proving
% 0.14/0.42  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/benchmark/theBenchmark.p
% 1.23/0.64  # Version: 3.1.0
% 1.23/0.64  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.64  # Starting new_bool_3 with 300s (1) cores
% 1.23/0.64  # Starting new_bool_1 with 300s (1) cores
% 1.23/0.64  # Starting sh5l with 300s (1) cores
% 1.23/0.64  # new_bool_3 with pid 9189 completed with status 0
% 1.23/0.64  # Result found by new_bool_3
% 1.23/0.64  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.64  # Starting new_bool_3 with 300s (1) cores
% 1.23/0.64  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.23/0.64  # Search class: FGUSF-FFMM22-SFFFFFNN
% 1.23/0.64  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.23/0.64  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 1.23/0.64  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 9194 completed with status 0
% 1.23/0.64  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 1.23/0.64  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.64  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.64  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.64  # Starting new_bool_3 with 300s (1) cores
% 1.23/0.64  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.23/0.64  # Search class: FGUSF-FFMM22-SFFFFFNN
% 1.23/0.64  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.23/0.64  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 1.23/0.64  # Preprocessing time       : 0.001 s
% 1.23/0.64  # Presaturation interreduction done
% 1.23/0.64  
% 1.23/0.64  # Proof found!
% 1.23/0.64  # SZS status Theorem
% 1.23/0.64  # SZS output start CNFRefutation
% See solution above
% 1.23/0.64  # Parsed axioms                        : 23
% 1.23/0.64  # Removed by relevancy pruning/SinE    : 3
% 1.23/0.64  # Initial clauses                      : 32
% 1.23/0.64  # Removed in clause preprocessing      : 1
% 1.23/0.64  # Initial clauses in saturation        : 31
% 1.23/0.64  # Processed clauses                    : 1624
% 1.23/0.64  # ...of these trivial                  : 47
% 1.23/0.64  # ...subsumed                          : 1017
% 1.23/0.64  # ...remaining for further processing  : 560
% 1.23/0.64  # Other redundant clauses eliminated   : 19
% 1.23/0.64  # Clauses deleted for lack of memory   : 0
% 1.23/0.64  # Backward-subsumed                    : 10
% 1.23/0.64  # Backward-rewritten                   : 50
% 1.23/0.64  # Generated clauses                    : 10271
% 1.23/0.64  # ...of the previous two non-redundant : 9274
% 1.23/0.64  # ...aggressively subsumed             : 0
% 1.23/0.64  # Contextual simplify-reflections      : 100
% 1.23/0.64  # Paramodulations                      : 10240
% 1.23/0.64  # Factorizations                       : 0
% 1.23/0.64  # NegExts                              : 0
% 1.23/0.64  # Equation resolutions                 : 31
% 1.23/0.64  # Disequality decompositions           : 0
% 1.23/0.64  # Total rewrite steps                  : 10446
% 1.23/0.64  # ...of those cached                   : 10331
% 1.23/0.64  # Propositional unsat checks           : 0
% 1.23/0.64  #    Propositional check models        : 0
% 1.23/0.64  #    Propositional check unsatisfiable : 0
% 1.23/0.64  #    Propositional clauses             : 0
% 1.23/0.64  #    Propositional clauses after purity: 0
% 1.23/0.64  #    Propositional unsat core size     : 0
% 1.23/0.64  #    Propositional preprocessing time  : 0.000
% 1.23/0.64  #    Propositional encoding time       : 0.000
% 1.23/0.64  #    Propositional solver time         : 0.000
% 1.23/0.64  #    Success case prop preproc time    : 0.000
% 1.23/0.64  #    Success case prop encoding time   : 0.000
% 1.23/0.64  #    Success case prop solver time     : 0.000
% 1.23/0.64  # Current number of processed clauses  : 468
% 1.23/0.64  #    Positive orientable unit clauses  : 95
% 1.23/0.64  #    Positive unorientable unit clauses: 0
% 1.23/0.64  #    Negative unit clauses             : 1
% 1.23/0.64  #    Non-unit-clauses                  : 372
% 1.23/0.64  # Current number of unprocessed clauses: 7596
% 1.23/0.64  # ...number of literals in the above   : 38504
% 1.23/0.64  # Current number of archived formulas  : 0
% 1.23/0.64  # Current number of archived clauses   : 91
% 1.23/0.64  # Clause-clause subsumption calls (NU) : 19815
% 1.23/0.64  # Rec. Clause-clause subsumption calls : 14186
% 1.23/0.64  # Non-unit clause-clause subsumptions  : 1126
% 1.23/0.64  # Unit Clause-clause subsumption calls : 11
% 1.23/0.64  # Rewrite failures with RHS unbound    : 0
% 1.23/0.64  # BW rewrite match attempts            : 30
% 1.23/0.64  # BW rewrite match successes           : 25
% 1.23/0.64  # Condensation attempts                : 0
% 1.23/0.64  # Condensation successes               : 0
% 1.23/0.64  # Termbank termtop insertions          : 179651
% 1.23/0.64  # Search garbage collected termcells   : 469
% 1.23/0.64  
% 1.23/0.64  # -------------------------------------------------
% 1.23/0.64  # User time                : 0.202 s
% 1.23/0.64  # System time              : 0.005 s
% 1.23/0.64  # Total time               : 0.207 s
% 1.23/0.64  # Maximum resident set size: 1844 pages
% 1.23/0.64  
% 1.23/0.64  # -------------------------------------------------
% 1.23/0.64  # User time                : 0.203 s
% 1.23/0.64  # System time              : 0.007 s
% 1.23/0.64  # Total time               : 0.210 s
% 1.23/0.64  # Maximum resident set size: 1712 pages
% 1.23/0.64  % E---3.1 exiting
% 1.91/0.64  % E exiting
%------------------------------------------------------------------------------