↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KLE045+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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:35 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   50 (  39 unt;   0 def)
%            Number of atoms       :   63 (  39 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    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   98 (   2 sgn  52   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(goals,conjecture,
    ! [X4,X5,X6] :
      ( leq(multiplication(X4,X6),multiplication(X6,X5))
     => leq(multiplication(star(X4),X6),multiplication(X6,star(X5))) ),
    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/KLE002+0.ax',order) ).

fof(star_unfold_right,axiom,
    ! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).

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

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

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/KLE002+0.ax',right_distributivity) ).

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

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

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

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

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

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

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,
    ! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
    inference(variable_rename,[status(thm)],[star_unfold_right]) ).

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

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

fof(c_0_16,negated_conjecture,
    ( leq(multiplication(esk1_0,esk3_0),multiplication(esk3_0,esk2_0))
    & ~ leq(multiplication(star(esk1_0),esk3_0),multiplication(esk3_0,star(esk2_0))) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).

fof(c_0_17,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_18,plain,
    ( addition(X1,X2) = X2
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    leq(addition(one,multiplication(X1,star(X1))),star(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

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

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

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

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

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

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

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

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

cnf(c_0_28,plain,
    addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).

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

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

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

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

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

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

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

cnf(c_0_36,plain,
    addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

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_20,c_0_21]),c_0_20]) ).

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

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

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

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

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

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

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

cnf(c_0_45,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(spm,[status(thm)],[c_0_20,c_0_40]) ).

cnf(c_0_46,negated_conjecture,
    addition(esk3_0,addition(multiplication(esk3_0,star(esk2_0)),multiplication(esk1_0,multiplication(esk3_0,star(esk2_0))))) != multiplication(esk3_0,star(esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21]),c_0_37]) ).

cnf(c_0_47,negated_conjecture,
    addition(multiplication(esk3_0,star(esk2_0)),multiplication(esk1_0,multiplication(esk3_0,star(esk2_0)))) = multiplication(esk3_0,star(esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_38]),c_0_21]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : KLE045+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n009.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Thu Jun 16 07:30:23 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41  # Preprocessing time       : 0.014 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 50
% 0.23/1.41  # Proof object clause steps            : 27
% 0.23/1.41  # Proof object formula steps           : 23
% 0.23/1.41  # Proof object conjectures             : 11
% 0.23/1.41  # Proof object clause conjectures      : 8
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 13
% 0.23/1.41  # Proof object initial formulas used   : 11
% 0.23/1.41  # Proof object generating inferences   : 13
% 0.23/1.41  # Proof object simplifying inferences  : 17
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 17
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 19
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 19
% 0.23/1.41  # Processed clauses                    : 3461
% 0.23/1.41  # ...of these trivial                  : 259
% 0.23/1.41  # ...subsumed                          : 1687
% 0.23/1.41  # ...remaining for further processing  : 1515
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 46
% 0.23/1.41  # Backward-rewritten                   : 302
% 0.23/1.41  # Generated clauses                    : 79249
% 0.23/1.41  # ...of the previous two non-trivial   : 65079
% 0.23/1.41  # Contextual simplify-reflections      : 161
% 0.23/1.41  # Paramodulations                      : 79192
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 1144
% 0.23/1.41  #    Positive orientable unit clauses  : 76
% 0.23/1.41  #    Positive unorientable unit clauses: 7
% 0.23/1.41  #    Negative unit clauses             : 23
% 0.23/1.41  #    Non-unit-clauses                  : 1038
% 0.23/1.41  # Current number of unprocessed clauses: 42283
% 0.23/1.41  # ...number of literals in the above   : 112957
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 352
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 110473
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 98714
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 1212
% 0.23/1.41  # Unit Clause-clause subsumption calls : 8778
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 821
% 0.23/1.41  # BW rewrite match successes           : 298
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 1775947
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.880 s
% 0.23/1.41  # System time              : 0.032 s
% 0.23/1.41  # Total time               : 0.912 s
% 0.23/1.41  # Maximum resident set size: 57204 pages
% 0.23/23.40  eprover: CPU time limit exceeded, terminating
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42  eprover: No such file or directory
% 0.23/23.42  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: CPU time limit exceeded, terminating
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49  eprover: No such file or directory
% 0.23/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50  eprover: No such file or directory
% 0.23/23.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------