TSTP Solution File: SET711+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET711+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 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 : Tue Jul 19 00:53:18 EDT 2022
% Result : Theorem 0.39s 23.57s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 6 unt; 0 def)
% Number of atoms : 168 ( 10 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 200 ( 66 ~; 85 |; 37 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 127 ( 14 sgn 68 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII03a,conjecture,
! [X6,X10,X9,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& inverse_predicate(X9,X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thII03a) ).
fof(one_to_one,axiom,
! [X6,X1,X2] :
( one_to_one(X6,X1,X2)
<=> ( injective(X6,X1,X2)
& surjective(X6,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',one_to_one) ).
fof(inverse_predicate,axiom,
! [X10,X6,X1,X2] :
( inverse_predicate(X10,X6,X1,X2)
<=> ! [X3,X5] :
( ( member(X3,X1)
& member(X5,X2) )
=> ( apply(X6,X3,X5)
<=> apply(X10,X5,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',inverse_predicate) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X13,X1)
& member(X14,X1)
& member(X5,X2) )
=> ( ( apply(X6,X13,X5)
& apply(X6,X14,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',injective) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X10,X3,X8) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',equal_maps) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X9,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& inverse_predicate(X9,X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
inference(assume_negation,[status(cth)],[thII03a]) ).
fof(c_0_6,plain,
! [X7,X8,X9,X7,X8,X9] :
( ( injective(X7,X8,X9)
| ~ one_to_one(X7,X8,X9) )
& ( surjective(X7,X8,X9)
| ~ one_to_one(X7,X8,X9) )
& ( ~ injective(X7,X8,X9)
| ~ surjective(X7,X8,X9)
| one_to_one(X7,X8,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_to_one])])])])]) ).
fof(c_0_7,negated_conjecture,
( maps(esk1_0,esk4_0,esk5_0)
& one_to_one(esk1_0,esk4_0,esk5_0)
& inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0)
& inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0)
& ~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X11,X12,X13,X14,X15,X16,X11,X12,X13,X14] :
( ( ~ apply(X12,X15,X16)
| apply(X11,X16,X15)
| ~ member(X15,X13)
| ~ member(X16,X14)
| ~ inverse_predicate(X11,X12,X13,X14) )
& ( ~ apply(X11,X16,X15)
| apply(X12,X15,X16)
| ~ member(X15,X13)
| ~ member(X16,X14)
| ~ inverse_predicate(X11,X12,X13,X14) )
& ( member(esk9_4(X11,X12,X13,X14),X13)
| inverse_predicate(X11,X12,X13,X14) )
& ( member(esk10_4(X11,X12,X13,X14),X14)
| inverse_predicate(X11,X12,X13,X14) )
& ( ~ apply(X12,esk9_4(X11,X12,X13,X14),esk10_4(X11,X12,X13,X14))
| ~ apply(X11,esk10_4(X11,X12,X13,X14),esk9_4(X11,X12,X13,X14))
| inverse_predicate(X11,X12,X13,X14) )
& ( apply(X12,esk9_4(X11,X12,X13,X14),esk10_4(X11,X12,X13,X14))
| apply(X11,esk10_4(X11,X12,X13,X14),esk9_4(X11,X12,X13,X14))
| inverse_predicate(X11,X12,X13,X14) ) ),
inference(distribute,[status(thm)],[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)],[inverse_predicate])])])])])])]) ).
fof(c_0_9,plain,
! [X15,X16,X17,X18,X19,X20,X15,X16,X17] :
( ( ~ injective(X15,X16,X17)
| ~ member(X18,X16)
| ~ member(X19,X16)
| ~ member(X20,X17)
| ~ apply(X15,X18,X20)
| ~ apply(X15,X19,X20)
| X18 = X19 )
& ( member(esk18_3(X15,X16,X17),X16)
| injective(X15,X16,X17) )
& ( member(esk19_3(X15,X16,X17),X16)
| injective(X15,X16,X17) )
& ( member(esk20_3(X15,X16,X17),X17)
| injective(X15,X16,X17) )
& ( apply(X15,esk18_3(X15,X16,X17),esk20_3(X15,X16,X17))
| injective(X15,X16,X17) )
& ( apply(X15,esk19_3(X15,X16,X17),esk20_3(X15,X16,X17))
| injective(X15,X16,X17) )
& ( esk18_3(X15,X16,X17) != esk19_3(X15,X16,X17)
| injective(X15,X16,X17) ) ),
inference(distribute,[status(thm)],[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)],[injective])])])])])])]) ).
cnf(c_0_10,plain,
( injective(X1,X2,X3)
| ~ one_to_one(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
one_to_one(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( apply(X2,X6,X5)
| ~ inverse_predicate(X1,X2,X3,X4)
| ~ member(X5,X4)
| ~ member(X6,X3)
| ~ apply(X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X11,X12,X13,X14,X15,X16,X17,X11,X12,X13,X14] :
( ( ~ equal_maps(X11,X12,X13,X14)
| ~ member(X15,X13)
| ~ member(X16,X14)
| ~ member(X17,X14)
| ~ apply(X11,X15,X16)
| ~ apply(X12,X15,X17)
| X16 = X17 )
& ( member(esk6_4(X11,X12,X13,X14),X13)
| equal_maps(X11,X12,X13,X14) )
& ( member(esk7_4(X11,X12,X13,X14),X14)
| equal_maps(X11,X12,X13,X14) )
& ( member(esk8_4(X11,X12,X13,X14),X14)
| equal_maps(X11,X12,X13,X14) )
& ( apply(X11,esk6_4(X11,X12,X13,X14),esk7_4(X11,X12,X13,X14))
| equal_maps(X11,X12,X13,X14) )
& ( apply(X12,esk6_4(X11,X12,X13,X14),esk8_4(X11,X12,X13,X14))
| equal_maps(X11,X12,X13,X14) )
& ( esk7_4(X11,X12,X13,X14) != esk8_4(X11,X12,X13,X14)
| equal_maps(X11,X12,X13,X14) ) ),
inference(distribute,[status(thm)],[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)],[equal_maps])])])])])])]) ).
cnf(c_0_15,plain,
( X1 = X2
| ~ apply(X3,X2,X4)
| ~ apply(X3,X1,X4)
| ~ member(X4,X5)
| ~ member(X2,X6)
| ~ member(X1,X6)
| ~ injective(X3,X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
injective(esk1_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( apply(esk1_0,X1,X2)
| ~ apply(esk3_0,X2,X1)
| ~ member(X1,esk4_0)
| ~ member(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X2,esk6_4(X1,X2,X3,X4),esk8_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( X1 = X2
| ~ apply(esk1_0,X2,X3)
| ~ apply(esk1_0,X1,X3)
| ~ member(X3,esk5_0)
| ~ member(X2,esk4_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( equal_maps(X1,esk3_0,X2,X3)
| apply(esk1_0,esk8_4(X1,esk3_0,X2,X3),esk6_4(X1,esk3_0,X2,X3))
| ~ member(esk8_4(X1,esk3_0,X2,X3),esk4_0)
| ~ member(esk6_4(X1,esk3_0,X2,X3),esk5_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( apply(esk1_0,X1,X2)
| ~ apply(esk2_0,X2,X1)
| ~ member(X1,esk4_0)
| ~ member(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X1,esk6_4(X1,X2,X3,X4),esk7_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( X1 = esk8_4(X2,esk3_0,X3,X4)
| equal_maps(X2,esk3_0,X3,X4)
| ~ apply(esk1_0,X1,esk6_4(X2,esk3_0,X3,X4))
| ~ member(esk6_4(X2,esk3_0,X3,X4),esk5_0)
| ~ member(esk8_4(X2,esk3_0,X3,X4),esk4_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( equal_maps(esk2_0,X1,X2,X3)
| apply(esk1_0,esk7_4(esk2_0,X1,X2,X3),esk6_4(esk2_0,X1,X2,X3))
| ~ member(esk7_4(esk2_0,X1,X2,X3),esk4_0)
| ~ member(esk6_4(esk2_0,X1,X2,X3),esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( equal_maps(X1,X2,X3,X4)
| esk7_4(X1,X2,X3,X4) != esk8_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( equal_maps(esk2_0,esk3_0,X1,X2)
| ~ member(esk6_4(esk2_0,esk3_0,X1,X2),esk5_0)
| ~ member(esk8_4(esk2_0,esk3_0,X1,X2),esk4_0)
| ~ member(esk7_4(esk2_0,esk3_0,X1,X2),esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk8_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk7_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( equal_maps(esk2_0,esk3_0,X1,esk4_0)
| ~ member(esk6_4(esk2_0,esk3_0,X1,esk4_0),esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_31,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk6_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET711+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 0.04/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n009.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 : Sun Jul 10 16:37:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.42 eprover: CPU time limit exceeded, terminating
% 0.39/23.43 eprover: CPU time limit exceeded, terminating
% 0.39/23.53 eprover: CPU time limit exceeded, terminating
% 0.39/23.57 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.39/23.57
% 0.39/23.57 # Failure: Resource limit exceeded (time)
% 0.39/23.57 # OLD status Res
% 0.39/23.57 # Preprocessing time : 0.023 s
% 0.39/23.57 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.39/23.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.39/23.57 # Preprocessing time : 0.010 s
% 0.39/23.57
% 0.39/23.57 # Proof found!
% 0.39/23.57 # SZS status Theorem
% 0.39/23.57 # SZS output start CNFRefutation
% See solution above
% 0.39/23.57 # Proof object total steps : 34
% 0.39/23.57 # Proof object clause steps : 23
% 0.39/23.57 # Proof object formula steps : 11
% 0.39/23.57 # Proof object conjectures : 17
% 0.39/23.57 # Proof object clause conjectures : 14
% 0.39/23.57 # Proof object formula conjectures : 3
% 0.39/23.57 # Proof object initial clauses used : 13
% 0.39/23.57 # Proof object initial formulas used : 5
% 0.39/23.57 # Proof object generating inferences : 10
% 0.39/23.57 # Proof object simplifying inferences : 3
% 0.39/23.57 # Training examples: 0 positive, 0 negative
% 0.39/23.57 # Parsed axioms : 29
% 0.39/23.57 # Removed by relevancy pruning/SinE : 22
% 0.39/23.57 # Initial clauses : 47
% 0.39/23.57 # Removed in clause preprocessing : 0
% 0.39/23.57 # Initial clauses in saturation : 47
% 0.39/23.57 # Processed clauses : 483
% 0.39/23.57 # ...of these trivial : 0
% 0.39/23.57 # ...subsumed : 246
% 0.39/23.57 # ...remaining for further processing : 237
% 0.39/23.57 # Other redundant clauses eliminated : 0
% 0.39/23.57 # Clauses deleted for lack of memory : 0
% 0.39/23.57 # Backward-subsumed : 10
% 0.39/23.57 # Backward-rewritten : 0
% 0.39/23.57 # Generated clauses : 1112
% 0.39/23.57 # ...of the previous two non-trivial : 1093
% 0.39/23.57 # Contextual simplify-reflections : 558
% 0.39/23.57 # Paramodulations : 1110
% 0.39/23.57 # Factorizations : 2
% 0.39/23.57 # Equation resolutions : 0
% 0.39/23.57 # Current number of processed clauses : 227
% 0.39/23.57 # Positive orientable unit clauses : 6
% 0.39/23.57 # Positive unorientable unit clauses: 0
% 0.39/23.57 # Negative unit clauses : 1
% 0.39/23.57 # Non-unit-clauses : 220
% 0.39/23.57 # Current number of unprocessed clauses: 653
% 0.39/23.57 # ...number of literals in the above : 5934
% 0.39/23.57 # Current number of archived formulas : 0
% 0.39/23.57 # Current number of archived clauses : 10
% 0.39/23.57 # Clause-clause subsumption calls (NU) : 58436
% 0.39/23.57 # Rec. Clause-clause subsumption calls : 3097
% 0.39/23.57 # Non-unit clause-clause subsumptions : 814
% 0.39/23.57 # Unit Clause-clause subsumption calls : 3
% 0.39/23.57 # Rewrite failures with RHS unbound : 0
% 0.39/23.57 # BW rewrite match attempts : 0
% 0.39/23.57 # BW rewrite match successes : 0
% 0.39/23.57 # Condensation attempts : 0
% 0.39/23.57 # Condensation successes : 0
% 0.39/23.57 # Termbank termtop insertions : 45477
% 0.39/23.57
% 0.39/23.57 # -------------------------------------------------
% 0.39/23.57 # User time : 0.073 s
% 0.39/23.57 # System time : 0.003 s
% 0.39/23.57 # Total time : 0.076 s
% 0.39/23.57 # Maximum resident set size: 4688 pages
% 0.39/46.43 eprover: CPU time limit exceeded, terminating
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.45 eprover: No such file or directory
% 0.39/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.46 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.47 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.48 eprover: No such file or directory
% 0.39/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.49 eprover: No such file or directory
% 0.39/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.50 eprover: No such file or directory
% 0.39/46.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.39/46.50 eprover: No such file or directory
% 0.39/46.54 eprover: CPU time limit exceeded, terminating
% 0.39/46.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.55 eprover: No such file or directory
% 0.39/46.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.56 eprover: No such file or directory
% 0.39/46.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.56 eprover: No such file or directory
% 0.39/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.57 eprover: No such file or directory
% 0.39/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.57 eprover: No such file or directory
% 0.39/46.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.57 eprover: No such file or directory
% 0.39/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.58 eprover: No such file or directory
% 0.39/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.58 eprover: No such file or directory
% 0.39/46.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.39/46.58 eprover: No such file or directory
%------------------------------------------------------------------------------