TSTP Solution File: KLE022+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n014.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 : Sun Jul 17 01:55:24 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   57 (  19 unt;   0 def)
%            Number of atoms       :  129 (  64 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :  134 (  62   ~;  54   |;  11   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   95 (   7 sgn  45   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4,X5] :
      ( test(X5)
     => ( leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))
        & leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).

fof(order,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> addition(X1,X2) = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).

fof(additive_associativity,axiom,
    ! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(additive_commutativity,axiom,
    ! [X1,X2] : addition(X1,X2) = addition(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(test_1,axiom,
    ! [X4] :
      ( test(X4)
    <=> ? [X5] : complement(X5,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).

fof(test_2,axiom,
    ! [X4,X5] :
      ( complement(X5,X4)
    <=> ( multiplication(X4,X5) = zero
        & multiplication(X5,X4) = zero
        & addition(X4,X5) = one ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).

fof(test_3,axiom,
    ! [X4,X5] :
      ( test(X4)
     => ( c(X4) = X5
      <=> complement(X4,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_3) ).

fof(right_distributivity,axiom,
    ! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

fof(multiplicative_right_identity,axiom,
    ! [X1] : multiplication(X1,one) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

fof(additive_idempotence,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X4,X5] :
        ( test(X5)
       => ( leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))
          & leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4) ) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_11,negated_conjecture,
    ( test(esk3_0)
    & ( ~ leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))))
      | ~ leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

fof(c_0_12,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ leq(X3,X4)
        | addition(X3,X4) = X4 )
      & ( addition(X3,X4) != X4
        | leq(X3,X4) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).

fof(c_0_13,plain,
    ! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
    inference(variable_rename,[status(thm)],[additive_associativity]) ).

fof(c_0_14,plain,
    ! [X3,X4] : addition(X3,X4) = addition(X4,X3),
    inference(variable_rename,[status(thm)],[additive_commutativity]) ).

fof(c_0_15,plain,
    ! [X6,X6,X8] :
      ( ( ~ test(X6)
        | complement(esk1_1(X6),X6) )
      & ( ~ complement(X8,X6)
        | test(X6) ) ),
    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)],[test_1])])])])])]) ).

fof(c_0_16,plain,
    ! [X6,X7,X6,X7] :
      ( ( multiplication(X6,X7) = zero
        | ~ complement(X7,X6) )
      & ( multiplication(X7,X6) = zero
        | ~ complement(X7,X6) )
      & ( addition(X6,X7) = one
        | ~ complement(X7,X6) )
      & ( multiplication(X6,X7) != zero
        | multiplication(X7,X6) != zero
        | addition(X6,X7) != one
        | complement(X7,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0)
    | ~ leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( leq(X1,X2)
    | addition(X1,X2) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_21,plain,
    ! [X6,X7,X7] :
      ( ( c(X6) != X7
        | complement(X6,X7)
        | ~ test(X6) )
      & ( ~ complement(X6,X7)
        | c(X6) = X7
        | ~ test(X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])])])]) ).

cnf(c_0_22,plain,
    ( test(X1)
    | ~ complement(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    ( complement(X1,X2)
    | addition(X2,X1) != one
    | multiplication(X1,X2) != zero
    | multiplication(X2,X1) != zero ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_24,plain,
    ( multiplication(X1,X2) = zero
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_25,plain,
    ( complement(esk1_1(X1),X1)
    | ~ test(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_26,plain,
    ( multiplication(X2,X1) = zero
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_27,plain,
    ( addition(X2,X1) = one
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    ( addition(multiplication(esk2_0,esk3_0),addition(esk2_0,multiplication(esk2_0,c(esk3_0)))) != esk2_0
    | ~ leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20]) ).

fof(c_0_29,plain,
    ! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
    inference(variable_rename,[status(thm)],[right_distributivity]) ).

cnf(c_0_30,plain,
    ( complement(X1,X2)
    | ~ test(X1)
    | c(X1) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_31,plain,
    ! [X2] : multiplication(X2,one) = X2,
    inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).

cnf(c_0_32,plain,
    ( c(X1) = X2
    | ~ test(X1)
    | ~ complement(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_33,plain,
    ( test(X1)
    | addition(X1,X2) != one
    | multiplication(X1,X2) != zero
    | multiplication(X2,X1) != zero ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_34,plain,
    ( multiplication(esk1_1(X1),X1) = zero
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_35,plain,
    ( multiplication(X1,esk1_1(X1)) = zero
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_25]) ).

cnf(c_0_36,plain,
    ( addition(X1,esk1_1(X1)) = one
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_25]) ).

cnf(c_0_37,negated_conjecture,
    ( addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))) != addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))
    | addition(multiplication(esk2_0,esk3_0),addition(esk2_0,multiplication(esk2_0,c(esk3_0)))) != esk2_0 ),
    inference(spm,[status(thm)],[c_0_28,c_0_18]) ).

cnf(c_0_38,plain,
    addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]) ).

cnf(c_0_39,plain,
    multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_40,plain,
    ( addition(X1,X2) = one
    | c(X2) != X1
    | ~ test(X2) ),
    inference(spm,[status(thm)],[c_0_27,c_0_30]) ).

cnf(c_0_41,plain,
    multiplication(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

fof(c_0_42,plain,
    ! [X2] : addition(X2,X2) = X2,
    inference(variable_rename,[status(thm)],[additive_idempotence]) ).

cnf(c_0_43,plain,
    ( c(X1) = X2
    | addition(X2,X1) != one
    | multiplication(X2,X1) != zero
    | multiplication(X1,X2) != zero
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_32,c_0_23]) ).

cnf(c_0_44,plain,
    ( test(esk1_1(X1))
    | ~ test(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_35]),c_0_36]) ).

cnf(c_0_45,negated_conjecture,
    ( addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))) != addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))
    | addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))) != esk2_0 ),
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_46,plain,
    ( addition(multiplication(X1,X2),multiplication(X1,X3)) = X1
    | c(X3) != X2
    | ~ test(X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).

cnf(c_0_47,plain,
    addition(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

cnf(c_0_48,plain,
    ( c(esk1_1(X1)) = X1
    | ~ test(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_44]),c_0_34]),c_0_36]) ).

cnf(c_0_49,plain,
    ( esk1_1(X1) = c(X1)
    | ~ test(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_20]),c_0_35]),c_0_36]) ).

cnf(c_0_50,negated_conjecture,
    ( c(c(esk3_0)) != esk3_0
    | ~ test(c(esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).

cnf(c_0_51,plain,
    ( c(c(X1)) = X1
    | ~ test(X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_52,negated_conjecture,
    test(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_53,plain,
    ( test(X1)
    | c(X2) != X1
    | ~ test(X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_30]) ).

cnf(c_0_54,negated_conjecture,
    ~ test(c(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]) ).

cnf(c_0_55,plain,
    ( test(c(X1))
    | ~ test(X1) ),
    inference(er,[status(thm)],[c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_52])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : KLE022+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 13:04:20 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.24/1.42  # Preprocessing time       : 0.015 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.43  # Proof object total steps             : 57
% 0.24/1.43  # Proof object clause steps            : 36
% 0.24/1.43  # Proof object formula steps           : 21
% 0.24/1.43  # Proof object conjectures             : 11
% 0.24/1.43  # Proof object clause conjectures      : 8
% 0.24/1.43  # Proof object formula conjectures     : 3
% 0.24/1.43  # Proof object initial clauses used    : 16
% 0.24/1.43  # Proof object initial formulas used   : 10
% 0.24/1.43  # Proof object generating inferences   : 19
% 0.24/1.43  # Proof object simplifying inferences  : 20
% 0.24/1.43  # Training examples: 0 positive, 0 negative
% 0.24/1.43  # Parsed axioms                        : 19
% 0.24/1.43  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.43  # Initial clauses                      : 26
% 0.24/1.43  # Removed in clause preprocessing      : 0
% 0.24/1.43  # Initial clauses in saturation        : 26
% 0.24/1.43  # Processed clauses                    : 1035
% 0.24/1.43  # ...of these trivial                  : 100
% 0.24/1.43  # ...subsumed                          : 510
% 0.24/1.43  # ...remaining for further processing  : 425
% 0.24/1.43  # Other redundant clauses eliminated   : 24
% 0.24/1.43  # Clauses deleted for lack of memory   : 0
% 0.24/1.43  # Backward-subsumed                    : 37
% 0.24/1.43  # Backward-rewritten                   : 29
% 0.24/1.43  # Generated clauses                    : 11332
% 0.24/1.43  # ...of the previous two non-trivial   : 9734
% 0.24/1.43  # Contextual simplify-reflections      : 539
% 0.24/1.43  # Paramodulations                      : 11293
% 0.24/1.43  # Factorizations                       : 0
% 0.24/1.43  # Equation resolutions                 : 39
% 0.24/1.43  # Current number of processed clauses  : 359
% 0.24/1.43  #    Positive orientable unit clauses  : 26
% 0.24/1.43  #    Positive unorientable unit clauses: 4
% 0.24/1.43  #    Negative unit clauses             : 3
% 0.24/1.43  #    Non-unit-clauses                  : 326
% 0.24/1.43  # Current number of unprocessed clauses: 7885
% 0.24/1.43  # ...number of literals in the above   : 35636
% 0.24/1.43  # Current number of archived formulas  : 0
% 0.24/1.43  # Current number of archived clauses   : 66
% 0.24/1.43  # Clause-clause subsumption calls (NU) : 29069
% 0.24/1.43  # Rec. Clause-clause subsumption calls : 7713
% 0.24/1.43  # Non-unit clause-clause subsumptions  : 915
% 0.24/1.43  # Unit Clause-clause subsumption calls : 449
% 0.24/1.43  # Rewrite failures with RHS unbound    : 0
% 0.24/1.43  # BW rewrite match attempts            : 71
% 0.24/1.43  # BW rewrite match successes           : 51
% 0.24/1.43  # Condensation attempts                : 0
% 0.24/1.43  # Condensation successes               : 0
% 0.24/1.43  # Termbank termtop insertions          : 196546
% 0.24/1.43  
% 0.24/1.43  # -------------------------------------------------
% 0.24/1.43  # User time                : 0.199 s
% 0.24/1.43  # System time              : 0.005 s
% 0.24/1.43  # Total time               : 0.204 s
% 0.24/1.43  # Maximum resident set size: 11004 pages
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: CPU time limit exceeded, terminating
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
%------------------------------------------------------------------------------