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

View Problem - Process Solution

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

% Computer : n021.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:56:19 EDT 2022

% Result   : Theorem 0.25s 3.44s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   52 (  41 unt;   0 def)
%            Number of atoms       :   65 (  44 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  11   ~;   7   |;   2   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :  100 (   2 sgn  54   !;   0   ?)

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

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

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

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

fof(star_unfold2,axiom,
    ! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).

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

fof(multiplicative_associativity,axiom,
    ! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).

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

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

fof(additive_identity,axiom,
    ! [X1] : addition(X1,zero) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).

fof(star_induction2,axiom,
    ! [X1,X2,X3] :
      ( leq(addition(multiplication(X3,X1),X2),X3)
     => leq(multiplication(X2,star(X1)),X3) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction2) ).

fof(idempotence,axiom,
    ! [X1] : addition(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).

fof(c_0_12,negated_conjecture,
    ~ ! [X4,X5,X6] :
        ( leq(multiplication(X4,X5),multiplication(X6,X4))
       => leq(multiplication(X4,star(X5)),multiplication(star(X6),X4)) ),
    inference(assume_negation,[status(cth)],[goals]) ).

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,
    ! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
    inference(variable_rename,[status(thm)],[distributivity2]) ).

fof(c_0_16,plain,
    ! [X2] : addition(one,multiplication(star(X2),X2)) = star(X2),
    inference(variable_rename,[status(thm)],[star_unfold2]) ).

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

fof(c_0_18,plain,
    ! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
    inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).

fof(c_0_19,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_20,negated_conjecture,
    ( leq(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0))
    & ~ leq(multiplication(esk1_0,star(esk2_0)),multiplication(star(esk3_0),esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).

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

fof(c_0_22,plain,
    ! [X2] : addition(X2,zero) = X2,
    inference(variable_rename,[status(thm)],[additive_identity]) ).

fof(c_0_23,plain,
    ! [X4,X5,X6] :
      ( ~ leq(addition(multiplication(X6,X4),X5),X6)
      | leq(multiplication(X5,star(X4)),X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).

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

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

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

cnf(c_0_27,plain,
    addition(one,multiplication(star(X1),X1)) = star(X1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

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

cnf(c_0_30,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_31,negated_conjecture,
    leq(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

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

cnf(c_0_33,plain,
    addition(X1,zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

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

cnf(c_0_35,plain,
    ( leq(multiplication(X1,star(X2)),X3)
    | ~ leq(addition(multiplication(X3,X2),X1),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

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

cnf(c_0_37,plain,
    addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).

cnf(c_0_38,plain,
    addition(X1,multiplication(star(X2),multiplication(X2,X1))) = multiplication(star(X2),X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).

cnf(c_0_39,negated_conjecture,
    addition(multiplication(esk1_0,esk2_0),multiplication(esk3_0,esk1_0)) = multiplication(esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_40,plain,
    addition(multiplication(X1,X2),multiplication(X1,zero)) = multiplication(X1,X2),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_41,plain,
    addition(X1,X1) = X1,
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_42,negated_conjecture,
    ~ leq(multiplication(esk1_0,star(esk2_0)),multiplication(star(esk3_0),esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_43,plain,
    ( leq(multiplication(X1,star(X2)),X3)
    | addition(multiplication(X3,X2),addition(X1,X3)) != X3 ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]) ).

cnf(c_0_44,plain,
    addition(X1,addition(X2,multiplication(star(X3),multiplication(X3,X1)))) = addition(X2,multiplication(star(X3),X1)),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_45,negated_conjecture,
    addition(multiplication(X1,multiplication(esk1_0,esk2_0)),multiplication(X1,multiplication(esk3_0,esk1_0))) = multiplication(X1,multiplication(esk3_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_32,c_0_39]) ).

cnf(c_0_46,plain,
    addition(X1,multiplication(X2,X3)) = addition(multiplication(X2,X3),addition(X1,multiplication(X2,zero))),
    inference(spm,[status(thm)],[c_0_37,c_0_40]) ).

cnf(c_0_47,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_24,c_0_41]) ).

cnf(c_0_48,negated_conjecture,
    addition(esk1_0,addition(multiplication(star(esk3_0),esk1_0),multiplication(star(esk3_0),multiplication(esk1_0,esk2_0)))) != multiplication(star(esk3_0),esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29]),c_0_25]),c_0_24]) ).

cnf(c_0_49,negated_conjecture,
    addition(multiplication(star(esk3_0),esk1_0),multiplication(star(esk3_0),multiplication(esk1_0,esk2_0))) = multiplication(star(esk3_0),esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_38]),c_0_46]),c_0_40]) ).

cnf(c_0_50,plain,
    addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
    inference(spm,[status(thm)],[c_0_47,c_0_38]) ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KLE159+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n021.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 : Thu Jun 16 13:57:15 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.25/3.44  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/3.44  # Preprocessing time       : 0.014 s
% 0.25/3.44  
% 0.25/3.44  # Proof found!
% 0.25/3.44  # SZS status Theorem
% 0.25/3.44  # SZS output start CNFRefutation
% See solution above
% 0.25/3.44  # Proof object total steps             : 52
% 0.25/3.44  # Proof object clause steps            : 27
% 0.25/3.44  # Proof object formula steps           : 25
% 0.25/3.44  # Proof object conjectures             : 10
% 0.25/3.44  # Proof object clause conjectures      : 7
% 0.25/3.44  # Proof object formula conjectures     : 3
% 0.25/3.44  # Proof object initial clauses used    : 14
% 0.25/3.44  # Proof object initial formulas used   : 12
% 0.25/3.44  # Proof object generating inferences   : 12
% 0.25/3.44  # Proof object simplifying inferences  : 13
% 0.25/3.44  # Training examples: 0 positive, 0 negative
% 0.25/3.44  # Parsed axioms                        : 19
% 0.25/3.44  # Removed by relevancy pruning/SinE    : 0
% 0.25/3.44  # Initial clauses                      : 21
% 0.25/3.44  # Removed in clause preprocessing      : 0
% 0.25/3.44  # Initial clauses in saturation        : 21
% 0.25/3.44  # Processed clauses                    : 4123
% 0.25/3.44  # ...of these trivial                  : 302
% 0.25/3.44  # ...subsumed                          : 1646
% 0.25/3.44  # ...remaining for further processing  : 2175
% 0.25/3.44  # Other redundant clauses eliminated   : 0
% 0.25/3.44  # Clauses deleted for lack of memory   : 0
% 0.25/3.44  # Backward-subsumed                    : 207
% 0.25/3.44  # Backward-rewritten                   : 440
% 0.25/3.44  # Generated clauses                    : 155412
% 0.25/3.44  # ...of the previous two non-trivial   : 143650
% 0.25/3.44  # Contextual simplify-reflections      : 385
% 0.25/3.44  # Paramodulations                      : 155372
% 0.25/3.44  # Factorizations                       : 0
% 0.25/3.44  # Equation resolutions                 : 6
% 0.25/3.44  # Current number of processed clauses  : 1513
% 0.25/3.44  #    Positive orientable unit clauses  : 212
% 0.25/3.44  #    Positive unorientable unit clauses: 10
% 0.25/3.44  #    Negative unit clauses             : 14
% 0.25/3.44  #    Non-unit-clauses                  : 1277
% 0.25/3.44  # Current number of unprocessed clauses: 97837
% 0.25/3.44  # ...number of literals in the above   : 248814
% 0.25/3.44  # Current number of archived formulas  : 0
% 0.25/3.44  # Current number of archived clauses   : 647
% 0.25/3.44  # Clause-clause subsumption calls (NU) : 124383
% 0.25/3.44  # Rec. Clause-clause subsumption calls : 108033
% 0.25/3.44  # Non-unit clause-clause subsumptions  : 1819
% 0.25/3.44  # Unit Clause-clause subsumption calls : 11357
% 0.25/3.44  # Rewrite failures with RHS unbound    : 0
% 0.25/3.44  # BW rewrite match attempts            : 3885
% 0.25/3.44  # BW rewrite match successes           : 792
% 0.25/3.44  # Condensation attempts                : 0
% 0.25/3.44  # Condensation successes               : 0
% 0.25/3.44  # Termbank termtop insertions          : 3659198
% 0.25/3.44  
% 0.25/3.44  # -------------------------------------------------
% 0.25/3.44  # User time                : 2.151 s
% 0.25/3.44  # System time              : 0.098 s
% 0.25/3.44  # Total time               : 2.249 s
% 0.25/3.44  # Maximum resident set size: 123872 pages
% 0.25/23.42  eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.25/23.42  
% 0.25/23.42  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------