TSTP Solution File: NUM426+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM426+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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 : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 09:32:17 EDT 2022

% Result   : Theorem 0.56s 47.75s
% Output   : CNFRefutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   61 (  27 unt;   0 def)
%            Number of atoms       :  135 (  55 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  126 (  52   ~;  47   |;  19   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   56 (   0 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mIntNeg,axiom,
    ! [X1] :
      ( aInteger0(X1)
     => aInteger0(smndt0(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mIntNeg) ).

fof(mAddAsso,axiom,
    ! [X1,X2,X3] :
      ( ( aInteger0(X1)
        & aInteger0(X2)
        & aInteger0(X3) )
     => sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mAddAsso) ).

fof(mAddNeg,axiom,
    ! [X1] :
      ( aInteger0(X1)
     => ( sdtpldt0(X1,smndt0(X1)) = sz00
        & sz00 = sdtpldt0(smndt0(X1),X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mAddNeg) ).

fof(m__704,hypothesis,
    ( aInteger0(xa)
    & aInteger0(xb)
    & aInteger0(xq)
    & xq != sz00 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__704) ).

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

fof(mAddZero,axiom,
    ! [X1] :
      ( aInteger0(X1)
     => ( sdtpldt0(X1,sz00) = X1
        & X1 = sdtpldt0(sz00,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mAddZero) ).

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

fof(mMulMinOne,axiom,
    ! [X1] :
      ( aInteger0(X1)
     => ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
        & smndt0(X1) = sdtasdt0(X1,smndt0(sz10)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mMulMinOne) ).

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

fof(mIntOne,axiom,
    aInteger0(sz10),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',mIntOne) ).

fof(m__,conjecture,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__) ).

fof(m__747,hypothesis,
    ( aInteger0(xn)
    & sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',m__747) ).

fof(c_0_12,plain,
    ! [X2] :
      ( ~ aInteger0(X2)
      | aInteger0(smndt0(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIntNeg])]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6] :
      ( ~ aInteger0(X4)
      | ~ aInteger0(X5)
      | ~ aInteger0(X6)
      | sdtpldt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtpldt0(X4,X5),X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddAsso])]) ).

fof(c_0_14,plain,
    ! [X2] :
      ( ( sdtpldt0(X2,smndt0(X2)) = sz00
        | ~ aInteger0(X2) )
      & ( sz00 = sdtpldt0(smndt0(X2),X2)
        | ~ aInteger0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddNeg])])]) ).

cnf(c_0_15,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,hypothesis,
    aInteger0(xb),
    inference(split_conjunct,[status(thm)],[m__704]) ).

fof(c_0_17,plain,
    ! [X4,X5,X6] :
      ( ( sdtasdt0(X4,sdtpldt0(X5,X6)) = sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))
        | ~ aInteger0(X4)
        | ~ aInteger0(X5)
        | ~ aInteger0(X6) )
      & ( sdtasdt0(sdtpldt0(X4,X5),X6) = sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))
        | ~ aInteger0(X4)
        | ~ aInteger0(X5)
        | ~ aInteger0(X6) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDistrib])])]) ).

cnf(c_0_18,plain,
    ( sdtpldt0(X1,sdtpldt0(X2,X3)) = sdtpldt0(sdtpldt0(X1,X2),X3)
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( sz00 = sdtpldt0(smndt0(X1),X1)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_20,plain,
    ! [X2] :
      ( ( sdtpldt0(X2,sz00) = X2
        | ~ aInteger0(X2) )
      & ( X2 = sdtpldt0(sz00,X2)
        | ~ aInteger0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).

cnf(c_0_21,hypothesis,
    aInteger0(smndt0(xb)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_22,plain,
    ! [X3,X4] :
      ( ~ aInteger0(X3)
      | ~ aInteger0(X4)
      | sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).

cnf(c_0_23,plain,
    ( sdtasdt0(sdtpldt0(X3,X2),X1) = sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))
    | ~ aInteger0(X1)
    | ~ aInteger0(X2)
    | ~ aInteger0(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_24,hypothesis,
    aInteger0(xa),
    inference(split_conjunct,[status(thm)],[m__704]) ).

fof(c_0_25,plain,
    ! [X2] :
      ( ( sdtasdt0(smndt0(sz10),X2) = smndt0(X2)
        | ~ aInteger0(X2) )
      & ( smndt0(X2) = sdtasdt0(X2,smndt0(sz10))
        | ~ aInteger0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulMinOne])])]) ).

cnf(c_0_26,hypothesis,
    ( sdtpldt0(sdtpldt0(X1,X2),xb) = sdtpldt0(X1,sdtpldt0(X2,xb))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_16]) ).

cnf(c_0_27,hypothesis,
    sdtpldt0(smndt0(xb),xb) = sz00,
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_28,plain,
    ( X1 = sdtpldt0(sz00,X1)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_29,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_30,hypothesis,
    aInteger0(smndt0(smndt0(xb))),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

cnf(c_0_31,plain,
    ( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

fof(c_0_32,plain,
    ! [X4,X5,X6] :
      ( ~ aInteger0(X4)
      | ~ aInteger0(X5)
      | ~ aInteger0(X6)
      | sdtasdt0(X4,sdtasdt0(X5,X6)) = sdtasdt0(sdtasdt0(X4,X5),X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulAsso])]) ).

cnf(c_0_33,plain,
    aInteger0(sz10),
    inference(split_conjunct,[status(thm)],[mIntOne]) ).

fof(c_0_34,negated_conjecture,
    sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_35,hypothesis,
    ( sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(X2,X1)) = sdtasdt0(sdtpldt0(xa,X2),X1)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_36,hypothesis,
    sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)),
    inference(split_conjunct,[status(thm)],[m__747]) ).

cnf(c_0_37,plain,
    ( smndt0(X1) = sdtasdt0(X1,smndt0(sz10))
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_38,hypothesis,
    ( sdtpldt0(sdtpldt0(X1,smndt0(xb)),xb) = sdtpldt0(X1,sz00)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_21]),c_0_27]) ).

cnf(c_0_39,hypothesis,
    sdtpldt0(smndt0(smndt0(xb)),smndt0(xb)) = sz00,
    inference(spm,[status(thm)],[c_0_19,c_0_21]) ).

cnf(c_0_40,hypothesis,
    sdtpldt0(sz00,xb) = xb,
    inference(spm,[status(thm)],[c_0_28,c_0_16]) ).

cnf(c_0_41,hypothesis,
    sdtpldt0(smndt0(smndt0(xb)),sz00) = smndt0(smndt0(xb)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_42,hypothesis,
    ( sdtpldt0(X1,xb) = sdtpldt0(xb,X1)
    | ~ aInteger0(X1) ),
    inference(spm,[status(thm)],[c_0_31,c_0_16]) ).

cnf(c_0_43,hypothesis,
    aInteger0(smndt0(xa)),
    inference(spm,[status(thm)],[c_0_15,c_0_24]) ).

cnf(c_0_44,plain,
    ( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(sdtasdt0(X1,X2),X3)
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_45,plain,
    aInteger0(smndt0(sz10)),
    inference(spm,[status(thm)],[c_0_15,c_0_33]) ).

cnf(c_0_46,hypothesis,
    aInteger0(xn),
    inference(split_conjunct,[status(thm)],[m__747]) ).

fof(c_0_47,negated_conjecture,
    sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)),
    inference(fof_simplification,[status(thm)],[c_0_34]) ).

cnf(c_0_48,hypothesis,
    ( sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(smndt0(xb),X1)) = sdtasdt0(sdtasdt0(xq,xn),X1)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_36]) ).

cnf(c_0_49,hypothesis,
    sdtasdt0(xa,smndt0(sz10)) = smndt0(xa),
    inference(spm,[status(thm)],[c_0_37,c_0_24]) ).

cnf(c_0_50,hypothesis,
    sdtasdt0(smndt0(xb),smndt0(sz10)) = smndt0(smndt0(xb)),
    inference(spm,[status(thm)],[c_0_37,c_0_21]) ).

cnf(c_0_51,hypothesis,
    smndt0(smndt0(xb)) = xb,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_30]),c_0_39]),c_0_40]),c_0_41]) ).

cnf(c_0_52,hypothesis,
    sdtpldt0(smndt0(xa),xb) = sdtpldt0(xb,smndt0(xa)),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_53,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),smndt0(sz10)) = sdtasdt0(X1,sdtasdt0(X2,smndt0(sz10)))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_54,hypothesis,
    sdtasdt0(xn,smndt0(sz10)) = smndt0(xn),
    inference(spm,[status(thm)],[c_0_37,c_0_46]) ).

cnf(c_0_55,negated_conjecture,
    sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_56,hypothesis,
    sdtpldt0(xb,smndt0(xa)) = sdtasdt0(sdtasdt0(xq,xn),smndt0(sz10)),
    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_45]),c_0_49]),c_0_50]),c_0_51]),c_0_52]) ).

cnf(c_0_57,hypothesis,
    ( sdtasdt0(sdtasdt0(X1,xn),smndt0(sz10)) = sdtasdt0(X1,smndt0(xn))
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_46]),c_0_54]) ).

cnf(c_0_58,hypothesis,
    aInteger0(xq),
    inference(split_conjunct,[status(thm)],[m__704]) ).

cnf(c_0_59,negated_conjecture,
    sdtasdt0(sdtasdt0(xq,xn),smndt0(sz10)) != sdtasdt0(xq,smndt0(xn)),
    inference(rw,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM426+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n024.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.34  % DateTime : Tue Jul  5 14:36:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.38/23.40  eprover: CPU time limit exceeded, terminating
% 0.38/23.40  eprover: CPU time limit exceeded, terminating
% 0.38/23.41  eprover: CPU time limit exceeded, terminating
% 0.38/23.42  eprover: CPU time limit exceeded, terminating
% 0.55/46.42  eprover: CPU time limit exceeded, terminating
% 0.55/46.43  eprover: CPU time limit exceeded, terminating
% 0.55/46.43  eprover: CPU time limit exceeded, terminating
% 0.55/46.45  eprover: CPU time limit exceeded, terminating
% 0.56/47.75  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.56/47.75  
% 0.56/47.75  # Failure: Resource limit exceeded (time)
% 0.56/47.75  # OLD status Res
% 0.56/47.75  # Preprocessing time       : 0.015 s
% 0.56/47.75  # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.56/47.75  
% 0.56/47.75  # Failure: Resource limit exceeded (time)
% 0.56/47.75  # OLD status Res
% 0.56/47.75  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.56/47.75  # Preprocessing time       : 0.008 s
% 0.56/47.75  # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.56/47.75  # Preprocessing time       : 0.008 s
% 0.56/47.75  
% 0.56/47.75  # Proof found!
% 0.56/47.75  # SZS status Theorem
% 0.56/47.75  # SZS output start CNFRefutation
% See solution above
% 0.56/47.75  # Proof object total steps             : 61
% 0.56/47.75  # Proof object clause steps            : 39
% 0.56/47.75  # Proof object formula steps           : 22
% 0.56/47.75  # Proof object conjectures             : 5
% 0.56/47.75  # Proof object clause conjectures      : 2
% 0.56/47.75  # Proof object formula conjectures     : 3
% 0.56/47.75  # Proof object initial clauses used    : 16
% 0.56/47.75  # Proof object initial formulas used   : 12
% 0.56/47.75  # Proof object generating inferences   : 22
% 0.56/47.75  # Proof object simplifying inferences  : 12
% 0.56/47.75  # Training examples: 0 positive, 0 negative
% 0.56/47.75  # Parsed axioms                        : 24
% 0.56/47.75  # Removed by relevancy pruning/SinE    : 0
% 0.56/47.75  # Initial clauses                      : 39
% 0.56/47.75  # Removed in clause preprocessing      : 1
% 0.56/47.75  # Initial clauses in saturation        : 38
% 0.56/47.75  # Processed clauses                    : 6332
% 0.56/47.75  # ...of these trivial                  : 512
% 0.56/47.75  # ...subsumed                          : 214
% 0.56/47.75  # ...remaining for further processing  : 5606
% 0.56/47.75  # Other redundant clauses eliminated   : 0
% 0.56/47.75  # Clauses deleted for lack of memory   : 0
% 0.56/47.75  # Backward-subsumed                    : 23
% 0.56/47.75  # Backward-rewritten                   : 1425
% 0.56/47.75  # Generated clauses                    : 96859
% 0.56/47.75  # ...of the previous two non-trivial   : 95475
% 0.56/47.75  # Contextual simplify-reflections      : 25
% 0.56/47.75  # Paramodulations                      : 96747
% 0.56/47.75  # Factorizations                       : 0
% 0.56/47.75  # Equation resolutions                 : 112
% 0.56/47.75  # Current number of processed clauses  : 4158
% 0.56/47.75  #    Positive orientable unit clauses  : 2813
% 0.56/47.75  #    Positive unorientable unit clauses: 0
% 0.56/47.75  #    Negative unit clauses             : 4
% 0.56/47.75  #    Non-unit-clauses                  : 1341
% 0.56/47.75  # Current number of unprocessed clauses: 68554
% 0.56/47.75  # ...number of literals in the above   : 88773
% 0.56/47.75  # Current number of archived formulas  : 0
% 0.56/47.75  # Current number of archived clauses   : 1448
% 0.56/47.75  # Clause-clause subsumption calls (NU) : 47498
% 0.56/47.75  # Rec. Clause-clause subsumption calls : 44919
% 0.56/47.75  # Non-unit clause-clause subsumptions  : 246
% 0.56/47.75  # Unit Clause-clause subsumption calls : 4036
% 0.56/47.75  # Rewrite failures with RHS unbound    : 0
% 0.56/47.75  # BW rewrite match attempts            : 9290
% 0.56/47.75  # BW rewrite match successes           : 414
% 0.56/47.75  # Condensation attempts                : 0
% 0.56/47.75  # Condensation successes               : 0
% 0.56/47.75  # Termbank termtop insertions          : 2097467
% 0.56/47.75  
% 0.56/47.75  # -------------------------------------------------
% 0.56/47.75  # User time                : 0.628 s
% 0.56/47.75  # System time              : 0.034 s
% 0.56/47.75  # Total time               : 0.662 s
% 0.56/47.75  # Maximum resident set size: 72724 pages
% 0.56/69.43  eprover: CPU time limit exceeded, terminating
% 0.56/69.45  eprover: CPU time limit exceeded, terminating
% 0.56/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.46  eprover: No such file or directory
% 0.56/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.46  eprover: No such file or directory
% 0.56/69.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.46  eprover: No such file or directory
% 0.56/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.47  eprover: No such file or directory
% 0.56/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.47  eprover: No such file or directory
% 0.56/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.47  eprover: No such file or directory
% 0.56/69.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.47  eprover: No such file or directory
% 0.56/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.48  eprover: No such file or directory
% 0.56/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.48  eprover: No such file or directory
% 0.56/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.48  eprover: No such file or directory
% 0.56/69.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.48  eprover: No such file or directory
% 0.56/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.49  eprover: No such file or directory
% 0.56/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.49  eprover: No such file or directory
% 0.56/69.49  eprover: CPU time limit exceeded, terminating
% 0.56/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.49  eprover: No such file or directory
% 0.56/69.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.49  eprover: No such file or directory
% 0.56/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.50  eprover: No such file or directory
% 0.56/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.50  eprover: No such file or directory
% 0.56/69.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.56/69.50  eprover: No such file or directory
% 0.56/69.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.51  eprover: No such file or directory
% 0.56/69.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.51  eprover: No such file or directory
% 0.56/69.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.52  eprover: No such file or directory
% 0.56/69.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.52  eprover: No such file or directory
% 0.56/69.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.53  eprover: No such file or directory
% 0.56/69.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.53  eprover: No such file or directory
% 0.56/69.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.54  eprover: No such file or directory
% 0.56/69.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.55  eprover: No such file or directory
% 0.56/69.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.56/69.55  eprover: No such file or directory
%------------------------------------------------------------------------------