TSTP Solution File: GRA008+2 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GRA008+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 : Sat Jul 16 07:16:08 EDT 2022

% Result   : Theorem 0.22s 1.40s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   53 (  12 unt;   0 def)
%            Number of atoms       :  196 (  49 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  254 ( 111   ~;  98   |;  35   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   2 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-4 aty)
%            Number of variables   :  131 (  10 sgn  49   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sequential_is_triangle,conjecture,
    ( complete
   => ! [X2,X3,X7,X8,X4] :
        ( ( shortest_path(X2,X3,X4)
          & precedes(X7,X8,X4)
          & sequential(X7,X8) )
       => ? [X9] : triangle(X7,X8,X9) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sequential_is_triangle) ).

fof(back_edge,lemma,
    ( complete
   => ! [X2,X3,X7,X8,X4] :
        ( ( shortest_path(X2,X3,X4)
          & precedes(X7,X8,X4) )
       => ? [X9] :
            ( edge(X9)
            & tail_of(X9) = head_of(X8)
            & head_of(X9) = tail_of(X7) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',back_edge) ).

fof(shortest_path_properties,axiom,
    ! [X2,X3,X7,X8,X4] :
      ( ( shortest_path(X2,X3,X4)
        & precedes(X7,X8,X4) )
     => ( ~ ? [X9] :
              ( tail_of(X9) = tail_of(X7)
              & head_of(X9) = head_of(X8) )
        & ~ precedes(X8,X7,X4) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).

fof(triangle_defn,axiom,
    ! [X7,X8,X9] :
      ( triangle(X7,X8,X9)
    <=> ( edge(X7)
        & edge(X8)
        & edge(X9)
        & sequential(X7,X8)
        & sequential(X8,X9)
        & sequential(X9,X7) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',triangle_defn) ).

fof(sequential_defn,axiom,
    ! [X7,X8] :
      ( sequential(X7,X8)
    <=> ( edge(X7)
        & edge(X8)
        & X7 != X8
        & head_of(X7) = tail_of(X8) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',sequential_defn) ).

fof(no_loops,axiom,
    ! [X1] :
      ( edge(X1)
     => head_of(X1) != tail_of(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',no_loops) ).

fof(c_0_6,negated_conjecture,
    ~ ( complete
     => ! [X2,X3,X7,X8,X4] :
          ( ( shortest_path(X2,X3,X4)
            & precedes(X7,X8,X4)
            & sequential(X7,X8) )
         => ? [X9] : triangle(X7,X8,X9) ) ),
    inference(assume_negation,[status(cth)],[sequential_is_triangle]) ).

fof(c_0_7,lemma,
    ! [X10,X11,X12,X13,X14] :
      ( ( edge(esk7_4(X10,X11,X12,X13))
        | ~ shortest_path(X10,X11,X14)
        | ~ precedes(X12,X13,X14)
        | ~ complete )
      & ( tail_of(esk7_4(X10,X11,X12,X13)) = head_of(X13)
        | ~ shortest_path(X10,X11,X14)
        | ~ precedes(X12,X13,X14)
        | ~ complete )
      & ( head_of(esk7_4(X10,X11,X12,X13)) = tail_of(X12)
        | ~ shortest_path(X10,X11,X14)
        | ~ precedes(X12,X13,X14)
        | ~ complete ) ),
    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)],[back_edge])])])])])])]) ).

fof(c_0_8,negated_conjecture,
    ! [X15] :
      ( complete
      & shortest_path(esk1_0,esk2_0,esk5_0)
      & precedes(esk3_0,esk4_0,esk5_0)
      & sequential(esk3_0,esk4_0)
      & ~ triangle(esk3_0,esk4_0,X15) ),
    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)],[c_0_6])])])])])]) ).

cnf(c_0_9,lemma,
    ( head_of(esk7_4(X4,X5,X1,X2)) = tail_of(X1)
    | ~ complete
    | ~ precedes(X1,X2,X3)
    | ~ shortest_path(X4,X5,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    complete,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,lemma,
    ( edge(esk7_4(X4,X5,X1,X2))
    | ~ complete
    | ~ precedes(X1,X2,X3)
    | ~ shortest_path(X4,X5,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,plain,
    ! [X10,X11,X12,X13,X14,X15] :
      ( ( tail_of(X15) != tail_of(X12)
        | head_of(X15) != head_of(X13)
        | ~ shortest_path(X10,X11,X14)
        | ~ precedes(X12,X13,X14) )
      & ( ~ precedes(X13,X12,X14)
        | ~ shortest_path(X10,X11,X14)
        | ~ precedes(X12,X13,X14) ) ),
    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)],[inference(fof_simplification,[status(thm)],[shortest_path_properties])])])])])])]) ).

fof(c_0_13,plain,
    ! [X10,X11,X12,X10,X11,X12] :
      ( ( edge(X10)
        | ~ triangle(X10,X11,X12) )
      & ( edge(X11)
        | ~ triangle(X10,X11,X12) )
      & ( edge(X12)
        | ~ triangle(X10,X11,X12) )
      & ( sequential(X10,X11)
        | ~ triangle(X10,X11,X12) )
      & ( sequential(X11,X12)
        | ~ triangle(X10,X11,X12) )
      & ( sequential(X12,X10)
        | ~ triangle(X10,X11,X12) )
      & ( ~ edge(X10)
        | ~ edge(X11)
        | ~ edge(X12)
        | ~ sequential(X10,X11)
        | ~ sequential(X11,X12)
        | ~ sequential(X12,X10)
        | triangle(X10,X11,X12) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[triangle_defn])])])])]) ).

fof(c_0_14,plain,
    ! [X9,X10,X9,X10] :
      ( ( edge(X9)
        | ~ sequential(X9,X10) )
      & ( edge(X10)
        | ~ sequential(X9,X10) )
      & ( X9 != X10
        | ~ sequential(X9,X10) )
      & ( head_of(X9) = tail_of(X10)
        | ~ sequential(X9,X10) )
      & ( ~ edge(X9)
        | ~ edge(X10)
        | X9 = X10
        | head_of(X9) != tail_of(X10)
        | sequential(X9,X10) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sequential_defn])])])])]) ).

cnf(c_0_15,lemma,
    ( head_of(esk7_4(X1,X2,X3,X4)) = tail_of(X3)
    | ~ shortest_path(X1,X2,X5)
    | ~ precedes(X3,X4,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).

cnf(c_0_16,negated_conjecture,
    shortest_path(esk1_0,esk2_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,lemma,
    ( edge(esk7_4(X1,X2,X3,X4))
    | ~ shortest_path(X1,X2,X5)
    | ~ precedes(X3,X4,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10])]) ).

cnf(c_0_18,lemma,
    ( tail_of(esk7_4(X4,X5,X1,X2)) = head_of(X2)
    | ~ complete
    | ~ precedes(X1,X2,X3)
    | ~ shortest_path(X4,X5,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,plain,
    ( ~ precedes(X1,X2,X3)
    | ~ shortest_path(X4,X5,X3)
    | head_of(X6) != head_of(X2)
    | tail_of(X6) != tail_of(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    ( triangle(X1,X2,X3)
    | ~ sequential(X3,X1)
    | ~ sequential(X2,X3)
    | ~ sequential(X1,X2)
    | ~ edge(X3)
    | ~ edge(X2)
    | ~ edge(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,plain,
    ( edge(X1)
    | ~ sequential(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( sequential(X1,X2)
    | X1 = X2
    | head_of(X1) != tail_of(X2)
    | ~ edge(X2)
    | ~ edge(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    ( head_of(esk7_4(esk1_0,esk2_0,X1,X2)) = tail_of(X1)
    | ~ precedes(X1,X2,esk5_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_24,negated_conjecture,
    ( edge(esk7_4(esk1_0,esk2_0,X1,X2))
    | ~ precedes(X1,X2,esk5_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_25,lemma,
    ( tail_of(esk7_4(X1,X2,X3,X4)) = head_of(X4)
    | ~ shortest_path(X1,X2,X5)
    | ~ precedes(X3,X4,X5) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_10])]) ).

cnf(c_0_26,negated_conjecture,
    ( head_of(X1) != head_of(X2)
    | tail_of(X3) != tail_of(X2)
    | ~ precedes(X3,X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_27,negated_conjecture,
    precedes(esk3_0,esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_28,negated_conjecture,
    ~ triangle(esk3_0,esk4_0,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_29,plain,
    ( triangle(X1,X2,X3)
    | ~ sequential(X3,X1)
    | ~ sequential(X2,X3)
    | ~ sequential(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    sequential(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_31,negated_conjecture,
    ( esk7_4(esk1_0,esk2_0,X1,X2) = X3
    | sequential(esk7_4(esk1_0,esk2_0,X1,X2),X3)
    | tail_of(X3) != tail_of(X1)
    | ~ precedes(X1,X2,esk5_0)
    | ~ edge(X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_32,negated_conjecture,
    ( tail_of(esk7_4(esk1_0,esk2_0,X1,X2)) = head_of(X2)
    | ~ precedes(X1,X2,esk5_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_16]) ).

cnf(c_0_33,negated_conjecture,
    ( head_of(esk4_0) != head_of(X1)
    | tail_of(esk3_0) != tail_of(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ sequential(X1,esk3_0)
    | ~ sequential(esk4_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).

cnf(c_0_35,negated_conjecture,
    ( esk7_4(esk1_0,esk2_0,X1,X2) = X1
    | sequential(esk7_4(esk1_0,esk2_0,X1,X2),X1)
    | ~ precedes(X1,X2,esk5_0)
    | ~ edge(X1) ),
    inference(er,[status(thm)],[c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    edge(esk3_0),
    inference(spm,[status(thm)],[c_0_21,c_0_30]) ).

cnf(c_0_37,negated_conjecture,
    ( X1 = esk7_4(esk1_0,esk2_0,X2,X3)
    | sequential(X1,esk7_4(esk1_0,esk2_0,X2,X3))
    | head_of(X3) != head_of(X1)
    | ~ precedes(X2,X3,esk5_0)
    | ~ edge(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_24]) ).

cnf(c_0_38,plain,
    ( edge(X2)
    | ~ sequential(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_39,negated_conjecture,
    ( tail_of(esk7_4(esk1_0,esk2_0,X1,X2)) != tail_of(esk3_0)
    | head_of(esk4_0) != tail_of(X1)
    | ~ precedes(X1,X2,esk5_0) ),
    inference(spm,[status(thm)],[c_0_33,c_0_23]) ).

cnf(c_0_40,negated_conjecture,
    ( esk7_4(esk1_0,esk2_0,esk3_0,X1) = esk3_0
    | ~ precedes(esk3_0,X1,esk5_0)
    | ~ sequential(esk4_0,esk7_4(esk1_0,esk2_0,esk3_0,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).

cnf(c_0_41,negated_conjecture,
    ( esk7_4(esk1_0,esk2_0,X1,X2) = X2
    | sequential(X2,esk7_4(esk1_0,esk2_0,X1,X2))
    | ~ precedes(X1,X2,esk5_0)
    | ~ edge(X2) ),
    inference(er,[status(thm)],[c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    edge(esk4_0),
    inference(spm,[status(thm)],[c_0_38,c_0_30]) ).

cnf(c_0_43,negated_conjecture,
    ( head_of(X1) != tail_of(esk3_0)
    | head_of(esk4_0) != tail_of(X2)
    | ~ precedes(X2,X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_39,c_0_32]) ).

fof(c_0_44,plain,
    ! [X2] :
      ( ~ edge(X2)
      | head_of(X2) != tail_of(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[no_loops])]) ).

cnf(c_0_45,plain,
    ( head_of(X1) = tail_of(X2)
    | ~ sequential(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_46,negated_conjecture,
    ( esk7_4(esk1_0,esk2_0,esk3_0,esk4_0) = esk4_0
    | esk7_4(esk1_0,esk2_0,esk3_0,esk4_0) = esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_27]),c_0_42])]) ).

cnf(c_0_47,negated_conjecture,
    head_of(esk4_0) != tail_of(esk3_0),
    inference(spm,[status(thm)],[c_0_43,c_0_27]) ).

cnf(c_0_48,plain,
    ( head_of(X1) != tail_of(X1)
    | ~ edge(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    head_of(esk3_0) = tail_of(esk4_0),
    inference(spm,[status(thm)],[c_0_45,c_0_30]) ).

cnf(c_0_50,negated_conjecture,
    esk7_4(esk1_0,esk2_0,esk3_0,esk4_0) = esk3_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_46]),c_0_27])]),c_0_47]) ).

cnf(c_0_51,negated_conjecture,
    tail_of(esk4_0) != tail_of(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36])]) ).

cnf(c_0_52,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_50]),c_0_49]),c_0_27])]),c_0_51]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRA008+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n027.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 May 31 01:07:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.40  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40  # Preprocessing time       : 0.018 s
% 0.22/1.40  
% 0.22/1.40  # Proof found!
% 0.22/1.40  # SZS status Theorem
% 0.22/1.40  # SZS output start CNFRefutation
% See solution above
% 0.22/1.40  # Proof object total steps             : 53
% 0.22/1.40  # Proof object clause steps            : 40
% 0.22/1.40  # Proof object formula steps           : 13
% 0.22/1.40  # Proof object conjectures             : 29
% 0.22/1.40  # Proof object clause conjectures      : 26
% 0.22/1.40  # Proof object formula conjectures     : 3
% 0.22/1.40  # Proof object initial clauses used    : 15
% 0.22/1.40  # Proof object initial formulas used   : 6
% 0.22/1.40  # Proof object generating inferences   : 21
% 0.22/1.40  # Proof object simplifying inferences  : 27
% 0.22/1.40  # Training examples: 0 positive, 0 negative
% 0.22/1.40  # Parsed axioms                        : 19
% 0.22/1.40  # Removed by relevancy pruning/SinE    : 9
% 0.22/1.40  # Initial clauses                      : 38
% 0.22/1.40  # Removed in clause preprocessing      : 1
% 0.22/1.40  # Initial clauses in saturation        : 37
% 0.22/1.40  # Processed clauses                    : 208
% 0.22/1.40  # ...of these trivial                  : 1
% 0.22/1.40  # ...subsumed                          : 55
% 0.22/1.40  # ...remaining for further processing  : 152
% 0.22/1.40  # Other redundant clauses eliminated   : 1
% 0.22/1.40  # Clauses deleted for lack of memory   : 0
% 0.22/1.40  # Backward-subsumed                    : 4
% 0.22/1.40  # Backward-rewritten                   : 6
% 0.22/1.40  # Generated clauses                    : 570
% 0.22/1.40  # ...of the previous two non-trivial   : 468
% 0.22/1.40  # Contextual simplify-reflections      : 40
% 0.22/1.40  # Paramodulations                      : 549
% 0.22/1.40  # Factorizations                       : 14
% 0.22/1.40  # Equation resolutions                 : 7
% 0.22/1.40  # Current number of processed clauses  : 141
% 0.22/1.40  #    Positive orientable unit clauses  : 15
% 0.22/1.40  #    Positive unorientable unit clauses: 0
% 0.22/1.40  #    Negative unit clauses             : 5
% 0.22/1.40  #    Non-unit-clauses                  : 121
% 0.22/1.40  # Current number of unprocessed clauses: 269
% 0.22/1.40  # ...number of literals in the above   : 1626
% 0.22/1.40  # Current number of archived formulas  : 0
% 0.22/1.40  # Current number of archived clauses   : 10
% 0.22/1.40  # Clause-clause subsumption calls (NU) : 2000
% 0.22/1.40  # Rec. Clause-clause subsumption calls : 881
% 0.22/1.40  # Non-unit clause-clause subsumptions  : 64
% 0.22/1.40  # Unit Clause-clause subsumption calls : 229
% 0.22/1.40  # Rewrite failures with RHS unbound    : 0
% 0.22/1.40  # BW rewrite match attempts            : 10
% 0.22/1.40  # BW rewrite match successes           : 5
% 0.22/1.40  # Condensation attempts                : 0
% 0.22/1.40  # Condensation successes               : 0
% 0.22/1.40  # Termbank termtop insertions          : 17623
% 0.22/1.40  
% 0.22/1.40  # -------------------------------------------------
% 0.22/1.40  # User time                : 0.038 s
% 0.22/1.40  # System time              : 0.004 s
% 0.22/1.40  # Total time               : 0.042 s
% 0.22/1.40  # Maximum resident set size: 3556 pages
% 0.22/23.40  eprover: CPU time limit exceeded, terminating
% 0.22/23.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43  eprover: No such file or directory
% 0.22/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------