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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC075+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n032.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 : Tue Jul 19 20:26:32 EDT 2022

% Result   : Theorem 0.19s 1.36s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   54 (  26 unt;   0 def)
%            Number of atoms       :  167 (  55 equ)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  188 (  75   ~;  71   |;  25   &)
%                                         (   2 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   50 (   0 sgn  29   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | ? [X5] :
                      ( ssList(X5)
                      & neq(X5,nil)
                      & segmentP(X2,X5)
                      & segmentP(X1,X5) )
                  | ! [X6] :
                      ( ssList(X6)
                     => ! [X7] :
                          ( ~ ssList(X7)
                          | app(X6,X7) != X4
                          | app(X7,X6) != X3 ) )
                  | ( nil = X2
                    & nil = X1 ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).

fof(ax28,axiom,
    ! [X1] :
      ( ssList(X1)
     => app(nil,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).

fof(ax7,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( segmentP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(app(X3,X2),X4) = X1 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).

fof(ax84,axiom,
    ! [X1] :
      ( ssList(X1)
     => app(X1,nil) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(ax55,axiom,
    ! [X1] :
      ( ssList(X1)
     => segmentP(X1,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X5,nil)
                        & segmentP(X2,X5)
                        & segmentP(X1,X5) )
                    | ! [X6] :
                        ( ssList(X6)
                       => ! [X7] :
                            ( ~ ssList(X7)
                            | app(X6,X7) != X4
                            | app(X7,X6) != X3 ) )
                    | ( nil = X2
                      & nil = X1 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_8,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(nil,X2) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).

fof(c_0_9,negated_conjecture,
    ! [X12] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( ~ ssList(X12)
        | ~ neq(X12,nil)
        | ~ segmentP(esk2_0,X12)
        | ~ segmentP(esk1_0,X12) )
      & ssList(esk5_0)
      & ssList(esk6_0)
      & app(esk5_0,esk6_0) = esk4_0
      & app(esk6_0,esk5_0) = esk3_0
      & ( nil != esk2_0
        | nil != esk1_0 ) ),
    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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])]) ).

fof(c_0_10,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk7_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk8_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk7_2(X5,X6),X6),esk8_2(X5,X6)) = X5
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ~ ssList(X9)
        | ~ ssList(X10)
        | app(app(X9,X6),X10) != X5
        | segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(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)],[ax7])])])])])])]) ).

cnf(c_0_11,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ssList(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    app(esk5_0,esk6_0) = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_15,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(X2,nil) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_16,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    app(nil,esk6_0) = esk6_0,
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_19,negated_conjecture,
    app(esk6_0,esk5_0) = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_20,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_21,negated_conjecture,
    app(esk5_0,esk6_0) = esk2_0,
    inference(rw,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_22,negated_conjecture,
    ssList(esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,plain,
    ( app(X1,nil) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_25,plain,
    ! [X3,X4] :
      ( ( ~ neq(X3,X4)
        | X3 != X4
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( X3 = X4
        | neq(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) ) ),
    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)],[ax15])])])])])]) ).

cnf(c_0_26,negated_conjecture,
    ( segmentP(X1,esk6_0)
    | app(esk6_0,X2) != X1
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_12])]) ).

cnf(c_0_27,negated_conjecture,
    app(esk6_0,esk5_0) = esk1_0,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_28,negated_conjecture,
    ( segmentP(X1,esk6_0)
    | app(esk2_0,X2) != X1
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_22]),c_0_12])]) ).

cnf(c_0_29,negated_conjecture,
    app(esk2_0,nil) = esk2_0,
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_30,plain,
    ( neq(X1,X2)
    | X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    ( segmentP(X1,esk6_0)
    | esk1_0 != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]) ).

cnf(c_0_32,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_33,negated_conjecture,
    ( segmentP(X1,esk6_0)
    | esk2_0 != X1
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_18])]) ).

cnf(c_0_34,plain,
    ( X1 = nil
    | neq(X1,nil)
    | ~ ssList(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_18]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ segmentP(esk1_0,X1)
    | ~ segmentP(esk2_0,X1)
    | ~ neq(X1,nil)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_36,negated_conjecture,
    segmentP(esk1_0,esk6_0),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    segmentP(esk2_0,esk6_0),
    inference(spm,[status(thm)],[c_0_33,c_0_24]) ).

fof(c_0_38,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | segmentP(X2,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax55])]) ).

cnf(c_0_39,negated_conjecture,
    ( esk6_0 = nil
    | neq(esk6_0,nil) ),
    inference(spm,[status(thm)],[c_0_34,c_0_12]) ).

cnf(c_0_40,negated_conjecture,
    ~ neq(esk6_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_12])]) ).

cnf(c_0_41,plain,
    ( segmentP(X1,X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    esk6_0 = nil,
    inference(sr,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    app(nil,esk5_0) = esk5_0,
    inference(spm,[status(thm)],[c_0_11,c_0_22]) ).

cnf(c_0_44,negated_conjecture,
    segmentP(esk1_0,esk1_0),
    inference(spm,[status(thm)],[c_0_41,c_0_32]) ).

cnf(c_0_45,negated_conjecture,
    app(esk5_0,nil) = esk5_0,
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_46,negated_conjecture,
    esk5_0 = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_42]),c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ segmentP(esk2_0,esk1_0)
    | ~ neq(esk1_0,nil) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_44]),c_0_32])]) ).

cnf(c_0_48,negated_conjecture,
    esk2_0 = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_42]),c_0_45]),c_0_46]) ).

cnf(c_0_49,negated_conjecture,
    ( nil != esk1_0
    | nil != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_50,negated_conjecture,
    ( esk1_0 = nil
    | neq(esk1_0,nil) ),
    inference(spm,[status(thm)],[c_0_34,c_0_32]) ).

cnf(c_0_51,negated_conjecture,
    ~ neq(esk1_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_44])]) ).

cnf(c_0_52,negated_conjecture,
    esk1_0 != nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48])]) ).

cnf(c_0_53,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_50,c_0_51]),c_0_52]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem  : SWC075+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.10  % Command  : run_ET %s %d
% 0.11/0.30  % Computer : n032.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit : 300
% 0.11/0.30  % WCLimit  : 600
% 0.11/0.30  % DateTime : Sat Jun 11 23:01:55 EDT 2022
% 0.11/0.30  % CPUTime  : 
% 0.19/1.36  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.19/1.36  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.19/1.36  # Preprocessing time       : 0.014 s
% 0.19/1.36  
% 0.19/1.36  # Proof found!
% 0.19/1.36  # SZS status Theorem
% 0.19/1.36  # SZS output start CNFRefutation
% See solution above
% 0.19/1.36  # Proof object total steps             : 54
% 0.19/1.36  # Proof object clause steps            : 40
% 0.19/1.36  # Proof object formula steps           : 14
% 0.19/1.36  # Proof object conjectures             : 36
% 0.19/1.36  # Proof object clause conjectures      : 33
% 0.19/1.36  # Proof object formula conjectures     : 3
% 0.19/1.36  # Proof object initial clauses used    : 16
% 0.19/1.36  # Proof object initial formulas used   : 7
% 0.19/1.36  # Proof object generating inferences   : 16
% 0.19/1.36  # Proof object simplifying inferences  : 30
% 0.19/1.36  # Training examples: 0 positive, 0 negative
% 0.19/1.36  # Parsed axioms                        : 96
% 0.19/1.36  # Removed by relevancy pruning/SinE    : 70
% 0.19/1.36  # Initial clauses                      : 50
% 0.19/1.36  # Removed in clause preprocessing      : 0
% 0.19/1.36  # Initial clauses in saturation        : 50
% 0.19/1.36  # Processed clauses                    : 1475
% 0.19/1.36  # ...of these trivial                  : 83
% 0.19/1.36  # ...subsumed                          : 32
% 0.19/1.36  # ...remaining for further processing  : 1359
% 0.19/1.36  # Other redundant clauses eliminated   : 2
% 0.19/1.36  # Clauses deleted for lack of memory   : 0
% 0.19/1.36  # Backward-subsumed                    : 0
% 0.19/1.36  # Backward-rewritten                   : 1175
% 0.19/1.36  # Generated clauses                    : 40062
% 0.19/1.36  # ...of the previous two non-trivial   : 40410
% 0.19/1.36  # Contextual simplify-reflections      : 67
% 0.19/1.36  # Paramodulations                      : 40003
% 0.19/1.36  # Factorizations                       : 0
% 0.19/1.36  # Equation resolutions                 : 33
% 0.19/1.36  # Current number of processed clauses  : 156
% 0.19/1.36  #    Positive orientable unit clauses  : 50
% 0.19/1.36  #    Positive unorientable unit clauses: 0
% 0.19/1.36  #    Negative unit clauses             : 4
% 0.19/1.36  #    Non-unit-clauses                  : 102
% 0.19/1.36  # Current number of unprocessed clauses: 1302
% 0.19/1.36  # ...number of literals in the above   : 3229
% 0.19/1.36  # Current number of archived formulas  : 0
% 0.19/1.36  # Current number of archived clauses   : 1201
% 0.19/1.36  # Clause-clause subsumption calls (NU) : 62700
% 0.19/1.36  # Rec. Clause-clause subsumption calls : 51017
% 0.19/1.36  # Non-unit clause-clause subsumptions  : 98
% 0.19/1.36  # Unit Clause-clause subsumption calls : 5809
% 0.19/1.36  # Rewrite failures with RHS unbound    : 0
% 0.19/1.36  # BW rewrite match attempts            : 3762
% 0.19/1.36  # BW rewrite match successes           : 17
% 0.19/1.36  # Condensation attempts                : 0
% 0.19/1.36  # Condensation successes               : 0
% 0.19/1.36  # Termbank termtop insertions          : 781250
% 0.19/1.36  
% 0.19/1.36  # -------------------------------------------------
% 0.19/1.36  # User time                : 0.341 s
% 0.19/1.36  # System time              : 0.018 s
% 0.19/1.36  # Total time               : 0.359 s
% 0.19/1.36  # Maximum resident set size: 34320 pages
% 0.19/23.35  eprover: CPU time limit exceeded, terminating
% 0.19/23.36  eprover: CPU time limit exceeded, terminating
% 0.19/23.37  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.37  eprover: No such file or directory
% 0.19/23.37  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.37  eprover: No such file or directory
% 0.19/23.37  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.37  eprover: No such file or directory
% 0.19/23.37  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.37  eprover: No such file or directory
% 0.19/23.38  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.38  eprover: No such file or directory
% 0.19/23.38  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.38  eprover: No such file or directory
% 0.19/23.38  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.38  eprover: No such file or directory
% 0.19/23.38  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.38  eprover: No such file or directory
% 0.19/23.39  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.39  eprover: No such file or directory
% 0.19/23.39  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.39  eprover: No such file or directory
% 0.19/23.39  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.39  eprover: No such file or directory
% 0.19/23.39  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.39  eprover: No such file or directory
% 0.19/23.40  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.40  eprover: No such file or directory
% 0.19/23.40  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.40  eprover: No such file or directory
% 0.19/23.40  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.40  eprover: No such file or directory
% 0.19/23.40  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.40  eprover: No such file or directory
% 0.19/23.40  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.40  eprover: No such file or directory
% 0.19/23.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.41  eprover: No such file or directory
% 0.19/23.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.41  eprover: No such file or directory
% 0.19/23.41  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.41  eprover: No such file or directory
% 0.19/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.42  eprover: No such file or directory
% 0.19/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.19/23.42  eprover: No such file or directory
%------------------------------------------------------------------------------