TSTP Solution File: KLE020+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE020+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:21 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 61 ( 40 unt; 0 def)
% Number of atoms : 105 ( 55 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 73 ( 29 ~; 23 |; 16 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 99 ( 5 sgn 52 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(addition(X4,multiplication(X5,X6)),multiplication(addition(X4,X5),addition(X4,X6)))
& leq(multiplication(addition(X4,X5),addition(X4,X6)),addition(X4,multiplication(X5,X6))) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+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/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).
fof(c_0_12,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])])])])]) ).
fof(c_0_13,plain,
! [X6,X6,X8] :
( ( ~ test(X6)
| complement(esk4_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_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,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_16,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_17,plain,
( addition(X2,X1) = one
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( complement(esk4_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
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,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(addition(X4,multiplication(X5,X6)),multiplication(addition(X4,X5),addition(X4,X6)))
& leq(multiplication(addition(X4,X5),addition(X4,X6)),addition(X4,multiplication(X5,X6))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_23,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( addition(X1,esk4_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_27,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_28,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_29,negated_conjecture,
( test(esk1_0)
& test(esk2_0)
& test(esk3_0)
& ( ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)))
| ~ leq(multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)),addition(esk1_0,multiplication(esk2_0,esk3_0))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
fof(c_0_30,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_31,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_32,plain,
( addition(multiplication(X1,X2),multiplication(esk4_1(X1),X2)) = X2
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_33,plain,
( multiplication(esk4_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_34,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_38,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_39,negated_conjecture,
( ~ leq(multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0)),addition(esk1_0,multiplication(esk2_0,esk3_0)))
| ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),multiplication(addition(esk1_0,esk2_0),addition(esk1_0,esk3_0))) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_43,negated_conjecture,
addition(one,esk3_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_44,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_46,negated_conjecture,
( ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,esk1_0),addition(multiplication(esk1_0,esk3_0),multiplication(esk1_0,esk1_0)))))
| ~ leq(addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,esk1_0),addition(multiplication(esk1_0,esk3_0),multiplication(esk1_0,esk1_0)))),addition(esk1_0,multiplication(esk2_0,esk3_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_37]),c_0_37]),c_0_37]),c_0_37]),c_0_23]),c_0_40]),c_0_40]),c_0_20]),c_0_23]),c_0_40]),c_0_40]),c_0_20]) ).
cnf(c_0_47,negated_conjecture,
multiplication(esk1_0,esk1_0) = esk1_0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
addition(X1,multiplication(X1,esk3_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_43]),c_0_44]),c_0_44]) ).
cnf(c_0_49,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_37]),c_0_20]) ).
fof(c_0_50,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])])])]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_52,negated_conjecture,
addition(one,esk2_0) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_45]),c_0_37]) ).
cnf(c_0_53,negated_conjecture,
( ~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,esk1_0))))
| ~ leq(addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,esk1_0))),addition(esk1_0,multiplication(esk2_0,esk3_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_37]),c_0_48]),c_0_37]),c_0_49]),c_0_47]),c_0_37]),c_0_48]),c_0_37]),c_0_49]) ).
cnf(c_0_54,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_55,plain,
addition(X1,addition(X2,addition(X3,X1))) = addition(X2,addition(X3,X1)),
inference(spm,[status(thm)],[c_0_51,c_0_20]) ).
cnf(c_0_56,plain,
addition(X1,addition(X2,addition(X1,X3))) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_51]),c_0_20]),c_0_20]) ).
cnf(c_0_57,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_37,c_0_20]) ).
cnf(c_0_58,negated_conjecture,
addition(X1,multiplication(esk2_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_52]),c_0_25]),c_0_25]) ).
cnf(c_0_59,negated_conjecture,
~ leq(addition(esk1_0,multiplication(esk2_0,esk3_0)),addition(esk1_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_20]),c_0_20]),c_0_55]),c_0_56]),c_0_57]),c_0_37]),c_0_58]),c_0_37])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_54]),c_0_20]),c_0_56]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KLE020+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n015.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 12:52:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,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 : 61
% 0.23/1.41 # Proof object clause steps : 36
% 0.23/1.41 # Proof object formula steps : 25
% 0.23/1.41 # Proof object conjectures : 16
% 0.23/1.41 # Proof object clause conjectures : 13
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 16
% 0.23/1.41 # Proof object initial formulas used : 12
% 0.23/1.41 # Proof object generating inferences : 18
% 0.23/1.41 # Proof object simplifying inferences : 46
% 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 : 2
% 0.23/1.41 # Initial clauses : 23
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 23
% 0.23/1.41 # Processed clauses : 191
% 0.23/1.41 # ...of these trivial : 27
% 0.23/1.41 # ...subsumed : 60
% 0.23/1.41 # ...remaining for further processing : 104
% 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 : 0
% 0.23/1.41 # Backward-rewritten : 13
% 0.23/1.41 # Generated clauses : 1353
% 0.23/1.41 # ...of the previous two non-trivial : 917
% 0.23/1.41 # Contextual simplify-reflections : 1
% 0.23/1.41 # Paramodulations : 1352
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 91
% 0.23/1.41 # Positive orientable unit clauses : 47
% 0.23/1.41 # Positive unorientable unit clauses: 3
% 0.23/1.41 # Negative unit clauses : 2
% 0.23/1.41 # Non-unit-clauses : 39
% 0.23/1.41 # Current number of unprocessed clauses: 639
% 0.23/1.41 # ...number of literals in the above : 1148
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 13
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 313
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 294
% 0.23/1.41 # Non-unit clause-clause subsumptions : 38
% 0.23/1.41 # Unit Clause-clause subsumption calls : 42
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 99
% 0.23/1.41 # BW rewrite match successes : 63
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 13436
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.039 s
% 0.23/1.41 # System time : 0.000 s
% 0.23/1.41 # Total time : 0.039 s
% 0.23/1.41 # Maximum resident set size: 3612 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 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.43 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.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.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.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.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.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.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.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
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/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/sandbox/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/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------