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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC236+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:27:31 EDT 2022

% Result   : Theorem 0.38s 25.56s
% Output   : CNFRefutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (   5 unt;   0 def)
%            Number of atoms       :  213 (  63 equ)
%            Maximal formula atoms :   52 (   6 avg)
%            Number of connectives :  284 ( 104   ~; 103   |;  56   &)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (   7 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :   89 (   0 sgn  39   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | nil = X1
                    | ? [X5] :
                        ( ssItem(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & ? [X7] :
                                ( ssList(X7)
                                & app(app(X6,cons(X5,nil)),X7) = X1
                                & ! [X8] :
                                    ( ssItem(X8)
                                   => ( ~ memberP(X6,X8)
                                      | ~ memberP(X7,X8)
                                      | ~ leq(X5,X8)
                                      | lt(X5,X8) ) ) ) ) )
                    | ! [X9] :
                        ( ssList(X9)
                       => ! [X10] :
                            ( ssList(X10)
                           => ( app(app(X9,X3),X10) != X4
                              | ~ totalorderedP(X3)
                              | ? [X11] :
                                  ( ssItem(X11)
                                  & ? [X12] :
                                      ( ssList(X12)
                                      & app(X12,cons(X11,nil)) = X9
                                      & ? [X13] :
                                          ( ssItem(X13)
                                          & ? [X14] :
                                              ( ssList(X14)
                                              & app(cons(X13,nil),X14) = X3
                                              & leq(X11,X13) ) ) ) )
                              | ? [X15] :
                                  ( ssItem(X15)
                                  & ? [X16] :
                                      ( ssList(X16)
                                      & app(cons(X15,nil),X16) = X10
                                      & ? [X17] :
                                          ( ssItem(X17)
                                          & ? [X18] :
                                              ( ssList(X18)
                                              & app(X18,cons(X17,nil)) = X3
                                              & leq(X17,X15) ) ) ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 ) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

fof(ax38,axiom,
    ! [X1] :
      ( ssItem(X1)
     => ~ memberP(nil,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).

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

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

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

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

fof(ax20,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil = X1
        | ? [X2] :
            ( ssList(X2)
            & ? [X3] :
                ( ssItem(X3)
                & cons(X3,X2) = X1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | nil = X1
                      | ? [X5] :
                          ( ssItem(X5)
                          & ? [X6] :
                              ( ssList(X6)
                              & ? [X7] :
                                  ( ssList(X7)
                                  & app(app(X6,cons(X5,nil)),X7) = X1
                                  & ! [X8] :
                                      ( ssItem(X8)
                                     => ( ~ memberP(X6,X8)
                                        | ~ memberP(X7,X8)
                                        | ~ leq(X5,X8)
                                        | lt(X5,X8) ) ) ) ) )
                      | ! [X9] :
                          ( ssList(X9)
                         => ! [X10] :
                              ( ssList(X10)
                             => ( app(app(X9,X3),X10) != X4
                                | ~ totalorderedP(X3)
                                | ? [X11] :
                                    ( ssItem(X11)
                                    & ? [X12] :
                                        ( ssList(X12)
                                        & app(X12,cons(X11,nil)) = X9
                                        & ? [X13] :
                                            ( ssItem(X13)
                                            & ? [X14] :
                                                ( ssList(X14)
                                                & app(cons(X13,nil),X14) = X3
                                                & leq(X11,X13) ) ) ) )
                                | ? [X15] :
                                    ( ssItem(X15)
                                    & ? [X16] :
                                        ( ssList(X16)
                                        & app(cons(X15,nil),X16) = X10
                                        & ? [X17] :
                                            ( ssItem(X17)
                                            & ? [X18] :
                                                ( ssList(X18)
                                                & app(X18,cons(X17,nil)) = X3
                                                & leq(X17,X15) ) ) ) ) ) ) )
                      | ( nil != X4
                        & nil = X3 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_8,plain,
    ! [X2] :
      ( ~ ssItem(X2)
      | ~ memberP(nil,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).

fof(c_0_9,negated_conjecture,
    ! [X23,X24,X25,X29,X30,X31,X32,X33,X34,X35,X36] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & nil != esk1_0
      & ( ssItem(esk5_3(X23,X24,X25))
        | ~ ssList(X25)
        | app(app(X24,cons(X23,nil)),X25) != esk1_0
        | ~ ssList(X24)
        | ~ ssItem(X23) )
      & ( memberP(X24,esk5_3(X23,X24,X25))
        | ~ ssList(X25)
        | app(app(X24,cons(X23,nil)),X25) != esk1_0
        | ~ ssList(X24)
        | ~ ssItem(X23) )
      & ( memberP(X25,esk5_3(X23,X24,X25))
        | ~ ssList(X25)
        | app(app(X24,cons(X23,nil)),X25) != esk1_0
        | ~ ssList(X24)
        | ~ ssItem(X23) )
      & ( leq(X23,esk5_3(X23,X24,X25))
        | ~ ssList(X25)
        | app(app(X24,cons(X23,nil)),X25) != esk1_0
        | ~ ssList(X24)
        | ~ ssItem(X23) )
      & ( ~ lt(X23,esk5_3(X23,X24,X25))
        | ~ ssList(X25)
        | app(app(X24,cons(X23,nil)),X25) != esk1_0
        | ~ ssList(X24)
        | ~ ssItem(X23) )
      & ssList(esk6_0)
      & ssList(esk7_0)
      & app(app(esk6_0,esk3_0),esk7_0) = esk4_0
      & totalorderedP(esk3_0)
      & ( ~ ssItem(X29)
        | ~ ssList(X30)
        | app(X30,cons(X29,nil)) != esk6_0
        | ~ ssItem(X31)
        | ~ ssList(X32)
        | app(cons(X31,nil),X32) != esk3_0
        | ~ leq(X29,X31) )
      & ( ~ ssItem(X33)
        | ~ ssList(X34)
        | app(cons(X33,nil),X34) != esk7_0
        | ~ ssItem(X35)
        | ~ ssList(X36)
        | app(X36,cons(X35,nil)) != esk3_0
        | ~ leq(X35,X33) )
      & ( nil = esk4_0
        | nil != esk3_0 ) ),
    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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])])]) ).

cnf(c_0_10,plain,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ( memberP(X2,esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_13,negated_conjecture,
    ( app(app(nil,cons(X1,nil)),X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(esk5_3(X1,nil,X2))
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).

cnf(c_0_14,negated_conjecture,
    ( ssItem(esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_16,negated_conjecture,
    ( app(app(nil,cons(X1,nil)),X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12])]) ).

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

fof(c_0_18,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | cons(X4,X3) = app(cons(X4,nil),X3) ),
    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)],[ax81])])])])]) ).

cnf(c_0_19,negated_conjecture,
    ( app(cons(X1,nil),X2) != esk1_0
    | ~ ssList(cons(X1,nil))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( cons(X1,X2) = app(cons(X1,nil),X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

fof(c_0_21,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(cons(X4,X3)) ),
    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)],[ax16])])])])]) ).

cnf(c_0_22,negated_conjecture,
    ( cons(X1,X2) != esk1_0
    | ~ ssList(cons(X1,nil))
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(pm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_24,plain,
    ! [X4] :
      ( ( ssList(esk8_1(X4))
        | nil = X4
        | ~ ssList(X4) )
      & ( ssItem(esk9_1(X4))
        | nil = X4
        | ~ ssList(X4) )
      & ( cons(esk9_1(X4),esk8_1(X4)) = X4
        | nil = X4
        | ~ ssList(X4) ) ),
    inference(distribute,[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)],[ax20])])])])])]) ).

cnf(c_0_25,negated_conjecture,
    ( cons(X1,X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]) ).

cnf(c_0_26,plain,
    ( nil = X1
    | cons(esk9_1(X1),esk8_1(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_27,plain,
    ( nil = X1
    | ssItem(esk9_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_28,plain,
    ( nil = X1
    | ssList(esk8_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( nil = X1
    | X1 != esk1_0
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).

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

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

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC236+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : run_ET %s %d
% 0.12/0.32  % Computer : n032.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sun Jun 12 23:18:41 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.36/23.40  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.36/23.40  
% 0.36/23.40  eprover: CPU time limit exceeded, terminating
% 0.36/23.41  eprover: CPU time limit exceeded, terminating
% 0.38/25.56  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.38/25.56  
% 0.38/25.56  # Failure: Resource limit exceeded (time)
% 0.38/25.56  # OLD status Res
% 0.38/25.56  # Preprocessing time       : 0.025 s
% 0.38/25.56  # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.38/25.56  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.38/25.56  # Preprocessing time       : 0.015 s
% 0.38/25.56  
% 0.38/25.56  # Proof found!
% 0.38/25.56  # SZS status Theorem
% 0.38/25.56  # SZS output start CNFRefutation
% See solution above
% 0.38/25.56  # Proof object total steps             : 33
% 0.38/25.56  # Proof object clause steps            : 19
% 0.38/25.56  # Proof object formula steps           : 14
% 0.38/25.56  # Proof object conjectures             : 14
% 0.38/25.56  # Proof object clause conjectures      : 11
% 0.38/25.56  # Proof object formula conjectures     : 3
% 0.38/25.56  # Proof object initial clauses used    : 12
% 0.38/25.56  # Proof object initial formulas used   : 7
% 0.38/25.56  # Proof object generating inferences   : 7
% 0.38/25.56  # Proof object simplifying inferences  : 9
% 0.38/25.56  # Training examples: 0 positive, 0 negative
% 0.38/25.56  # Parsed axioms                        : 96
% 0.38/25.56  # Removed by relevancy pruning/SinE    : 52
% 0.38/25.56  # Initial clauses                      : 91
% 0.38/25.56  # Removed in clause preprocessing      : 1
% 0.38/25.56  # Initial clauses in saturation        : 90
% 0.38/25.56  # Processed clauses                    : 4620
% 0.38/25.56  # ...of these trivial                  : 111
% 0.38/25.56  # ...subsumed                          : 3435
% 0.38/25.56  # ...remaining for further processing  : 1074
% 0.38/25.56  # Other redundant clauses eliminated   : 75
% 0.38/25.56  # Clauses deleted for lack of memory   : 0
% 0.38/25.56  # Backward-subsumed                    : 126
% 0.38/25.56  # Backward-rewritten                   : 26
% 0.38/25.56  # Generated clauses                    : 32006
% 0.38/25.56  # ...of the previous two non-trivial   : 29317
% 0.38/25.56  # Contextual simplify-reflections      : 3688
% 0.38/25.56  # Paramodulations                      : 31333
% 0.38/25.56  # Factorizations                       : 0
% 0.38/25.56  # Equation resolutions                 : 145
% 0.38/25.56  # Current number of processed clauses  : 918
% 0.38/25.56  #    Positive orientable unit clauses  : 23
% 0.38/25.56  #    Positive unorientable unit clauses: 0
% 0.38/25.56  #    Negative unit clauses             : 51
% 0.38/25.56  #    Non-unit-clauses                  : 844
% 0.38/25.56  # Current number of unprocessed clauses: 21922
% 0.38/25.56  # ...number of literals in the above   : 150103
% 0.38/25.56  # Current number of archived formulas  : 0
% 0.38/25.56  # Current number of archived clauses   : 152
% 0.38/25.56  # Clause-clause subsumption calls (NU) : 433842
% 0.38/25.56  # Rec. Clause-clause subsumption calls : 76579
% 0.38/25.56  # Non-unit clause-clause subsumptions  : 6076
% 0.38/25.56  # Unit Clause-clause subsumption calls : 14171
% 0.38/25.56  # Rewrite failures with RHS unbound    : 0
% 0.38/25.56  # BW rewrite match attempts            : 10
% 0.38/25.56  # BW rewrite match successes           : 10
% 0.38/25.56  # Condensation attempts                : 0
% 0.38/25.56  # Condensation successes               : 0
% 0.38/25.56  # Termbank termtop insertions          : 566918
% 0.38/25.56  
% 0.38/25.56  # -------------------------------------------------
% 0.38/25.56  # User time                : 1.768 s
% 0.38/25.56  # System time              : 0.011 s
% 0.38/25.56  # Total time               : 1.779 s
% 0.38/25.56  # Maximum resident set size: 24936 pages
% 0.38/46.42  eprover: CPU time limit exceeded, terminating
% 0.38/46.42  eprover: CPU time limit exceeded, terminating
% 0.38/46.42  eprover: CPU time limit exceeded, terminating
% 0.38/46.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.43  eprover: No such file or directory
% 0.38/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.44  eprover: No such file or directory
% 0.38/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.44  eprover: No such file or directory
% 0.38/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.44  eprover: No such file or directory
% 0.38/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.44  eprover: No such file or directory
% 0.38/46.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.44  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.45  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.46  eprover: No such file or directory
% 0.38/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.47  eprover: No such file or directory
% 0.38/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.47  eprover: No such file or directory
% 0.38/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.47  eprover: No such file or directory
% 0.38/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.47  eprover: No such file or directory
% 0.38/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.47  eprover: No such file or directory
% 0.38/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.48  eprover: No such file or directory
% 0.38/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.38/46.48  eprover: No such file or directory
% 0.38/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.48  eprover: No such file or directory
% 0.38/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.38/46.48  eprover: No such file or directory
%------------------------------------------------------------------------------