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

View Problem - Process Solution

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

% Computer : n029.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:11 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   32 (  14 unt;   0 def)
%            Number of atoms       :  220 (  42 equ)
%            Maximal formula atoms :   30 (   6 avg)
%            Number of connectives :  280 (  92   ~; 104   |;  53   &)
%                                         (   2 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   30 (   7 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;   7 con; 0-2 aty)
%            Number of variables   :   83 (   0 sgn  48   !;  16   ?)

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

fof(ax13,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( duplicatefreeP(X1)
      <=> ! [X2] :
            ( ssItem(X2)
           => ! [X3] :
                ( ssItem(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ! [X5] :
                        ( ssList(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
                             => X2 != X3 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax13) ).

fof(ax12,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( strictorderedP(X1)
      <=> ! [X2] :
            ( ssItem(X2)
           => ! [X3] :
                ( ssItem(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ! [X5] :
                        ( ssList(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
                             => lt(X2,X3) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax12) ).

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

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ! [X5] :
                          ( ssList(X5)
                         => ! [X6] :
                              ( ssList(X6)
                             => ( app(app(X5,X3),X6) != X4
                                | ~ strictorderedP(X3)
                                | ? [X7] :
                                    ( ssItem(X7)
                                    & ? [X8] :
                                        ( ssList(X8)
                                        & app(X8,cons(X7,nil)) = X5
                                        & ? [X9] :
                                            ( ssItem(X9)
                                            & ? [X10] :
                                                ( ssList(X10)
                                                & app(cons(X9,nil),X10) = X3
                                                & lt(X7,X9) ) ) ) )
                                | ? [X11] :
                                    ( ssItem(X11)
                                    & ? [X12] :
                                        ( ssList(X12)
                                        & app(cons(X11,nil),X12) = X6
                                        & ? [X13] :
                                            ( ssItem(X13)
                                            & ? [X14] :
                                                ( ssList(X14)
                                                & app(X14,cons(X13,nil)) = X3
                                                & lt(X13,X11) ) ) ) ) ) ) )
                      | duplicatefreeP(X1)
                      | ( nil != X4
                        & nil = X3 ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_5,negated_conjecture,
    ! [X21,X22,X23,X24,X25,X26,X27,X28] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ssList(esk5_0)
      & ssList(esk6_0)
      & app(app(esk5_0,esk3_0),esk6_0) = esk4_0
      & strictorderedP(esk3_0)
      & ( ~ ssItem(X21)
        | ~ ssList(X22)
        | app(X22,cons(X21,nil)) != esk5_0
        | ~ ssItem(X23)
        | ~ ssList(X24)
        | app(cons(X23,nil),X24) != esk3_0
        | ~ lt(X21,X23) )
      & ( ~ ssItem(X25)
        | ~ ssList(X26)
        | app(cons(X25,nil),X26) != esk6_0
        | ~ ssItem(X27)
        | ~ ssList(X28)
        | app(X28,cons(X27,nil)) != esk3_0
        | ~ lt(X27,X25) )
      & ~ duplicatefreeP(esk1_0)
      & ( nil = esk4_0
        | nil != esk3_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_4])])])])])])]) ).

fof(c_0_6,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( ( ~ duplicatefreeP(X7)
        | ~ ssItem(X8)
        | ~ ssItem(X9)
        | ~ ssList(X10)
        | ~ ssList(X11)
        | ~ ssList(X12)
        | app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
        | X8 != X9
        | ~ ssList(X7) )
      & ( ssItem(esk7_1(X7))
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( ssItem(esk8_1(X7))
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk9_1(X7))
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk10_1(X7))
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk11_1(X7))
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( app(app(esk9_1(X7),cons(esk7_1(X7),esk10_1(X7))),cons(esk8_1(X7),esk11_1(X7))) = X7
        | duplicatefreeP(X7)
        | ~ ssList(X7) )
      & ( esk7_1(X7) = esk8_1(X7)
        | duplicatefreeP(X7)
        | ~ ssList(X7) ) ),
    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)],[ax13])])])])])])]) ).

cnf(c_0_7,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ duplicatefreeP(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_10,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( ( ~ strictorderedP(X7)
        | ~ ssItem(X8)
        | ~ ssItem(X9)
        | ~ ssList(X10)
        | ~ ssList(X11)
        | ~ ssList(X12)
        | app(app(X10,cons(X8,X11)),cons(X9,X12)) != X7
        | lt(X8,X9)
        | ~ ssList(X7) )
      & ( ssItem(esk16_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssItem(esk17_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk18_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk19_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ssList(esk20_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( app(app(esk18_1(X7),cons(esk16_1(X7),esk19_1(X7))),cons(esk17_1(X7),esk20_1(X7))) = X7
        | strictorderedP(X7)
        | ~ ssList(X7) )
      & ( ~ lt(esk16_1(X7),esk17_1(X7))
        | strictorderedP(X7)
        | ~ ssList(X7) ) ),
    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)],[ax12])])])])])])]) ).

cnf(c_0_11,plain,
    ( duplicatefreeP(X1)
    | esk7_1(X1) = esk8_1(X1)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ssList(esk3_0),
    inference(rw,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ~ duplicatefreeP(esk3_0),
    inference(rw,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_14,plain,
    ( lt(X2,X3)
    | ~ ssList(X1)
    | app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
    | ~ ssList(X6)
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssItem(X3)
    | ~ ssItem(X2)
    | ~ strictorderedP(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( duplicatefreeP(X1)
    | app(app(esk9_1(X1),cons(esk7_1(X1),esk10_1(X1))),cons(esk8_1(X1),esk11_1(X1))) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_16,negated_conjecture,
    esk7_1(esk3_0) = esk8_1(esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_17,plain,
    ( duplicatefreeP(X1)
    | ssList(esk11_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,plain,
    ( duplicatefreeP(X1)
    | ssList(esk10_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_19,plain,
    ( duplicatefreeP(X1)
    | ssList(esk9_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,plain,
    ( duplicatefreeP(X1)
    | ssItem(esk7_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_21,plain,
    ! [X3,X4] :
      ( ~ ssItem(X3)
      | ~ ssItem(X4)
      | ~ lt(X3,X4)
      | ~ lt(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)],[inference(fof_simplification,[status(thm)],[ax33])])])])])]) ).

cnf(c_0_22,plain,
    ( lt(X1,X2)
    | ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
    | ~ ssList(X5)
    | ~ ssList(X4)
    | ~ ssList(X3)
    | ~ ssItem(X2)
    | ~ ssItem(X1) ),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_23,negated_conjecture,
    app(app(esk9_1(esk3_0),cons(esk8_1(esk3_0),esk10_1(esk3_0))),cons(esk8_1(esk3_0),esk11_1(esk3_0))) = esk3_0,
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13]),c_0_16]) ).

cnf(c_0_24,negated_conjecture,
    strictorderedP(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_25,negated_conjecture,
    ssList(esk11_1(esk3_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_13]) ).

cnf(c_0_26,negated_conjecture,
    ssList(esk10_1(esk3_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_13]) ).

cnf(c_0_27,negated_conjecture,
    ssList(esk9_1(esk3_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_13]) ).

cnf(c_0_28,negated_conjecture,
    ssItem(esk8_1(esk3_0)),
    inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_13]),c_0_16]) ).

cnf(c_0_29,plain,
    ( ~ lt(X1,X2)
    | ~ lt(X2,X1)
    | ~ ssItem(X1)
    | ~ ssItem(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    lt(esk8_1(esk3_0),esk8_1(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_12]),c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]),c_0_28])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC181+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 20:10:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.41  # Preprocessing time       : 0.020 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 32
% 0.24/1.41  # Proof object clause steps            : 23
% 0.24/1.41  # Proof object formula steps           : 9
% 0.24/1.41  # Proof object conjectures             : 17
% 0.24/1.41  # Proof object clause conjectures      : 14
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 12
% 0.24/1.41  # Proof object initial formulas used   : 4
% 0.24/1.41  # Proof object generating inferences   : 9
% 0.24/1.41  # Proof object simplifying inferences  : 20
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 96
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 59
% 0.24/1.41  # Initial clauses                      : 78
% 0.24/1.41  # Removed in clause preprocessing      : 1
% 0.24/1.41  # Initial clauses in saturation        : 77
% 0.24/1.41  # Processed clauses                    : 772
% 0.24/1.41  # ...of these trivial                  : 65
% 0.24/1.41  # ...subsumed                          : 16
% 0.24/1.41  # ...remaining for further processing  : 691
% 0.24/1.41  # Other redundant clauses eliminated   : 2
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 3
% 0.24/1.41  # Generated clauses                    : 17688
% 0.24/1.41  # ...of the previous two non-trivial   : 17493
% 0.24/1.41  # Contextual simplify-reflections      : 15
% 0.24/1.41  # Paramodulations                      : 17664
% 0.24/1.41  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 15
% 0.24/1.42  # Current number of processed clauses  : 677
% 0.24/1.42  #    Positive orientable unit clauses  : 258
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 4
% 0.24/1.42  #    Non-unit-clauses                  : 415
% 0.24/1.42  # Current number of unprocessed clauses: 16744
% 0.24/1.42  # ...number of literals in the above   : 47807
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 12
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 16854
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 9679
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 30
% 0.24/1.42  # Unit Clause-clause subsumption calls : 1225
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 1959
% 0.24/1.42  # BW rewrite match successes           : 2
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 325344
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.160 s
% 0.24/1.42  # System time              : 0.015 s
% 0.24/1.42  # Total time               : 0.175 s
% 0.24/1.42  # Maximum resident set size: 18280 pages
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------