TSTP Solution File: KLE044+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE044+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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 : 14
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 58 unt; 0 def)
% Number of atoms : 98 ( 44 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 16 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 121 ( 2 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).
fof(goals,conjecture,
! [X4] :
( leq(star(addition(one,X4)),star(X4))
& leq(star(X4),star(addition(one,X4))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X4,X5),X6),X4)
| leq(multiplication(X6,star(X5)),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_12,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_13,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_16,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_17,plain,
! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
fof(c_0_18,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_19,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_20,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( leq(multiplication(X1,star(X1)),one)
| ~ leq(X1,one) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,plain,
leq(addition(one,star(one)),star(one)),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_30,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,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_25,c_0_23]),c_0_24]),c_0_26]) ).
fof(c_0_32,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_33,plain,
leq(star(one),one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_14]) ).
cnf(c_0_34,plain,
addition(one,star(one)) = star(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_29]),c_0_24]),c_0_21]) ).
cnf(c_0_35,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_36,plain,
! [X2] : leq(addition(one,multiplication(star(X2),X2)),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_37,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_38,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_33]),c_0_26]),c_0_34]) ).
cnf(c_0_40,plain,
addition(star(X1),one) = star(X1),
inference(spm,[status(thm)],[c_0_26,c_0_35]) ).
cnf(c_0_41,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( leq(X1,X2)
| ~ leq(addition(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_38]),c_0_39]),c_0_38]) ).
cnf(c_0_44,plain,
addition(star(X1),addition(one,X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_45,plain,
leq(addition(one,addition(multiplication(star(addition(X1,X2)),X1),multiplication(star(addition(X1,X2)),X2))),star(addition(X1,X2))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
addition(one,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_47,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_48,plain,
( leq(addition(one,X1),star(X2))
| ~ leq(addition(star(X2),X1),star(X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
leq(addition(star(addition(X1,one)),multiplication(star(addition(X1,one)),X1)),star(addition(X1,one))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_38]),c_0_26]),c_0_46]) ).
cnf(c_0_50,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_26]),c_0_24]) ).
cnf(c_0_51,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_35]),c_0_26]) ).
cnf(c_0_52,plain,
( leq(multiplication(X1,star(addition(X2,X3))),X4)
| ~ leq(addition(multiplication(X4,X2),addition(multiplication(X4,X3),X1)),X4) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_42]),c_0_24]) ).
cnf(c_0_53,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_54,plain,
leq(addition(one,multiplication(star(addition(X1,one)),X1)),star(addition(X1,one))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
addition(star(X1),addition(X2,multiplication(X1,star(X1)))) = addition(X2,star(X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
addition(X1,multiplication(X1,star(X2))) = multiplication(X1,star(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_35]),c_0_38]) ).
cnf(c_0_57,plain,
( leq(multiplication(X1,star(addition(X2,one))),X3)
| ~ leq(addition(X3,addition(multiplication(X3,X2),X1)),X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_38]),c_0_50]) ).
cnf(c_0_58,plain,
addition(star(X1),addition(X2,one)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_44,c_0_26]) ).
cnf(c_0_59,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_41]),c_0_24]),c_0_26]) ).
fof(c_0_60,negated_conjecture,
~ ! [X4] :
( leq(star(addition(one,X4)),star(X4))
& leq(star(X4),star(addition(one,X4))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_61,plain,
leq(star(X1),star(addition(X1,one))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_14]) ).
cnf(c_0_62,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X2,X1)),
inference(spm,[status(thm)],[c_0_47,c_0_26]) ).
cnf(c_0_63,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_51]) ).
cnf(c_0_64,plain,
( leq(star(addition(X1,one)),star(X2))
| ~ leq(addition(star(X2),multiplication(star(X2),X1)),star(X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_14]) ).
cnf(c_0_65,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_47]),c_0_35]),c_0_26]) ).
fof(c_0_66,negated_conjecture,
( ~ leq(star(addition(one,esk1_0)),star(esk1_0))
| ~ leq(star(esk2_0),star(addition(one,esk2_0))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_60])])])]) ).
cnf(c_0_67,plain,
leq(star(X1),star(addition(one,X1))),
inference(spm,[status(thm)],[c_0_61,c_0_26]) ).
cnf(c_0_68,plain,
addition(X1,addition(star(X1),X2)) = addition(X2,star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_50]) ).
cnf(c_0_69,plain,
leq(star(addition(X1,one)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_28])]) ).
cnf(c_0_70,plain,
addition(star(X1),star(addition(X1,one))) = star(addition(X1,one)),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_71,negated_conjecture,
( ~ leq(star(esk2_0),star(addition(one,esk2_0)))
| ~ leq(star(addition(one,esk1_0)),star(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_72,plain,
leq(star(addition(one,X1)),star(addition(X1,one))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_39]),c_0_39]) ).
cnf(c_0_73,plain,
star(addition(X1,one)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_69]),c_0_26]),c_0_70]) ).
cnf(c_0_74,negated_conjecture,
~ leq(star(addition(one,esk1_0)),star(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_67])]) ).
cnf(c_0_75,plain,
leq(star(addition(one,X1)),star(X1)),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE044+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n005.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 16:07:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.23/1.41 # Preprocessing time : 0.015 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 : 77
% 0.23/1.41 # Proof object clause steps : 54
% 0.23/1.41 # Proof object formula steps : 23
% 0.23/1.41 # Proof object conjectures : 6
% 0.23/1.41 # Proof object clause conjectures : 3
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 12
% 0.23/1.41 # Proof object initial formulas used : 11
% 0.23/1.41 # Proof object generating inferences : 39
% 0.23/1.41 # Proof object simplifying inferences : 36
% 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 : 3
% 0.23/1.41 # Initial clauses : 15
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 15
% 0.23/1.41 # Processed clauses : 7252
% 0.23/1.41 # ...of these trivial : 507
% 0.23/1.41 # ...subsumed : 5638
% 0.23/1.41 # ...remaining for further processing : 1107
% 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 : 9
% 0.23/1.41 # Backward-rewritten : 186
% 0.23/1.41 # Generated clauses : 71065
% 0.23/1.41 # ...of the previous two non-trivial : 61458
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 71065
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 912
% 0.23/1.41 # Positive orientable unit clauses : 174
% 0.23/1.41 # Positive unorientable unit clauses: 4
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 734
% 0.23/1.41 # Current number of unprocessed clauses: 41270
% 0.23/1.41 # ...number of literals in the above : 77982
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 195
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 208840
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 208840
% 0.23/1.41 # Non-unit clause-clause subsumptions : 5512
% 0.23/1.41 # Unit Clause-clause subsumption calls : 6998
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1444
% 0.23/1.41 # BW rewrite match successes : 220
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 1261636
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.742 s
% 0.23/1.41 # System time : 0.028 s
% 0.23/1.41 # Total time : 0.770 s
% 0.23/1.41 # Maximum resident set size: 49020 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------