TSTP Solution File: ITP006+5 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : ITP006+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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 : Sat Jul 16 22:45:46 EDT 2022
% Result : Theorem 0.80s 24.98s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 146 ( 7 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 179 ( 68 ~; 68 |; 11 &)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-4 aty)
% Number of variables : 65 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT,conjecture,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X96] :
( mem(X96,arr(X11,X9))
=> ! [X45] :
( mem(X45,arr(X9,bool))
=> ! [X67] :
( mem(X67,arr(X9,bool))
=> ( ! [X22] :
( mem(X22,X9)
=> ( p(ap(X67,X22))
=> p(ap(X45,X22)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X11,X9),X96),X45))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X11,X9),X96),X67)) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT) ).
fof(boolext,axiom,
! [X5] :
( mem(X5,bool)
=> ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001+2.ax',boolext) ).
fof(ax_thm_2Ebool_2EF__DEF,axiom,
( ~ $true
<=> ! [X16] :
( mem(X16,bool)
=> p(X16) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP003+5.ax',ax_thm_2Ebool_2EF__DEF) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def,axiom,
! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X96] :
( mem(X96,arr(X9,X11))
=> ! [X45] :
( mem(X45,arr(X11,bool))
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X9,X11),X96),X45))
<=> ! [X793] :
( mem(X793,X9)
=> ~ p(ap(X45,ap(X96,X793))) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def) ).
fof(c_0_5,negated_conjecture,
~ ! [X9] :
( ne(X9)
=> ! [X11] :
( ne(X11)
=> ! [X96] :
( mem(X96,arr(X11,X9))
=> ! [X45] :
( mem(X45,arr(X9,bool))
=> ! [X67] :
( mem(X67,arr(X9,bool))
=> ( ! [X22] :
( mem(X22,X9)
=> ( p(ap(X67,X22))
=> p(ap(X45,X22)) ) )
=> ( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X11,X9),X96),X45))
=> p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X11,X9),X96),X67)) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2EquantHeuristics_2EGUESS__RULES__WEAKEN__FORALL__POINT]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ( ~ p(X7)
| ~ p(X8)
| X7 = X8
| ~ mem(X8,bool)
| ~ mem(X7,bool) )
& ( p(X7)
| p(X8)
| X7 = X8
| ~ mem(X8,bool)
| ~ mem(X7,bool) ) ),
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)],[boolext])])])])])]) ).
fof(c_0_7,plain,
( mem(esk6_0,bool)
& ~ p(esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax_thm_2Ebool_2EF__DEF])])])]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8] :
( ~ mem(X7,arr(X5,X6))
| ~ mem(X8,X5)
| mem(ap(X7,X8),X6) ),
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)],[ap_tp])])])])]) ).
fof(c_0_9,negated_conjecture,
! [X102] :
( ne(esk1_0)
& ne(esk2_0)
& mem(esk3_0,arr(esk2_0,esk1_0))
& mem(esk4_0,arr(esk1_0,bool))
& mem(esk5_0,arr(esk1_0,bool))
& ( ~ mem(X102,esk1_0)
| ~ p(ap(esk5_0,X102))
| p(ap(esk4_0,X102)) )
& p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk4_0))
& ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk5_0)) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_10,plain,
! [X794,X795,X796,X797,X798] :
( ( ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X794,X795),X796),X797))
| ~ mem(X798,X794)
| ~ p(ap(X797,ap(X796,X798)))
| ~ mem(X797,arr(X795,bool))
| ~ mem(X796,arr(X794,X795))
| ~ ne(X795)
| ~ ne(X794) )
& ( mem(esk95_4(X794,X795,X796,X797),X794)
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X794,X795),X796),X797))
| ~ mem(X797,arr(X795,bool))
| ~ mem(X796,arr(X794,X795))
| ~ ne(X795)
| ~ ne(X794) )
& ( p(ap(X797,ap(X796,esk95_4(X794,X795,X796,X797))))
| p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X794,X795),X796),X797))
| ~ mem(X797,arr(X795,bool))
| ~ mem(X796,arr(X794,X795))
| ~ ne(X795)
| ~ ne(X794) ) ),
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)],[ax_thm_2EquantHeuristics_2EGUESS__FORALL__POINT__def])])])])])])])]) ).
cnf(c_0_11,plain,
( X1 = X2
| p(X2)
| p(X1)
| ~ mem(X1,bool)
| ~ mem(X2,bool) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
mem(esk6_0,bool),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
~ p(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( mem(ap(X1,X2),X3)
| ~ mem(X2,X4)
| ~ mem(X1,arr(X4,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
mem(esk5_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool))
| ~ p(ap(X4,ap(X3,X5)))
| ~ mem(X5,X1)
| ~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
mem(esk4_0,arr(esk1_0,bool)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
mem(esk3_0,arr(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
ne(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
ne(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( p(ap(esk4_0,X1))
| ~ p(ap(esk5_0,X1))
| ~ mem(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,plain,
( X1 = esk6_0
| p(X1)
| ~ mem(X1,bool) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( mem(ap(esk5_0,X1),bool)
| ~ mem(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( ~ p(ap(esk4_0,ap(esk3_0,X1)))
| ~ mem(X1,esk2_0) ),
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_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( ap(esk5_0,X1) = esk6_0
| p(ap(esk4_0,X1))
| ~ mem(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( mem(ap(esk3_0,X1),esk1_0)
| ~ mem(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_28,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4))
| p(ap(X4,ap(X3,esk95_4(X1,X2,X3,X4))))
| ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_29,negated_conjecture,
( ap(esk5_0,ap(esk3_0,X1)) = esk6_0
| ~ mem(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),esk3_0),esk5_0))
| ~ mem(esk95_4(X1,X2,esk3_0,esk5_0),esk2_0)
| ~ mem(esk5_0,arr(X2,bool))
| ~ mem(esk3_0,arr(X1,X2))
| ~ ne(X2)
| ~ ne(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_13]) ).
cnf(c_0_31,plain,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(X1,X2),X3),X4))
| mem(esk95_4(X1,X2,X3,X4),X1)
| ~ ne(X1)
| ~ ne(X2)
| ~ mem(X3,arr(X1,X2))
| ~ mem(X4,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
~ p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,esk1_0),esk3_0),esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,negated_conjecture,
( p(ap(ap(c_2EquantHeuristics_2EGUESS__FORALL__POINT(esk2_0,X1),esk3_0),esk5_0))
| ~ mem(esk5_0,arr(X1,bool))
| ~ mem(esk3_0,arr(esk2_0,X1))
| ~ ne(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_21])]) ).
cnf(c_0_34,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_32,c_0_33]),c_0_15]),c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP006+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 3 12:23:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/23.82 eprover: CPU time limit exceeded, terminating
% 0.80/23.82 eprover: CPU time limit exceeded, terminating
% 0.80/23.83 eprover: CPU time limit exceeded, terminating
% 0.80/23.85 eprover: CPU time limit exceeded, terminating
% 0.80/24.98 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.80/24.98
% 0.80/24.98 # Failure: Resource limit exceeded (time)
% 0.80/24.98 # OLD status Res
% 0.80/24.98 # Preprocessing time : 1.476 s
% 0.80/24.98 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.80/24.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.80/24.98 # Preprocessing time : 0.294 s
% 0.80/24.98
% 0.80/24.98 # Proof found!
% 0.80/24.98 # SZS status Theorem
% 0.80/24.98 # SZS output start CNFRefutation
% See solution above
% 0.80/24.98 # Proof object total steps : 35
% 0.80/24.98 # Proof object clause steps : 24
% 0.80/24.98 # Proof object formula steps : 11
% 0.80/24.98 # Proof object conjectures : 19
% 0.80/24.98 # Proof object clause conjectures : 16
% 0.80/24.98 # Proof object formula conjectures : 3
% 0.80/24.98 # Proof object initial clauses used : 15
% 0.80/24.98 # Proof object initial formulas used : 5
% 0.80/24.98 # Proof object generating inferences : 9
% 0.80/24.98 # Proof object simplifying inferences : 15
% 0.80/24.98 # Training examples: 0 positive, 0 negative
% 0.80/24.98 # Parsed axioms : 4453
% 0.80/24.98 # Removed by relevancy pruning/SinE : 4248
% 0.80/24.98 # Initial clauses : 1247
% 0.80/24.98 # Removed in clause preprocessing : 775
% 0.80/24.98 # Initial clauses in saturation : 472
% 0.80/24.98 # Processed clauses : 546
% 0.80/24.98 # ...of these trivial : 0
% 0.80/24.98 # ...subsumed : 44
% 0.80/24.98 # ...remaining for further processing : 502
% 0.80/24.98 # Other redundant clauses eliminated : 0
% 0.80/24.98 # Clauses deleted for lack of memory : 0
% 0.80/24.98 # Backward-subsumed : 3
% 0.80/24.98 # Backward-rewritten : 5
% 0.80/24.98 # Generated clauses : 14294
% 0.80/24.98 # ...of the previous two non-trivial : 14236
% 0.80/24.98 # Contextual simplify-reflections : 63
% 0.80/24.98 # Paramodulations : 14288
% 0.80/24.98 # Factorizations : 0
% 0.80/24.98 # Equation resolutions : 3
% 0.80/24.98 # Current number of processed clauses : 493
% 0.80/24.98 # Positive orientable unit clauses : 13
% 0.80/24.98 # Positive unorientable unit clauses: 0
% 0.80/24.98 # Negative unit clauses : 2
% 0.80/24.98 # Non-unit-clauses : 478
% 0.80/24.98 # Current number of unprocessed clauses: 14031
% 0.80/24.98 # ...number of literals in the above : 137724
% 0.80/24.98 # Current number of archived formulas : 0
% 0.80/24.98 # Current number of archived clauses : 8
% 0.80/24.98 # Clause-clause subsumption calls (NU) : 88720
% 0.80/24.98 # Rec. Clause-clause subsumption calls : 1061
% 0.80/24.98 # Non-unit clause-clause subsumptions : 99
% 0.80/24.98 # Unit Clause-clause subsumption calls : 258
% 0.80/24.98 # Rewrite failures with RHS unbound : 0
% 0.80/24.98 # BW rewrite match attempts : 3
% 0.80/24.98 # BW rewrite match successes : 2
% 0.80/24.98 # Condensation attempts : 0
% 0.80/24.98 # Condensation successes : 0
% 0.80/24.98 # Termbank termtop insertions : 849833
% 0.80/24.98
% 0.80/24.98 # -------------------------------------------------
% 0.80/24.98 # User time : 0.958 s
% 0.80/24.98 # System time : 0.021 s
% 0.80/24.98 # Total time : 0.979 s
% 0.80/24.98 # Maximum resident set size: 36488 pages
% 0.80/46.84 eprover: CPU time limit exceeded, terminating
% 0.80/46.84 eprover: CPU time limit exceeded, terminating
% 0.80/46.85 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.85 eprover: No such file or directory
% 0.80/46.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.86 eprover: No such file or directory
% 0.80/46.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.86 eprover: No such file or directory
% 0.80/46.86 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.86 eprover: No such file or directory
% 0.80/46.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.87 eprover: No such file or directory
% 0.80/46.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.87 eprover: No such file or directory
% 0.80/46.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.87 eprover: No such file or directory
% 0.80/46.87 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.87 eprover: No such file or directory
% 0.80/46.88 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.88 eprover: No such file or directory
% 0.80/46.88 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.88 eprover: No such file or directory
% 0.80/46.88 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.88 eprover: No such file or directory
% 0.80/46.89 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.89 eprover: No such file or directory
% 0.80/46.89 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.89 eprover: No such file or directory
% 0.80/46.89 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.89 eprover: No such file or directory
% 0.80/46.90 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.90 eprover: No such file or directory
% 0.80/46.90 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.90 eprover: No such file or directory
% 0.80/46.90 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.90 eprover: No such file or directory
% 0.80/46.90 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.90 eprover: No such file or directory
% 0.80/46.91 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.91 eprover: No such file or directory
% 0.80/46.91 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.80/46.91 eprover: No such file or directory
%------------------------------------------------------------------------------