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

View Problem - Process Solution

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

% Computer : n004.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 09:20:06 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   51 (  11 unt;   0 def)
%            Number of atoms       :  141 (  53 equ)
%            Maximal formula atoms :   20 (   2 avg)
%            Number of connectives :  147 (  57   ~;  61   |;  16   &)
%                                         (   7 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   3 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   71 (  11 sgn  39   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
     => ( k5_setfam_1(X1,X2) = k1_xboole_0
      <=> ! [X3] :
            ( r2_hidden(X3,X2)
           => X3 = k1_xboole_0 ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t30_relset_2) ).

fof(t6_boole,axiom,
    ! [X1] :
      ( v1_xboole_0(X1)
     => X1 = k1_xboole_0 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).

fof(rc2_subset_1,axiom,
    ! [X1] :
    ? [X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(X1))
      & v1_xboole_0(X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc2_subset_1) ).

fof(redefinition_k5_setfam_1,axiom,
    ! [X1,X2] :
      ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
     => k5_setfam_1(X1,X2) = k3_tarski(X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k5_setfam_1) ).

fof(d4_tarski,axiom,
    ! [X1,X2] :
      ( X2 = k3_tarski(X1)
    <=> ! [X3] :
          ( r2_hidden(X3,X2)
        <=> ? [X4] :
              ( r2_hidden(X3,X4)
              & r2_hidden(X4,X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).

fof(t5_subset,axiom,
    ! [X1,X2,X3] :
      ~ ( r2_hidden(X1,X2)
        & m1_subset_1(X2,k1_zfmisc_1(X3))
        & v1_xboole_0(X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_subset) ).

fof(d1_xboole_0,axiom,
    ! [X1] :
      ( X1 = k1_xboole_0
    <=> ! [X2] : ~ r2_hidden(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).

fof(fc12_relat_1,axiom,
    ( v1_xboole_0(k1_xboole_0)
    & v1_relat_1(k1_xboole_0)
    & v3_relat_1(k1_xboole_0) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc12_relat_1) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X1,X2] :
        ( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
       => ( k5_setfam_1(X1,X2) = k1_xboole_0
        <=> ! [X3] :
              ( r2_hidden(X3,X2)
             => X3 = k1_xboole_0 ) ) ),
    inference(assume_negation,[status(cth)],[t30_relset_2]) ).

fof(c_0_9,plain,
    ! [X2] :
      ( ~ v1_xboole_0(X2)
      | X2 = k1_xboole_0 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).

fof(c_0_10,plain,
    ! [X3] :
      ( m1_subset_1(esk12_1(X3),k1_zfmisc_1(X3))
      & v1_xboole_0(esk12_1(X3)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).

fof(c_0_11,negated_conjecture,
    ! [X7] :
      ( m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
      & ( r2_hidden(esk3_0,esk2_0)
        | k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
      & ( esk3_0 != k1_xboole_0
        | k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
      & ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
        | ~ r2_hidden(X7,esk2_0)
        | X7 = k1_xboole_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)],[c_0_8])])])])])])]) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3)))
      | k5_setfam_1(X3,X4) = k3_tarski(X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).

cnf(c_0_13,plain,
    ( X1 = k1_xboole_0
    | ~ v1_xboole_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    v1_xboole_0(esk12_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X5,X6,X7,X7,X9,X5,X6,X11] :
      ( ( r2_hidden(X7,esk5_3(X5,X6,X7))
        | ~ r2_hidden(X7,X6)
        | X6 != k3_tarski(X5) )
      & ( r2_hidden(esk5_3(X5,X6,X7),X5)
        | ~ r2_hidden(X7,X6)
        | X6 != k3_tarski(X5) )
      & ( ~ r2_hidden(X7,X9)
        | ~ r2_hidden(X9,X5)
        | r2_hidden(X7,X6)
        | X6 != k3_tarski(X5) )
      & ( ~ r2_hidden(esk6_2(X5,X6),X6)
        | ~ r2_hidden(esk6_2(X5,X6),X11)
        | ~ r2_hidden(X11,X5)
        | X6 = k3_tarski(X5) )
      & ( r2_hidden(esk6_2(X5,X6),esk7_2(X5,X6))
        | r2_hidden(esk6_2(X5,X6),X6)
        | X6 = k3_tarski(X5) )
      & ( r2_hidden(esk7_2(X5,X6),X5)
        | r2_hidden(esk6_2(X5,X6),X6)
        | X6 = k3_tarski(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)],[d4_tarski])])])])])])]) ).

cnf(c_0_16,negated_conjecture,
    ( r2_hidden(esk3_0,esk2_0)
    | k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( k5_setfam_1(X1,X2) = k3_tarski(X2)
    | ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_19,plain,
    ! [X4,X5,X6] :
      ( ~ r2_hidden(X4,X5)
      | ~ m1_subset_1(X5,k1_zfmisc_1(X6))
      | ~ v1_xboole_0(X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).

cnf(c_0_20,plain,
    m1_subset_1(esk12_1(X1),k1_zfmisc_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,plain,
    esk12_1(X1) = k1_xboole_0,
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_22,plain,
    ( ~ epred1_0
  <=> ! [X1] : ~ v1_xboole_0(X1) ),
    introduced(definition) ).

cnf(c_0_23,negated_conjecture,
    ( X1 = k1_xboole_0
    | k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
    | ~ r2_hidden(X1,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_24,plain,
    ( X1 = k3_tarski(X2)
    | r2_hidden(esk6_2(X2,X1),X1)
    | r2_hidden(esk7_2(X2,X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_25,plain,
    ( r2_hidden(X3,X1)
    | X1 != k3_tarski(X2)
    | ~ r2_hidden(X4,X2)
    | ~ r2_hidden(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_26,negated_conjecture,
    ( r2_hidden(esk3_0,esk2_0)
    | k3_tarski(esk2_0) != k1_xboole_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

fof(c_0_27,plain,
    ! [X3,X4,X3] :
      ( ( X3 != k1_xboole_0
        | ~ r2_hidden(X4,X3) )
      & ( r2_hidden(esk4_1(X3),X3)
        | X3 = k1_xboole_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)],[d1_xboole_0])])])])])])]) ).

cnf(c_0_28,negated_conjecture,
    ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
    | esk3_0 != k1_xboole_0 ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_29,plain,
    ( ~ epred2_0
  <=> ! [X2] : ~ r2_hidden(X2,k1_xboole_0) ),
    introduced(definition) ).

cnf(c_0_30,plain,
    ( ~ v1_xboole_0(X1)
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1))
    | ~ r2_hidden(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_31,plain,
    m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_32,plain,
    ( epred1_0
    | ~ v1_xboole_0(X1) ),
    inference(split_equiv,[status(thm)],[c_0_22]) ).

cnf(c_0_33,plain,
    v1_xboole_0(k1_xboole_0),
    inference(split_conjunct,[status(thm)],[fc12_relat_1]) ).

cnf(c_0_34,plain,
    ( X1 = k3_tarski(X2)
    | r2_hidden(esk6_2(X2,X1),X1)
    | r2_hidden(esk6_2(X2,X1),esk7_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_35,negated_conjecture,
    ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
    | esk7_2(esk2_0,X1) = k1_xboole_0
    | X1 = k3_tarski(esk2_0)
    | r2_hidden(esk6_2(esk2_0,X1),X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    ( r2_hidden(X1,X2)
    | k3_tarski(esk2_0) != k1_xboole_0
    | X2 != k3_tarski(esk2_0)
    | ~ r2_hidden(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_37,plain,
    ( X1 = k1_xboole_0
    | r2_hidden(esk4_1(X1),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_38,negated_conjecture,
    ( k3_tarski(esk2_0) != k1_xboole_0
    | esk3_0 != k1_xboole_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_18])]) ).

cnf(c_0_39,plain,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22]),c_0_29]) ).

cnf(c_0_40,plain,
    epred1_0,
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_41,plain,
    ( ~ r2_hidden(X1,X2)
    | X2 != k1_xboole_0 ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_42,negated_conjecture,
    ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
    | X1 = k3_tarski(esk2_0)
    | r2_hidden(esk6_2(esk2_0,X1),k1_xboole_0)
    | r2_hidden(esk6_2(esk2_0,X1),X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_43,plain,
    ( epred2_0
    | ~ r2_hidden(X1,k1_xboole_0) ),
    inference(split_equiv,[status(thm)],[c_0_29]) ).

cnf(c_0_44,negated_conjecture,
    ( r2_hidden(esk4_1(esk3_0),X1)
    | k3_tarski(esk2_0) != k1_xboole_0
    | X1 != k3_tarski(esk2_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).

cnf(c_0_45,plain,
    ~ epred2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).

cnf(c_0_46,negated_conjecture,
    ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
    | X1 = k3_tarski(esk2_0)
    | r2_hidden(esk6_2(esk2_0,X1),k1_xboole_0)
    | X1 != k1_xboole_0 ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,negated_conjecture,
    k3_tarski(esk2_0) != k1_xboole_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
    | r2_hidden(esk6_2(esk2_0,k1_xboole_0),k1_xboole_0) ),
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_46]),c_0_47]) ).

cnf(c_0_49,negated_conjecture,
    r2_hidden(esk6_2(esk2_0,k1_xboole_0),k1_xboole_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_48]),c_0_18])]),c_0_47]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_41,c_0_49]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU430+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 20 12:47:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.41  # Preprocessing time       : 0.016 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 51
% 0.22/1.41  # Proof object clause steps            : 33
% 0.22/1.41  # Proof object formula steps           : 18
% 0.22/1.41  # Proof object conjectures             : 18
% 0.22/1.41  # Proof object clause conjectures      : 15
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 17
% 0.22/1.41  # Proof object initial formulas used   : 8
% 0.22/1.41  # Proof object generating inferences   : 14
% 0.22/1.41  # Proof object simplifying inferences  : 15
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 29
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 47
% 0.22/1.41  # Removed in clause preprocessing      : 4
% 0.22/1.41  # Initial clauses in saturation        : 43
% 0.22/1.41  # Processed clauses                    : 372
% 0.22/1.41  # ...of these trivial                  : 8
% 0.22/1.41  # ...subsumed                          : 124
% 0.22/1.41  # ...remaining for further processing  : 240
% 0.22/1.41  # Other redundant clauses eliminated   : 0
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 32
% 0.22/1.41  # Backward-rewritten                   : 21
% 0.22/1.41  # Generated clauses                    : 1131
% 0.22/1.41  # ...of the previous two non-trivial   : 1023
% 0.22/1.41  # Contextual simplify-reflections      : 43
% 0.22/1.41  # Paramodulations                      : 1110
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 7
% 0.22/1.41  # Current number of processed clauses  : 177
% 0.22/1.41  #    Positive orientable unit clauses  : 24
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 12
% 0.22/1.41  #    Non-unit-clauses                  : 141
% 0.22/1.41  # Current number of unprocessed clauses: 574
% 0.22/1.41  # ...number of literals in the above   : 2518
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 61
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 3313
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 2291
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 125
% 0.22/1.41  # Unit Clause-clause subsumption calls : 521
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 11
% 0.22/1.41  # BW rewrite match successes           : 11
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 16130
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.047 s
% 0.22/1.41  # System time              : 0.001 s
% 0.22/1.41  # Total time               : 0.048 s
% 0.22/1.41  # Maximum resident set size: 3968 pages
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 0.22/23.41  eprover: CPU time limit exceeded, terminating
% 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
% 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.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 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
% 0.22/23.44  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.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.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44  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
% 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
% 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.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
% 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
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.47  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
% 0.22/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------