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

View Problem - Process Solution

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

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

% Result   : Theorem 0.65s 69.83s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   37 (  12 unt;   0 def)
%            Number of atoms       :  108 (  17 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :  118 (  47   ~;  44   |;  13   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-3 aty)
%            Number of variables   :   56 (   5 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t1_lattice3,lemma,
    ! [X1,X2] :
      ( element(X2,the_carrier(boole_lattice(X1)))
     => ! [X3] :
          ( element(X3,the_carrier(boole_lattice(X1)))
         => ( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
            & meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_lattice3) ).

fof(d3_lattices,axiom,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & join_semilatt_str(X1) )
     => ! [X2] :
          ( element(X2,the_carrier(X1))
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ( below(X1,X2,X3)
              <=> join(X1,X2,X3) = X3 ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_lattices) ).

fof(fc1_lattice3,axiom,
    ! [X1] :
      ( ~ empty_carrier(boole_lattice(X1))
      & strict_latt_str(boole_lattice(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_lattice3) ).

fof(t2_lattice3,conjecture,
    ! [X1,X2] :
      ( element(X2,the_carrier(boole_lattice(X1)))
     => ! [X3] :
          ( element(X3,the_carrier(boole_lattice(X1)))
         => ( below(boole_lattice(X1),X2,X3)
          <=> subset(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_lattice3) ).

fof(t12_xboole_1,lemma,
    ! [X1,X2] :
      ( subset(X1,X2)
     => set_union2(X1,X2) = X2 ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_xboole_1) ).

fof(dt_l3_lattices,axiom,
    ! [X1] :
      ( latt_str(X1)
     => ( meet_semilatt_str(X1)
        & join_semilatt_str(X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l3_lattices) ).

fof(dt_k1_lattice3,axiom,
    ! [X1] :
      ( strict_latt_str(boole_lattice(X1))
      & latt_str(boole_lattice(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_lattice3) ).

fof(t7_xboole_1,lemma,
    ! [X1,X2] : subset(X1,set_union2(X1,X2)),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).

fof(c_0_8,lemma,
    ! [X4,X5,X6] :
      ( ( join(boole_lattice(X4),X5,X6) = set_union2(X5,X6)
        | ~ element(X6,the_carrier(boole_lattice(X4)))
        | ~ element(X5,the_carrier(boole_lattice(X4))) )
      & ( meet(boole_lattice(X4),X5,X6) = set_intersection2(X5,X6)
        | ~ element(X6,the_carrier(boole_lattice(X4)))
        | ~ element(X5,the_carrier(boole_lattice(X4))) ) ),
    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)],[t1_lattice3])])])])])]) ).

fof(c_0_9,plain,
    ! [X4,X5,X6] :
      ( ( ~ below(X4,X5,X6)
        | join(X4,X5,X6) = X6
        | ~ element(X6,the_carrier(X4))
        | ~ element(X5,the_carrier(X4))
        | empty_carrier(X4)
        | ~ join_semilatt_str(X4) )
      & ( join(X4,X5,X6) != X6
        | below(X4,X5,X6)
        | ~ element(X6,the_carrier(X4))
        | ~ element(X5,the_carrier(X4))
        | empty_carrier(X4)
        | ~ join_semilatt_str(X4) ) ),
    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)],[d3_lattices])])])])])])]) ).

fof(c_0_10,plain,
    ! [X2,X2] :
      ( ~ empty_carrier(boole_lattice(X2))
      & strict_latt_str(boole_lattice(X2)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_lattice3])])])]) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X1,X2] :
        ( element(X2,the_carrier(boole_lattice(X1)))
       => ! [X3] :
            ( element(X3,the_carrier(boole_lattice(X1)))
           => ( below(boole_lattice(X1),X2,X3)
            <=> subset(X2,X3) ) ) ),
    inference(assume_negation,[status(cth)],[t2_lattice3]) ).

cnf(c_0_12,lemma,
    ( join(boole_lattice(X2),X1,X3) = set_union2(X1,X3)
    | ~ element(X1,the_carrier(boole_lattice(X2)))
    | ~ element(X3,the_carrier(boole_lattice(X2))) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( empty_carrier(X1)
    | join(X1,X2,X3) = X3
    | ~ join_semilatt_str(X1)
    | ~ element(X2,the_carrier(X1))
    | ~ element(X3,the_carrier(X1))
    | ~ below(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ~ empty_carrier(boole_lattice(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,negated_conjecture,
    ( element(esk2_0,the_carrier(boole_lattice(esk1_0)))
    & element(esk3_0,the_carrier(boole_lattice(esk1_0)))
    & ( ~ below(boole_lattice(esk1_0),esk2_0,esk3_0)
      | ~ subset(esk2_0,esk3_0) )
    & ( below(boole_lattice(esk1_0),esk2_0,esk3_0)
      | subset(esk2_0,esk3_0) ) ),
    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_11])])])])]) ).

fof(c_0_16,lemma,
    ! [X3,X4] :
      ( ~ subset(X3,X4)
      | set_union2(X3,X4) = X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).

cnf(c_0_17,lemma,
    ( set_union2(X1,X2) = X2
    | ~ below(boole_lattice(X3),X1,X2)
    | ~ join_semilatt_str(boole_lattice(X3))
    | ~ element(X2,the_carrier(boole_lattice(X3)))
    | ~ element(X1,the_carrier(boole_lattice(X3))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ( subset(esk2_0,esk3_0)
    | below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    element(esk3_0,the_carrier(boole_lattice(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    element(esk2_0,the_carrier(boole_lattice(esk1_0))),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,lemma,
    ( set_union2(X1,X2) = X2
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_22,plain,
    ! [X2] :
      ( ( meet_semilatt_str(X2)
        | ~ latt_str(X2) )
      & ( join_semilatt_str(X2)
        | ~ latt_str(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).

fof(c_0_23,plain,
    ! [X2,X2] :
      ( strict_latt_str(boole_lattice(X2))
      & latt_str(boole_lattice(X2)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_lattice3])])]) ).

fof(c_0_24,lemma,
    ! [X3,X4] : subset(X3,set_union2(X3,X4)),
    inference(variable_rename,[status(thm)],[t7_xboole_1]) ).

cnf(c_0_25,negated_conjecture,
    ( set_union2(esk2_0,esk3_0) = esk3_0
    | ~ join_semilatt_str(boole_lattice(esk1_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).

cnf(c_0_26,plain,
    ( join_semilatt_str(X1)
    | ~ latt_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,plain,
    latt_str(boole_lattice(X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_28,lemma,
    subset(X1,set_union2(X1,X2)),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    set_union2(esk2_0,esk3_0) = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ subset(esk2_0,esk3_0)
    | ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_31,lemma,
    subset(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,plain,
    ( empty_carrier(X1)
    | below(X1,X2,X3)
    | ~ join_semilatt_str(X1)
    | ~ element(X2,the_carrier(X1))
    | ~ element(X3,the_carrier(X1))
    | join(X1,X2,X3) != X3 ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_33,negated_conjecture,
    ~ below(boole_lattice(esk1_0),esk2_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).

cnf(c_0_34,lemma,
    ( below(boole_lattice(X1),X2,X3)
    | set_union2(X2,X3) != X3
    | ~ join_semilatt_str(boole_lattice(X1))
    | ~ element(X3,the_carrier(boole_lattice(X1)))
    | ~ element(X2,the_carrier(boole_lattice(X1))) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_12]),c_0_14]) ).

cnf(c_0_35,lemma,
    ~ join_semilatt_str(boole_lattice(esk1_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_19]),c_0_20])]) ).

cnf(c_0_36,lemma,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_27])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU344+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n024.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 : Sun Jun 19 03:40:02 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.39/23.43  eprover: CPU time limit exceeded, terminating
% 0.39/23.44  eprover: CPU time limit exceeded, terminating
% 0.39/23.44  eprover: CPU time limit exceeded, terminating
% 0.39/23.44  eprover: CPU time limit exceeded, terminating
% 0.51/46.45  eprover: CPU time limit exceeded, terminating
% 0.51/46.46  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.51/46.46  
% 0.51/46.46  eprover: CPU time limit exceeded, terminating
% 0.65/69.48  eprover: CPU time limit exceeded, terminating
% 0.65/69.48  eprover: CPU time limit exceeded, terminating
% 0.65/69.49  eprover: CPU time limit exceeded, terminating
% 0.65/69.51  eprover: CPU time limit exceeded, terminating
% 0.65/69.83  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.65/69.83  
% 0.65/69.83  # Failure: Resource limit exceeded (time)
% 0.65/69.83  # OLD status Res
% 0.65/69.83  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.65/69.83  # Preprocessing time       : 0.062 s
% 0.65/69.83  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.65/69.83  
% 0.65/69.83  # Failure: Resource limit exceeded (time)
% 0.65/69.83  # OLD status Res
% 0.65/69.83  # Preprocessing time       : 0.098 s
% 0.65/69.83  # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 0.65/69.83  
% 0.65/69.83  # Failure: Resource limit exceeded (time)
% 0.65/69.83  # OLD status Res
% 0.65/69.83  # Preprocessing time       : 0.158 s
% 0.65/69.83  # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 0.65/69.83  # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 0.65/69.83  # Preprocessing time       : 0.024 s
% 0.65/69.83  
% 0.65/69.83  # Proof found!
% 0.65/69.83  # SZS status Theorem
% 0.65/69.83  # SZS output start CNFRefutation
% See solution above
% 0.65/69.83  # Proof object total steps             : 37
% 0.65/69.83  # Proof object clause steps            : 20
% 0.65/69.83  # Proof object formula steps           : 17
% 0.65/69.83  # Proof object conjectures             : 10
% 0.65/69.83  # Proof object clause conjectures      : 7
% 0.65/69.83  # Proof object formula conjectures     : 3
% 0.65/69.83  # Proof object initial clauses used    : 12
% 0.65/69.83  # Proof object initial formulas used   : 8
% 0.65/69.83  # Proof object generating inferences   : 7
% 0.65/69.83  # Proof object simplifying inferences  : 16
% 0.65/69.83  # Training examples: 0 positive, 0 negative
% 0.65/69.83  # Parsed axioms                        : 599
% 0.65/69.83  # Removed by relevancy pruning/SinE    : 498
% 0.65/69.83  # Initial clauses                      : 282
% 0.65/69.83  # Removed in clause preprocessing      : 1
% 0.65/69.83  # Initial clauses in saturation        : 281
% 0.65/69.83  # Processed clauses                    : 1673
% 0.65/69.83  # ...of these trivial                  : 130
% 0.65/69.83  # ...subsumed                          : 828
% 0.65/69.83  # ...remaining for further processing  : 715
% 0.65/69.83  # Other redundant clauses eliminated   : 198
% 0.65/69.83  # Clauses deleted for lack of memory   : 0
% 0.65/69.83  # Backward-subsumed                    : 0
% 0.65/69.83  # Backward-rewritten                   : 74
% 0.65/69.83  # Generated clauses                    : 14397
% 0.65/69.83  # ...of the previous two non-trivial   : 11340
% 0.65/69.83  # Contextual simplify-reflections      : 145
% 0.65/69.83  # Paramodulations                      : 14072
% 0.65/69.83  # Factorizations                       : 14
% 0.65/69.83  # Equation resolutions                 : 239
% 0.65/69.83  # Current number of processed clauses  : 603
% 0.65/69.83  #    Positive orientable unit clauses  : 110
% 0.65/69.83  #    Positive unorientable unit clauses: 2
% 0.65/69.83  #    Negative unit clauses             : 31
% 0.65/69.83  #    Non-unit-clauses                  : 460
% 0.65/69.83  # Current number of unprocessed clauses: 9314
% 0.65/69.83  # ...number of literals in the above   : 42345
% 0.65/69.83  # Current number of archived formulas  : 0
% 0.65/69.83  # Current number of archived clauses   : 75
% 0.65/69.83  # Clause-clause subsumption calls (NU) : 45220
% 0.65/69.83  # Rec. Clause-clause subsumption calls : 16243
% 0.65/69.83  # Non-unit clause-clause subsumptions  : 895
% 0.65/69.83  # Unit Clause-clause subsumption calls : 8696
% 0.65/69.83  # Rewrite failures with RHS unbound    : 0
% 0.65/69.83  # BW rewrite match attempts            : 128
% 0.65/69.83  # BW rewrite match successes           : 42
% 0.65/69.83  # Condensation attempts                : 0
% 0.65/69.83  # Condensation successes               : 0
% 0.65/69.83  # Termbank termtop insertions          : 200495
% 0.65/69.83  
% 0.65/69.83  # -------------------------------------------------
% 0.65/69.83  # User time                : 0.153 s
% 0.65/69.83  # System time              : 0.008 s
% 0.65/69.83  # Total time               : 0.161 s
% 0.65/69.83  # Maximum resident set size: 13460 pages
% 0.65/92.52  eprover: CPU time limit exceeded, terminating
% 0.65/92.53  eprover: CPU time limit exceeded, terminating
% 0.65/92.53  eprover: CPU time limit exceeded, terminating
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.55  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.55  eprover: No such file or directory
% 0.65/92.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.ineprover: 
% 0.65/92.56  Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.56  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.56  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.57  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.57  eprover: No such file or directory
% 0.65/92.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.58  eprover: No such file or directory
% 0.65/92.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.58  eprover: No such file or directory
% 0.65/92.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.65/92.58  eprover: No such file or directory
% 0.65/92.58  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.65/92.58  eprover: No such file or directory
%------------------------------------------------------------------------------