TSTP Solution File: SEU376+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 09:19:29 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 248 ( 0 equ)
% Maximal formula atoms : 35 ( 8 avg)
% Number of connectives : 340 ( 123 ~; 158 |; 38 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 79 ( 2 sgn 37 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d12_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( element(X5,the_carrier(X2))
& related(X2,X4,X5)
& in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d12_waybel_0) ).
fof(d5_yellow_6,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& rel_str(X1) )
=> ( directed_relstr(X1)
<=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ? [X4] :
( element(X4,the_carrier(X1))
& related(X1,X2,X4)
& related(X1,X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_yellow_6) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_waybel_0) ).
fof(d11_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( element(X4,the_carrier(X2))
& ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d11_waybel_0) ).
fof(t28_yellow_6,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_yellow_6) ).
fof(c_0_5,plain,
! [X6,X7,X8,X9,X8,X12] :
( ( element(esk4_4(X6,X7,X8,X9),the_carrier(X7))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X9,esk4_4(X6,X7,X8,X9))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( in(apply_netmap(X6,X7,esk4_4(X6,X7,X8,X9)),X8)
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk5_3(X6,X7,X8),the_carrier(X7))
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk5_3(X6,X7,X8),X12)
| ~ in(apply_netmap(X6,X7,X12),X8)
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
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)],[inference(fof_simplification,[status(thm)],[d12_waybel_0])])])])])])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X11] :
( ( element(esk9_3(X5,X6,X7),the_carrier(X5))
| ~ element(X7,the_carrier(X5))
| ~ element(X6,the_carrier(X5))
| ~ directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( related(X5,X6,esk9_3(X5,X6,X7))
| ~ element(X7,the_carrier(X5))
| ~ element(X6,the_carrier(X5))
| ~ directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( related(X5,X7,esk9_3(X5,X6,X7))
| ~ element(X7,the_carrier(X5))
| ~ element(X6,the_carrier(X5))
| ~ directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( element(esk10_1(X5),the_carrier(X5))
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( element(esk11_1(X5),the_carrier(X5))
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(X5) )
& ( ~ element(X11,the_carrier(X5))
| ~ related(X5,esk10_1(X5),X11)
| ~ related(X5,esk11_1(X5),X11)
| directed_relstr(X5)
| empty_carrier(X5)
| ~ rel_str(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)],[inference(fof_simplification,[status(thm)],[d5_yellow_6])])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ one_sorted_str(X3)
| ~ net_str(X4,X3)
| rel_str(X4) ),
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)],[dt_l1_waybel_0])])])])]) ).
fof(c_0_8,plain,
! [X6,X7,X8,X10,X8,X11] :
( ( element(esk6_3(X6,X7,X8),the_carrier(X7))
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X10,the_carrier(X7))
| ~ related(X7,esk6_3(X6,X7,X8),X10)
| in(apply_netmap(X6,X7,X10),X8)
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk7_4(X6,X7,X8,X11),the_carrier(X7))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X11,esk7_4(X6,X7,X8,X11))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ in(apply_netmap(X6,X7,esk7_4(X6,X7,X8,X11)),X8)
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
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)],[inference(fof_simplification,[status(thm)],[d11_waybel_0])])])])])])])]) ).
cnf(c_0_9,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ in(apply_netmap(X1,X2,X4),X3)
| ~ related(X2,esk5_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( empty_carrier(X1)
| related(X1,X3,esk9_3(X1,X2,X3))
| ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| element(esk5_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( rel_str(X1)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,X4),X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ related(X2,esk6_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( empty_carrier(X1)
| related(X1,X2,esk9_3(X1,X2,X3))
| ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk6_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t28_yellow_6]) ).
cnf(c_0_17,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk9_3(X2,X4,esk5_3(X1,X2,X3)),the_carrier(X2))
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk9_3(X2,X4,esk5_3(X1,X2,X3))),X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]) ).
cnf(c_0_18,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X2,X1,esk9_3(X1,esk6_3(X2,X1,X3),X4)),X3)
| ~ directed_relstr(X1)
| ~ is_eventually_in(X2,X1,X3)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ element(esk9_3(X1,esk6_3(X2,X1,X3),X4),the_carrier(X1))
| ~ element(X4,the_carrier(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12]) ).
fof(c_0_19,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& transitive_relstr(esk2_0)
& directed_relstr(esk2_0)
& net_str(esk2_0,esk1_0)
& is_eventually_in(esk1_0,esk2_0,esk3_0)
& ~ is_often_in(esk1_0,esk2_0,esk3_0) ),
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_16])])])])])]) ).
cnf(c_0_20,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk9_3(X2,esk6_3(X1,X2,X3),esk5_3(X1,X2,X3)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11]),c_0_15]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| element(esk9_3(X1,X2,X3),the_carrier(X1))
| ~ rel_str(X1)
| ~ directed_relstr(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
~ is_often_in(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ directed_relstr(X2)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]),c_0_11]),c_0_12]) ).
cnf(c_0_24,negated_conjecture,
directed_relstr(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
is_eventually_in(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25]),c_0_26]),c_0_27])]),c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU376+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n006.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 : Mon Jun 20 10:02:55 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.020 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 : 31
% 0.23/1.41 # Proof object clause steps : 20
% 0.23/1.41 # Proof object formula steps : 11
% 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 : 15
% 0.23/1.41 # Proof object initial formulas used : 5
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 16
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 61
% 0.23/1.41 # Removed by relevancy pruning/SinE : 23
% 0.23/1.41 # Initial clauses : 73
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 73
% 0.23/1.41 # Processed clauses : 1955
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 1295
% 0.23/1.41 # ...remaining for further processing : 660
% 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 : 59
% 0.23/1.41 # Backward-rewritten : 7
% 0.23/1.41 # Generated clauses : 6695
% 0.23/1.41 # ...of the previous two non-trivial : 6490
% 0.23/1.41 # Contextual simplify-reflections : 1818
% 0.23/1.41 # Paramodulations : 6695
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 594
% 0.23/1.41 # Positive orientable unit clauses : 26
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 7
% 0.23/1.41 # Non-unit-clauses : 561
% 0.23/1.41 # Current number of unprocessed clauses: 3722
% 0.23/1.41 # ...number of literals in the above : 28067
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 66
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 616534
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 103635
% 0.23/1.41 # Non-unit clause-clause subsumptions : 3154
% 0.23/1.41 # Unit Clause-clause subsumption calls : 354
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 2
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 177861
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.385 s
% 0.23/1.41 # System time : 0.003 s
% 0.23/1.41 # Total time : 0.388 s
% 0.23/1.41 # Maximum resident set size: 8976 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/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/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
% 0.23/23.43 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
% 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
% 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.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
%------------------------------------------------------------------------------