TSTP Solution File: NUM403+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM403+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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 : Mon Jul 18 09:32:08 EDT 2022
% Result : Theorem 0.25s 6.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 157 ( 17 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 192 ( 76 ~; 79 |; 21 &)
% ( 5 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-3 aty)
% Number of variables : 84 ( 5 sgn 42 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,succ(X2))
<=> ordinal_subset(X1,X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t34_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_ordinal1) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(redefinition_r1_ordinal1,axiom,
! [X1,X2] :
( ( ordinal(X1)
& ordinal(X2) )
=> ( ordinal_subset(X1,X2)
<=> subset(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_r1_ordinal1) ).
fof(t36_ordinal1,conjecture,
! [X1] :
~ ( ! [X2] :
( in(X2,X1)
=> ordinal(X2) )
& ! [X2] :
( ordinal(X2)
=> ~ subset(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t36_ordinal1) ).
fof(fc3_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( ~ empty(succ(X1))
& epsilon_transitive(succ(X1))
& epsilon_connected(succ(X1))
& ordinal(succ(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc3_ordinal1) ).
fof(t35_ordinal1,axiom,
! [X1] :
( ! [X2] :
( in(X2,X1)
=> ordinal(X2) )
=> ordinal(union(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t35_ordinal1) ).
fof(c_0_8,plain,
! [X3,X4] :
( ( ~ in(X3,succ(X4))
| ordinal_subset(X3,X4)
| ~ ordinal(X4)
| ~ ordinal(X3) )
& ( ~ ordinal_subset(X3,X4)
| in(X3,succ(X4))
| ~ ordinal(X4)
| ~ ordinal(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_ordinal1])])])])])]) ).
fof(c_0_9,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_10,plain,
! [X5,X6,X7,X7,X9,X5,X6,X11] :
( ( in(X7,esk2_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk2_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X7,X9)
| ~ in(X9,X5)
| in(X7,X6)
| X6 != union(X5) )
& ( ~ in(esk3_2(X5,X6),X6)
| ~ in(esk3_2(X5,X6),X11)
| ~ in(X11,X5)
| X6 = union(X5) )
& ( in(esk3_2(X5,X6),esk4_2(X5,X6))
| in(esk3_2(X5,X6),X6)
| X6 = union(X5) )
& ( in(esk4_2(X5,X6),X5)
| in(esk3_2(X5,X6),X6)
| X6 = union(X5) ) ),
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)],[d4_tarski])])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk1_2(X4,X5),X5)
| subset(X4,X5) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_12,plain,
( in(X1,succ(X2))
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ( ~ ordinal_subset(X3,X4)
| subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) )
& ( ~ subset(X3,X4)
| ordinal_subset(X3,X4)
| ~ ordinal(X3)
| ~ ordinal(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_ordinal1])])]) ).
cnf(c_0_15,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X1,set_union2(X2,singleton(X2)))
| ~ ordinal(X2)
| ~ ordinal(X1)
| ~ ordinal_subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( subset(X1,X2)
| in(X3,X4)
| X4 != union(X1)
| ~ in(X3,esk1_2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
~ ( ! [X2] :
( in(X2,X1)
=> ordinal(X2) )
& ! [X2] :
( ordinal(X2)
=> ~ subset(X1,X2) ) ),
inference(assume_negation,[status(cth)],[t36_ordinal1]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,plain,
( in(X1,set_union2(X2,singleton(X2)))
| ~ subset(X1,X2)
| ~ ordinal(X2)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( subset(esk1_2(X1,X2),X3)
| subset(X1,X2)
| in(esk1_2(esk1_2(X1,X2),X3),X4)
| X4 != union(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
fof(c_0_24,negated_conjecture,
! [X4,X5] :
( ( ~ in(X4,esk20_0)
| ordinal(X4) )
& ( ~ ordinal(X5)
| ~ subset(esk20_0,X5) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_20])])])])])])]) ).
cnf(c_0_25,plain,
( subset(X1,set_union2(X2,singleton(X2)))
| ~ subset(esk1_2(X1,set_union2(X2,singleton(X2))),X2)
| ~ ordinal(esk1_2(X1,set_union2(X2,singleton(X2))))
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( subset(esk1_2(X1,X2),X3)
| subset(X1,X2)
| X3 != union(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk20_0) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_28,plain,
! [X2] :
( ( ~ empty(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_transitive(succ(X2))
| ~ ordinal(X2) )
& ( epsilon_connected(succ(X2))
| ~ ordinal(X2) )
& ( ordinal(succ(X2))
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc3_ordinal1])])])]) ).
cnf(c_0_29,plain,
( subset(X1,set_union2(X2,singleton(X2)))
| X2 != union(X1)
| ~ ordinal(esk1_2(X1,set_union2(X2,singleton(X2))))
| ~ ordinal(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( subset(esk20_0,X1)
| ordinal(esk1_2(esk20_0,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_31,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_32,plain,
! [X3] :
( ( in(esk19_1(X3),X3)
| ordinal(union(X3)) )
& ( ~ ordinal(esk19_1(X3))
| ordinal(union(X3)) ) ),
inference(distribute,[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)],[t35_ordinal1])])])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ subset(esk20_0,X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,negated_conjecture,
( subset(esk20_0,set_union2(X1,singleton(X1)))
| X1 != union(esk20_0)
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_31,c_0_13]) ).
cnf(c_0_36,plain,
( ordinal(union(X1))
| in(esk19_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( ordinal(union(X1))
| ~ ordinal(esk19_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( X1 != union(esk20_0)
| ~ ordinal(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_39,negated_conjecture,
ordinal(union(esk20_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_36]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM403+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.11 % Command : run_ET %s %d
% 0.12/0.32 % Computer : n016.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jul 6 22:57:20 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.25/6.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/6.42 # Preprocessing time : 0.018 s
% 0.25/6.42
% 0.25/6.42 # Proof found!
% 0.25/6.42 # SZS status Theorem
% 0.25/6.42 # SZS output start CNFRefutation
% See solution above
% 0.25/6.42 # Proof object total steps : 41
% 0.25/6.42 # Proof object clause steps : 24
% 0.25/6.42 # Proof object formula steps : 17
% 0.25/6.42 # Proof object conjectures : 10
% 0.25/6.42 # Proof object clause conjectures : 7
% 0.25/6.42 # Proof object formula conjectures : 3
% 0.25/6.42 # Proof object initial clauses used : 11
% 0.25/6.42 # Proof object initial formulas used : 8
% 0.25/6.42 # Proof object generating inferences : 11
% 0.25/6.42 # Proof object simplifying inferences : 6
% 0.25/6.42 # Training examples: 0 positive, 0 negative
% 0.25/6.42 # Parsed axioms : 53
% 0.25/6.42 # Removed by relevancy pruning/SinE : 0
% 0.25/6.42 # Initial clauses : 108
% 0.25/6.42 # Removed in clause preprocessing : 3
% 0.25/6.42 # Initial clauses in saturation : 105
% 0.25/6.42 # Processed clauses : 9083
% 0.25/6.42 # ...of these trivial : 21
% 0.25/6.42 # ...subsumed : 3929
% 0.25/6.42 # ...remaining for further processing : 5133
% 0.25/6.42 # Other redundant clauses eliminated : 0
% 0.25/6.42 # Clauses deleted for lack of memory : 234909
% 0.25/6.42 # Backward-subsumed : 137
% 0.25/6.42 # Backward-rewritten : 35
% 0.25/6.42 # Generated clauses : 361931
% 0.25/6.42 # ...of the previous two non-trivial : 360785
% 0.25/6.42 # Contextual simplify-reflections : 3900
% 0.25/6.42 # Paramodulations : 361399
% 0.25/6.42 # Factorizations : 16
% 0.25/6.42 # Equation resolutions : 375
% 0.25/6.42 # Current number of processed clauses : 4906
% 0.25/6.42 # Positive orientable unit clauses : 102
% 0.25/6.42 # Positive unorientable unit clauses: 1
% 0.25/6.42 # Negative unit clauses : 65
% 0.25/6.42 # Non-unit-clauses : 4738
% 0.25/6.42 # Current number of unprocessed clauses: 105938
% 0.25/6.42 # ...number of literals in the above : 531499
% 0.25/6.42 # Current number of archived formulas : 0
% 0.25/6.42 # Current number of archived clauses : 173
% 0.25/6.42 # Clause-clause subsumption calls (NU) : 3256137
% 0.25/6.42 # Rec. Clause-clause subsumption calls : 1230702
% 0.25/6.42 # Non-unit clause-clause subsumptions : 7371
% 0.25/6.42 # Unit Clause-clause subsumption calls : 35100
% 0.25/6.42 # Rewrite failures with RHS unbound : 0
% 0.25/6.42 # BW rewrite match attempts : 253
% 0.25/6.42 # BW rewrite match successes : 19
% 0.25/6.42 # Condensation attempts : 0
% 0.25/6.42 # Condensation successes : 0
% 0.25/6.42 # Termbank termtop insertions : 6200503
% 0.25/6.42
% 0.25/6.42 # -------------------------------------------------
% 0.25/6.42 # User time : 4.962 s
% 0.25/6.42 # System time : 0.099 s
% 0.25/6.42 # Total time : 5.061 s
% 0.25/6.42 # Maximum resident set size: 132488 pages
% 0.25/23.38 eprover: CPU time limit exceeded, terminating
% 0.25/23.39 eprover: CPU time limit exceeded, terminating
% 0.25/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.40 eprover: No such file or directory
% 0.25/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.40 eprover: No such file or directory
% 0.25/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.40 eprover: No such file or directory
% 0.25/23.40 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.40 eprover: No such file or directory
% 0.25/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.41 eprover: No such file or directory
% 0.25/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.41 eprover: No such file or directory
% 0.25/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.41 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 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.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.45 eprover: CPU time limit exceeded, terminating
% 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.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.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.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
% 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
%------------------------------------------------------------------------------