%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU269+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 09:18:28 EDT 2022
% Result : Theorem 0.22s 1.42s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 47 ( 11 unt; 0 def)
% Number of atoms : 188 ( 25 equ)
% Maximal formula atoms : 33 ( 4 avg)
% Number of connectives : 225 ( 84 ~; 111 |; 20 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-2 aty)
% Number of variables : 93 ( 3 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d8_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_transitive_in(X1,X2)
<=> ! [X3,X4,X5] :
( ( in(X3,X2)
& in(X4,X2)
& in(X5,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X5),X1) )
=> in(ordered_pair(X3,X5),X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d8_relat_2) ).
fof(dt_k1_wellord2,axiom,
! [X1] : relation(inclusion_relation(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k1_wellord2) ).
fof(d1_wellord2,axiom,
! [X1,X2] :
( relation(X2)
=> ( X2 = inclusion_relation(X1)
<=> ( relation_field(X2) = X1
& ! [X3,X4] :
( ( in(X3,X1)
& in(X4,X1) )
=> ( in(ordered_pair(X3,X4),X2)
<=> subset(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d1_wellord2) ).
fof(t1_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t1_xboole_1) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d16_relat_2) ).
fof(t3_wellord2,conjecture,
! [X1] : transitive(inclusion_relation(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t3_wellord2) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X10,X7] :
( ( ~ is_transitive_in(X6,X7)
| ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6)
| ~ relation(X6) )
& ( in(esk4_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk5_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk6_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk4_2(X6,X7),esk5_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk5_2(X6,X7),esk6_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk4_2(X6,X7),esk6_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(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)],[d8_relat_2])])])])])])]) ).
fof(c_0_7,plain,
! [X2] : relation(inclusion_relation(X2)),
inference(variable_rename,[status(thm)],[dt_k1_wellord2]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8] :
( ( relation_field(X6) = X5
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ in(ordered_pair(X7,X8),X6)
| subset(X7,X8)
| ~ in(X7,X5)
| ~ in(X8,X5)
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ subset(X7,X8)
| in(ordered_pair(X7,X8),X6)
| ~ in(X7,X5)
| ~ in(X8,X5)
| X6 != inclusion_relation(X5)
| ~ relation(X6) )
& ( in(esk2_2(X5,X6),X5)
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( in(esk3_2(X5,X6),X5)
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6)
| ~ subset(esk2_2(X5,X6),esk3_2(X5,X6))
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(X6) )
& ( in(ordered_pair(esk2_2(X5,X6),esk3_2(X5,X6)),X6)
| subset(esk2_2(X5,X6),esk3_2(X5,X6))
| relation_field(X6) != X5
| X6 = inclusion_relation(X5)
| ~ relation(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)],[d1_wellord2])])])])])])]) ).
cnf(c_0_9,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk5_2(X1,X2),esk6_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
relation(inclusion_relation(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X4,X3)
| ~ relation(X1)
| X1 != inclusion_relation(X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ in(ordered_pair(X4,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( is_transitive_in(inclusion_relation(X1),X2)
| in(ordered_pair(esk5_2(inclusion_relation(X1),X2),esk6_2(inclusion_relation(X1),X2)),inclusion_relation(X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( is_transitive_in(X1,X2)
| in(esk5_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( is_transitive_in(X1,X2)
| in(esk6_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk4_2(X1,X2),esk5_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( subset(esk5_2(inclusion_relation(X1),X2),esk6_2(inclusion_relation(X1),X2))
| is_transitive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X3)
| ~ in(esk5_2(inclusion_relation(X1),X2),X3)
| ~ in(esk6_2(inclusion_relation(X1),X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10])]) ).
cnf(c_0_17,plain,
( is_transitive_in(inclusion_relation(X1),X2)
| in(esk5_2(inclusion_relation(X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,plain,
( is_transitive_in(inclusion_relation(X1),X2)
| in(esk6_2(inclusion_relation(X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_19,plain,
( is_transitive_in(inclusion_relation(X1),X2)
| in(ordered_pair(esk4_2(inclusion_relation(X1),X2),esk5_2(inclusion_relation(X1),X2)),inclusion_relation(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
( is_transitive_in(X1,X2)
| in(esk4_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_21,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
cnf(c_0_22,plain,
( subset(esk5_2(inclusion_relation(X1),X2),esk6_2(inclusion_relation(X1),X2))
| is_transitive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_23,plain,
( subset(esk4_2(inclusion_relation(X1),X2),esk5_2(inclusion_relation(X1),X2))
| is_transitive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X3)
| ~ in(esk4_2(inclusion_relation(X1),X2),X3)
| ~ in(esk5_2(inclusion_relation(X1),X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_10])]) ).
cnf(c_0_24,plain,
( is_transitive_in(inclusion_relation(X1),X2)
| in(esk4_2(inclusion_relation(X1),X2),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_25,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( subset(esk5_2(inclusion_relation(X1),X1),esk6_2(inclusion_relation(X1),X1))
| is_transitive_in(inclusion_relation(X1),X1) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
( subset(esk4_2(inclusion_relation(X1),X2),esk5_2(inclusion_relation(X1),X2))
| is_transitive_in(inclusion_relation(X1),X2)
| inclusion_relation(X1) != inclusion_relation(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17]) ).
cnf(c_0_28,plain,
( subset(X1,esk6_2(inclusion_relation(X2),X2))
| is_transitive_in(inclusion_relation(X2),X2)
| ~ subset(X1,esk5_2(inclusion_relation(X2),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( subset(esk4_2(inclusion_relation(X1),X1),esk5_2(inclusion_relation(X1),X1))
| is_transitive_in(inclusion_relation(X1),X1) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_30,plain,
( in(ordered_pair(X4,X3),X1)
| ~ relation(X1)
| X1 != inclusion_relation(X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ subset(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_31,plain,
( subset(esk4_2(inclusion_relation(X1),X1),esk6_2(inclusion_relation(X1),X1))
| is_transitive_in(inclusion_relation(X1),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( is_transitive_in(inclusion_relation(X1),X1)
| in(ordered_pair(esk4_2(inclusion_relation(X1),X1),esk6_2(inclusion_relation(X1),X1)),X2)
| X2 != inclusion_relation(X3)
| ~ relation(X2)
| ~ in(esk4_2(inclusion_relation(X1),X1),X3)
| ~ in(esk6_2(inclusion_relation(X1),X1),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_33,plain,
! [X2] :
( ( ~ transitive(X2)
| is_transitive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_transitive_in(X2,relation_field(X2))
| transitive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])]) ).
cnf(c_0_34,plain,
( relation_field(X1) = X2
| ~ relation(X1)
| X1 != inclusion_relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,plain,
( is_transitive_in(inclusion_relation(X1),X1)
| in(ordered_pair(esk4_2(inclusion_relation(X1),X1),esk6_2(inclusion_relation(X1),X1)),X2)
| X2 != inclusion_relation(X1)
| ~ relation(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_18]) ).
fof(c_0_36,negated_conjecture,
~ ! [X1] : transitive(inclusion_relation(X1)),
inference(assume_negation,[status(cth)],[t3_wellord2]) ).
cnf(c_0_37,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
relation_field(inclusion_relation(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_10])]) ).
cnf(c_0_39,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(ordered_pair(esk4_2(X1,X2),esk6_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_40,plain,
( is_transitive_in(inclusion_relation(X1),X1)
| in(ordered_pair(esk4_2(inclusion_relation(X1),X1),esk6_2(inclusion_relation(X1),X1)),inclusion_relation(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_10])]) ).
fof(c_0_41,negated_conjecture,
~ transitive(inclusion_relation(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
cnf(c_0_42,plain,
( transitive(inclusion_relation(X1))
| ~ is_transitive_in(inclusion_relation(X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_10])]) ).
cnf(c_0_43,plain,
is_transitive_in(inclusion_relation(X1),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_10])]) ).
cnf(c_0_44,negated_conjecture,
~ transitive(inclusion_relation(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
transitive(inclusion_relation(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU269+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n016.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 : Sun Jun 19 11:57:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.42 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.22/1.42 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.22/1.42 # Preprocessing time : 0.016 s
% 0.22/1.42
% 0.22/1.42 # Proof found!
% 0.22/1.42 # SZS status Theorem
% 0.22/1.42 # SZS output start CNFRefutation
% See solution above
% 0.22/1.42 # Proof object total steps : 47
% 0.22/1.42 # Proof object clause steps : 34
% 0.22/1.42 # Proof object formula steps : 13
% 0.22/1.42 # Proof object conjectures : 5
% 0.22/1.42 # Proof object clause conjectures : 2
% 0.22/1.42 # Proof object formula conjectures : 3
% 0.22/1.42 # Proof object initial clauses used : 13
% 0.22/1.42 # Proof object initial formulas used : 6
% 0.22/1.42 # Proof object generating inferences : 19
% 0.22/1.42 # Proof object simplifying inferences : 19
% 0.22/1.42 # Training examples: 0 positive, 0 negative
% 0.22/1.42 # Parsed axioms : 52
% 0.22/1.42 # Removed by relevancy pruning/SinE : 42
% 0.22/1.42 # Initial clauses : 23
% 0.22/1.42 # Removed in clause preprocessing : 0
% 0.22/1.42 # Initial clauses in saturation : 23
% 0.22/1.42 # Processed clauses : 105
% 0.22/1.42 # ...of these trivial : 0
% 0.22/1.42 # ...subsumed : 14
% 0.22/1.42 # ...remaining for further processing : 91
% 0.22/1.42 # Other redundant clauses eliminated : 3
% 0.22/1.42 # Clauses deleted for lack of memory : 0
% 0.22/1.42 # Backward-subsumed : 0
% 0.22/1.42 # Backward-rewritten : 15
% 0.22/1.42 # Generated clauses : 117
% 0.22/1.42 # ...of the previous two non-trivial : 93
% 0.22/1.42 # Contextual simplify-reflections : 11
% 0.22/1.42 # Paramodulations : 93
% 0.22/1.42 # Factorizations : 0
% 0.22/1.42 # Equation resolutions : 24
% 0.22/1.42 # Current number of processed clauses : 76
% 0.22/1.42 # Positive orientable unit clauses : 5
% 0.22/1.42 # Positive unorientable unit clauses: 0
% 0.22/1.42 # Negative unit clauses : 1
% 0.22/1.42 # Non-unit-clauses : 70
% 0.22/1.42 # Current number of unprocessed clauses: 6
% 0.22/1.42 # ...number of literals in the above : 16
% 0.22/1.42 # Current number of archived formulas : 0
% 0.22/1.42 # Current number of archived clauses : 15
% 0.22/1.42 # Clause-clause subsumption calls (NU) : 2850
% 0.22/1.42 # Rec. Clause-clause subsumption calls : 1122
% 0.22/1.42 # Non-unit clause-clause subsumptions : 25
% 0.22/1.42 # Unit Clause-clause subsumption calls : 104
% 0.22/1.42 # Rewrite failures with RHS unbound : 0
% 0.22/1.42 # BW rewrite match attempts : 5
% 0.22/1.42 # BW rewrite match successes : 3
% 0.22/1.42 # Condensation attempts : 0
% 0.22/1.42 # Condensation successes : 0
% 0.22/1.42 # Termbank termtop insertions : 5905
% 0.22/1.42
% 0.22/1.42 # -------------------------------------------------
% 0.22/1.42 # User time : 0.023 s
% 0.22/1.42 # System time : 0.001 s
% 0.22/1.42 # Total time : 0.024 s
% 0.22/1.42 # Maximum resident set size: 3032 pages
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------