↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM511+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n026.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  : 600s
% DateTime : Mon Jul 18 09:33:15 EDT 2022

% Result   : Theorem 0.43s 47.62s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   51 (  20 unt;   0 def)
%            Number of atoms       :  185 (  75 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  212 (  78   ~;  78   |;  44   &)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   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;   9 con; 0-2 aty)
%            Number of variables   :   55 (   1 sgn  26   !;   6   ?)

% 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/sandbox/solver/bin/../tmp/theBenchmark.p',mDefQuot) ).

fof(mDefDiv,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( doDivides0(X1,X2)
      <=> ? [X3] :
            ( aNaturalNumber0(X3)
            & X2 = sdtasdt0(X1,X3) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDefDiv) ).

fof(m__2342,hypothesis,
    ( aNaturalNumber0(xr)
    & ? [X1] :
        ( aNaturalNumber0(X1)
        & xk = sdtasdt0(xr,X1) )
    & doDivides0(xr,xk)
    & xr != sz00
    & xr != sz10
    & ! [X1] :
        ( ( aNaturalNumber0(X1)
          & ( ? [X2] :
                ( aNaturalNumber0(X2)
                & xr = sdtasdt0(X1,X2) )
            | doDivides0(X1,xr) ) )
       => ( X1 = sz10
          | X1 = xr ) )
    & isPrime0(xr) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2342) ).

fof(m__2487,hypothesis,
    ( ? [X1] :
        ( aNaturalNumber0(X1)
        & xn = sdtasdt0(xr,X1) )
    & doDivides0(xr,xn) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2487) ).

fof(m__,conjecture,
    ( ( aNaturalNumber0(sdtsldt0(xn,xr))
      & xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
   => ( ? [X1] :
          ( aNaturalNumber0(X1)
          & sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
      | doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).

fof(mMulComm,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => sdtasdt0(X1,X2) = sdtasdt0(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mMulComm) ).

fof(mDivAsso,axiom,
    ! [X1,X2] :
      ( ( aNaturalNumber0(X1)
        & aNaturalNumber0(X2) )
     => ( ( X1 != sz00
          & doDivides0(X1,X2) )
       => ! [X3] :
            ( aNaturalNumber0(X3)
           => sdtasdt0(X3,sdtsldt0(X2,X1)) = sdtsldt0(sdtasdt0(X3,X2),X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mDivAsso) ).

fof(m__2306,hypothesis,
    ( aNaturalNumber0(xk)
    & sdtasdt0(xn,xm) = sdtasdt0(xp,xk)
    & xk = sdtsldt0(sdtasdt0(xn,xm),xp) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__2306) ).

fof(m__1837,hypothesis,
    ( aNaturalNumber0(xn)
    & aNaturalNumber0(xm)
    & aNaturalNumber0(xp) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__1837) ).

fof(c_0_9,plain,
    ! [X4,X5,X6,X6] :
      ( ( aNaturalNumber0(X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,X6)
        | X6 != sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X6)
        | X5 != sdtasdt0(X4,X6)
        | X6 = sdtsldt0(X5,X4)
        | X4 = sz00
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefQuot])])])])])]) ).

fof(c_0_10,plain,
    ! [X4,X5,X7] :
      ( ( aNaturalNumber0(esk2_2(X4,X5))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( X5 = sdtasdt0(X4,esk2_2(X4,X5))
        | ~ doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) )
      & ( ~ aNaturalNumber0(X7)
        | X5 != sdtasdt0(X4,X7)
        | doDivides0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | ~ aNaturalNumber0(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefDiv])])])])])])]) ).

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

cnf(c_0_12,plain,
    ( doDivides0(X2,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X2)
    | X1 != sdtasdt0(X2,X3)
    | ~ aNaturalNumber0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_13,hypothesis,
    ! [X4,X5] :
      ( aNaturalNumber0(xr)
      & aNaturalNumber0(esk12_0)
      & xk = sdtasdt0(xr,esk12_0)
      & doDivides0(xr,xk)
      & xr != sz00
      & xr != sz10
      & ( ~ aNaturalNumber0(X5)
        | xr != sdtasdt0(X4,X5)
        | ~ aNaturalNumber0(X4)
        | X4 = sz10
        | X4 = xr )
      & ( ~ doDivides0(X4,xr)
        | ~ aNaturalNumber0(X4)
        | X4 = sz10
        | X4 = xr )
      & isPrime0(xr) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__2342])])])])])])]) ).

fof(c_0_14,hypothesis,
    ( aNaturalNumber0(esk18_0)
    & xn = sdtasdt0(xr,esk18_0)
    & doDivides0(xr,xn) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2487])])])]) ).

cnf(c_0_15,plain,
    ( X1 = sdtsldt0(X2,X3)
    | X3 = sz00
    | X2 != sdtasdt0(X3,X1)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2) ),
    inference(csr,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    xk = sdtasdt0(xr,esk12_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,hypothesis,
    aNaturalNumber0(esk12_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,hypothesis,
    aNaturalNumber0(xr),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,hypothesis,
    xr != sz00,
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_20,negated_conjecture,
    ~ ( ( aNaturalNumber0(sdtsldt0(xn,xr))
        & xn = sdtasdt0(xr,sdtsldt0(xn,xr)) )
     => ( ? [X1] :
            ( aNaturalNumber0(X1)
            & sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,X1) )
        | doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_21,hypothesis,
    xn = sdtasdt0(xr,esk18_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,hypothesis,
    aNaturalNumber0(esk18_0),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_23,plain,
    ! [X3,X4] :
      ( ~ aNaturalNumber0(X3)
      | ~ aNaturalNumber0(X4)
      | sdtasdt0(X3,X4) = sdtasdt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulComm])]) ).

fof(c_0_24,plain,
    ! [X4,X5,X6] :
      ( ~ aNaturalNumber0(X4)
      | ~ aNaturalNumber0(X5)
      | X4 = sz00
      | ~ doDivides0(X4,X5)
      | ~ aNaturalNumber0(X6)
      | sdtasdt0(X6,sdtsldt0(X5,X4)) = sdtsldt0(sdtasdt0(X6,X5),X4) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDivAsso])])])])]) ).

cnf(c_0_25,hypothesis,
    ( sdtsldt0(X1,xr) = esk12_0
    | X1 != xk
    | ~ aNaturalNumber0(X1) ),
    inference(sr,[status(thm)],[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])]),c_0_19]) ).

cnf(c_0_26,hypothesis,
    aNaturalNumber0(xk),
    inference(split_conjunct,[status(thm)],[m__2306]) ).

fof(c_0_27,negated_conjecture,
    ! [X2] :
      ( aNaturalNumber0(sdtsldt0(xn,xr))
      & xn = sdtasdt0(xr,sdtsldt0(xn,xr))
      & ( ~ aNaturalNumber0(X2)
        | sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X2) )
      & ~ doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])]) ).

cnf(c_0_28,hypothesis,
    ( sdtsldt0(X1,xr) = esk18_0
    | X1 != xn
    | ~ aNaturalNumber0(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_22]),c_0_18])]),c_0_19]) ).

cnf(c_0_29,hypothesis,
    aNaturalNumber0(xn),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

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

cnf(c_0_31,hypothesis,
    aNaturalNumber0(xm),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

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

cnf(c_0_33,hypothesis,
    doDivides0(xr,xk),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_34,hypothesis,
    sdtsldt0(xk,xr) = esk12_0,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    ( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_36,hypothesis,
    sdtsldt0(xn,xr) = esk18_0,
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_37,hypothesis,
    ( sdtasdt0(X1,esk18_0) = sdtasdt0(esk18_0,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_22]) ).

cnf(c_0_38,hypothesis,
    doDivides0(xr,xn),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_39,hypothesis,
    ( sdtasdt0(X1,xm) = sdtasdt0(xm,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_40,hypothesis,
    ( sdtsldt0(sdtasdt0(X1,xk),xr) = sdtasdt0(X1,esk12_0)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[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_18]),c_0_26])]),c_0_19]),c_0_34]) ).

cnf(c_0_41,hypothesis,
    aNaturalNumber0(xp),
    inference(split_conjunct,[status(thm)],[m__1837]) ).

cnf(c_0_42,hypothesis,
    sdtasdt0(xn,xm) = sdtasdt0(xp,xk),
    inference(split_conjunct,[status(thm)],[m__2306]) ).

cnf(c_0_43,negated_conjecture,
    ( sdtasdt0(esk18_0,xm) != sdtasdt0(xp,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_44,hypothesis,
    sdtasdt0(esk18_0,xm) = sdtasdt0(xm,esk18_0),
    inference(spm,[status(thm)],[c_0_37,c_0_31]) ).

cnf(c_0_45,hypothesis,
    ( sdtsldt0(sdtasdt0(X1,xn),xr) = sdtasdt0(X1,esk18_0)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[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_38]),c_0_18]),c_0_29])]),c_0_19]),c_0_36]) ).

cnf(c_0_46,hypothesis,
    sdtasdt0(xm,xn) = sdtasdt0(xn,xm),
    inference(spm,[status(thm)],[c_0_39,c_0_29]) ).

cnf(c_0_47,hypothesis,
    sdtsldt0(sdtasdt0(xn,xm),xr) = sdtasdt0(xp,esk12_0),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).

cnf(c_0_48,negated_conjecture,
    ( sdtasdt0(xp,X1) != sdtasdt0(xm,esk18_0)
    | ~ aNaturalNumber0(X1) ),
    inference(rw,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_49,hypothesis,
    sdtasdt0(xp,esk12_0) = sdtasdt0(xm,esk18_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_46]),c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM511+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jul  5 15:48:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.31/23.39  eprover: CPU time limit exceeded, terminating
% 0.31/23.40  eprover: CPU time limit exceeded, terminating
% 0.31/23.40  eprover: CPU time limit exceeded, terminating
% 0.31/23.43  eprover: CPU time limit exceeded, terminating
% 0.43/46.42  eprover: CPU time limit exceeded, terminating
% 0.43/46.42  eprover: CPU time limit exceeded, terminating
% 0.43/46.43  eprover: CPU time limit exceeded, terminating
% 0.43/46.45  eprover: CPU time limit exceeded, terminating
% 0.43/47.62  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.43/47.62  
% 0.43/47.62  # Failure: Resource limit exceeded (time)
% 0.43/47.62  # OLD status Res
% 0.43/47.62  # Preprocessing time       : 0.027 s
% 0.43/47.62  # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.43/47.62  
% 0.43/47.62  # Failure: Resource limit exceeded (time)
% 0.43/47.62  # OLD status Res
% 0.43/47.62  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.43/47.62  # Preprocessing time       : 0.028 s
% 0.43/47.62  # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.43/47.62  # Preprocessing time       : 0.026 s
% 0.43/47.62  
% 0.43/47.62  # Proof found!
% 0.43/47.62  # SZS status Theorem
% 0.43/47.62  # SZS output start CNFRefutation
% See solution above
% 0.43/47.62  # Proof object total steps             : 51
% 0.43/47.62  # Proof object clause steps            : 34
% 0.43/47.62  # Proof object formula steps           : 17
% 0.43/47.62  # Proof object conjectures             : 7
% 0.43/47.62  # Proof object clause conjectures      : 4
% 0.43/47.62  # Proof object formula conjectures     : 3
% 0.43/47.62  # Proof object initial clauses used    : 18
% 0.43/47.62  # Proof object initial formulas used   : 9
% 0.43/47.62  # Proof object generating inferences   : 13
% 0.43/47.62  # Proof object simplifying inferences  : 26
% 0.43/47.62  # Training examples: 0 positive, 0 negative
% 0.43/47.62  # Parsed axioms                        : 54
% 0.43/47.62  # Removed by relevancy pruning/SinE    : 0
% 0.43/47.62  # Initial clauses                      : 268
% 0.43/47.62  # Removed in clause preprocessing      : 3
% 0.43/47.62  # Initial clauses in saturation        : 265
% 0.43/47.62  # Processed clauses                    : 1372
% 0.43/47.62  # ...of these trivial                  : 80
% 0.43/47.62  # ...subsumed                          : 113
% 0.43/47.62  # ...remaining for further processing  : 1179
% 0.43/47.62  # Other redundant clauses eliminated   : 1
% 0.43/47.62  # Clauses deleted for lack of memory   : 0
% 0.43/47.62  # Backward-subsumed                    : 0
% 0.43/47.62  # Backward-rewritten                   : 115
% 0.43/47.62  # Generated clauses                    : 18079
% 0.43/47.62  # ...of the previous two non-trivial   : 17029
% 0.43/47.62  # Contextual simplify-reflections      : 28
% 0.43/47.62  # Paramodulations                      : 18056
% 0.43/47.62  # Factorizations                       : 1
% 0.43/47.62  # Equation resolutions                 : 21
% 0.43/47.62  # Current number of processed clauses  : 1062
% 0.43/47.62  #    Positive orientable unit clauses  : 281
% 0.43/47.62  #    Positive unorientable unit clauses: 0
% 0.43/47.62  #    Negative unit clauses             : 40
% 0.43/47.62  #    Non-unit-clauses                  : 741
% 0.43/47.62  # Current number of unprocessed clauses: 15283
% 0.43/47.62  # ...number of literals in the above   : 83241
% 0.43/47.62  # Current number of archived formulas  : 0
% 0.43/47.62  # Current number of archived clauses   : 116
% 0.43/47.62  # Clause-clause subsumption calls (NU) : 104808
% 0.43/47.62  # Rec. Clause-clause subsumption calls : 38497
% 0.43/47.62  # Non-unit clause-clause subsumptions  : 54
% 0.43/47.62  # Unit Clause-clause subsumption calls : 19746
% 0.43/47.62  # Rewrite failures with RHS unbound    : 0
% 0.43/47.62  # BW rewrite match attempts            : 16
% 0.43/47.62  # BW rewrite match successes           : 16
% 0.43/47.62  # Condensation attempts                : 0
% 0.43/47.62  # Condensation successes               : 0
% 0.43/47.62  # Termbank termtop insertions          : 429561
% 0.43/47.62  
% 0.43/47.62  # -------------------------------------------------
% 0.43/47.62  # User time                : 0.263 s
% 0.43/47.62  # System time              : 0.007 s
% 0.43/47.62  # Total time               : 0.270 s
% 0.43/47.62  # Maximum resident set size: 19536 pages
% 0.43/69.43  eprover: CPU time limit exceeded, terminating
% 0.43/69.45  eprover: CPU time limit exceeded, terminating
% 0.43/69.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.45  eprover: No such file or directory
% 0.43/69.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.45  eprover: No such file or directory
% 0.43/69.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.45  eprover: No such file or directory
% 0.43/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.46  eprover: No such file or directory
% 0.43/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.ineprover: No such file or directory
% 0.43/69.46  
% 0.43/69.46  eprover: No such file or directory
% 0.43/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.47  eprover: No such file or directory
% 0.43/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.47  eprover: No such file or directory
% 0.43/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.47  eprover: No such file or directory
% 0.43/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.47  eprover: No such file or directory
% 0.43/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.48  eprover: No such file or directory
% 0.43/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.48  eprover: No such file or directory
% 0.43/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.48  eprover: No such file or directory
% 0.43/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.48  eprover: No such file or directory
% 0.43/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.49  eprover: No such file or directory
% 0.43/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.50  eprover: No such file or directory
% 0.43/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.50  eprover: No such file or directory
% 0.43/69.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/69.51  eprover: No such file or directory
%------------------------------------------------------------------------------