TSTP Solution File: SEU422+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU422+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:59 EDT 2022
% Result : Theorem 0.70s 98.87s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 8 unt; 0 def)
% Number of atoms : 112 ( 4 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 126 ( 49 ~; 54 |; 12 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 74 ( 7 sgn 37 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t37_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(k1_tarski(X1),X2)
<=> r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t37_zfmisc_1) ).
fof(fraenkel_a_2_0_relset_2,axiom,
! [X1,X2,X3] :
( ( ~ v1_xboole_0(X2)
& m1_subset_1(X3,k1_zfmisc_1(X2)) )
=> ( r2_hidden(X1,a_2_0_relset_2(X2,X3))
<=> ? [X4] :
( m1_subset_1(X4,X2)
& X1 = k1_tarski(X4)
& r2_hidden(X4,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fraenkel_a_2_0_relset_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,X2)
=> ( v1_xboole_0(X2)
| r2_hidden(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( m1_subset_1(X1,k1_zfmisc_1(X2))
<=> r1_tarski(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ v1_xboole_0(k1_zfmisc_1(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_subset_1) ).
fof(t16_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_relset_2) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( r1_tarski(X1,X2)
<=> ! [X3] :
( r2_hidden(X3,X1)
=> r2_hidden(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( ~ r1_tarski(k1_tarski(X3),X4)
| r2_hidden(X3,X4) )
& ( ~ r2_hidden(X3,X4)
| r1_tarski(k1_tarski(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t37_zfmisc_1])])])]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X9] :
( ( m1_subset_1(esk5_3(X5,X6,X7),X6)
| ~ r2_hidden(X5,a_2_0_relset_2(X6,X7))
| v1_xboole_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(X6)) )
& ( X5 = k1_tarski(esk5_3(X5,X6,X7))
| ~ r2_hidden(X5,a_2_0_relset_2(X6,X7))
| v1_xboole_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(X6)) )
& ( r2_hidden(esk5_3(X5,X6,X7),X7)
| ~ r2_hidden(X5,a_2_0_relset_2(X6,X7))
| v1_xboole_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(X6)) )
& ( ~ m1_subset_1(X9,X6)
| X5 != k1_tarski(X9)
| ~ r2_hidden(X9,X7)
| r2_hidden(X5,a_2_0_relset_2(X6,X7))
| v1_xboole_0(X6)
| ~ m1_subset_1(X7,k1_zfmisc_1(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)],[fraenkel_a_2_0_relset_2])])])])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ m1_subset_1(X3,X4)
| v1_xboole_0(X4)
| r2_hidden(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_10,plain,
! [X3,X4,X3,X4] :
( ( ~ m1_subset_1(X3,k1_zfmisc_1(X4))
| r1_tarski(X3,X4) )
& ( ~ r1_tarski(X3,X4)
| m1_subset_1(X3,k1_zfmisc_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_11,plain,
! [X2] : ~ v1_xboole_0(k1_zfmisc_1(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_subset_1])]) ).
cnf(c_0_12,plain,
( r1_tarski(k1_tarski(X1),X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( v1_xboole_0(X2)
| X3 = k1_tarski(esk5_3(X3,X2,X1))
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r2_hidden(X3,a_2_0_relset_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( r2_hidden(X1,X2)
| v1_xboole_0(X2)
| ~ m1_subset_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( v1_xboole_0(X2)
| m1_subset_1(esk5_3(X3,X2,X1),X2)
| ~ m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r2_hidden(X3,a_2_0_relset_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
=> m1_subset_1(a_2_0_relset_2(X1,X2),k1_zfmisc_1(k1_zfmisc_1(X1))) ) ),
inference(assume_negation,[status(cth)],[t16_relset_2]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ r1_tarski(X4,X5)
| ~ r2_hidden(X6,X4)
| r2_hidden(X6,X5) )
& ( r2_hidden(esk3_2(X4,X5),X4)
| r1_tarski(X4,X5) )
& ( ~ r2_hidden(esk3_2(X4,X5),X5)
| r1_tarski(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_18,plain,
( m1_subset_1(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
~ v1_xboole_0(k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( r1_tarski(X1,X2)
| v1_xboole_0(X3)
| ~ r2_hidden(esk5_3(X1,X3,X4),X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X3,X4))
| ~ m1_subset_1(X4,k1_zfmisc_1(X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_21,plain,
( r2_hidden(esk5_3(X1,X2,X3),X2)
| v1_xboole_0(X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(pm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_22,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))
& ~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_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_23,plain,
( r1_tarski(X1,X2)
| ~ r2_hidden(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( r2_hidden(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(X1,X2) ),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_14,c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
( r1_tarski(X1,X2)
| v1_xboole_0(X2)
| ~ r2_hidden(X1,a_2_0_relset_2(X2,X3))
| ~ m1_subset_1(X3,k1_zfmisc_1(X2)) ),
inference(pm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( r1_tarski(X1,X2)
| r2_hidden(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
~ m1_subset_1(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( r1_tarski(X1,k1_zfmisc_1(X2))
| ~ r1_tarski(esk3_2(X1,k1_zfmisc_1(X2)),X2) ),
inference(pm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( r1_tarski(esk3_2(a_2_0_relset_2(X1,X2),X3),X1)
| r1_tarski(a_2_0_relset_2(X1,X2),X3)
| v1_xboole_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(pm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ r1_tarski(a_2_0_relset_2(esk1_0,esk2_0),k1_zfmisc_1(esk1_0)),
inference(pm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_31,plain,
( r1_tarski(a_2_0_relset_2(X1,X2),k1_zfmisc_1(X1))
| v1_xboole_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1)) ),
inference(pm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU422+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n020.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 : Mon Jun 20 02:00:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.41 eprover: CPU time limit exceeded, terminating
% 0.33/23.41 eprover: CPU time limit exceeded, terminating
% 0.33/23.43 eprover: CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.42 eprover: CPU time limit exceeded, terminating
% 0.45/46.43 eprover: CPU time limit exceeded, terminating
% 0.45/46.45 eprover: CPU time limit exceeded, terminating
% 0.55/69.44 eprover: CPU time limit exceeded, terminating
% 0.55/69.44 eprover: CPU time limit exceeded, terminating
% 0.55/69.46 eprover: CPU time limit exceeded, terminating
% 0.55/69.47 eprover: CPU time limit exceeded, terminating
% 0.66/92.45 eprover: CPU time limit exceeded, terminating
% 0.66/92.47 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.66/92.47
% 0.66/92.48 eprover: CPU time limit exceeded, terminating
% 0.70/98.87 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.70/98.87
% 0.70/98.87 # Failure: Resource limit exceeded (time)
% 0.70/98.87 # OLD status Res
% 0.70/98.87 # Preprocessing time : 0.016 s
% 0.70/98.87 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.70/98.87
% 0.70/98.87 # Failure: Resource limit exceeded (time)
% 0.70/98.87 # OLD status Res
% 0.70/98.87 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.70/98.87 # Preprocessing time : 0.008 s
% 0.70/98.87 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 0.70/98.87
% 0.70/98.87 # Failure: Resource limit exceeded (time)
% 0.70/98.87 # OLD status Res
% 0.70/98.87 # Preprocessing time : 0.016 s
% 0.70/98.87 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 0.70/98.87
% 0.70/98.87 # Failure: Resource limit exceeded (time)
% 0.70/98.87 # OLD status Res
% 0.70/98.87 # Preprocessing time : 0.008 s
% 0.70/98.87 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 0.70/98.87 # Preprocessing time : 0.009 s
% 0.70/98.87
% 0.70/98.87 # Proof found!
% 0.70/98.87 # SZS status Theorem
% 0.70/98.87 # SZS output start CNFRefutation
% See solution above
% 0.70/98.87 # Proof object total steps : 35
% 0.70/98.87 # Proof object clause steps : 20
% 0.70/98.87 # Proof object formula steps : 15
% 0.70/98.87 # Proof object conjectures : 8
% 0.70/98.87 # Proof object clause conjectures : 5
% 0.70/98.87 # Proof object formula conjectures : 3
% 0.70/98.87 # Proof object initial clauses used : 11
% 0.70/98.87 # Proof object initial formulas used : 7
% 0.70/98.87 # Proof object generating inferences : 9
% 0.70/98.87 # Proof object simplifying inferences : 4
% 0.70/98.87 # Training examples: 0 positive, 0 negative
% 0.70/98.87 # Parsed axioms : 30
% 0.70/98.87 # Removed by relevancy pruning/SinE : 0
% 0.70/98.87 # Initial clauses : 48
% 0.70/98.87 # Removed in clause preprocessing : 4
% 0.70/98.87 # Initial clauses in saturation : 44
% 0.70/98.87 # Processed clauses : 7940
% 0.70/98.87 # ...of these trivial : 8
% 0.70/98.87 # ...subsumed : 5210
% 0.70/98.87 # ...remaining for further processing : 2722
% 0.70/98.87 # Other redundant clauses eliminated : 16
% 0.70/98.87 # Clauses deleted for lack of memory : 188953
% 0.70/98.87 # Backward-subsumed : 261
% 0.70/98.87 # Backward-rewritten : 23
% 0.70/98.87 # Generated clauses : 298815
% 0.70/98.87 # ...of the previous two non-trivial : 295663
% 0.70/98.87 # Contextual simplify-reflections : 3397
% 0.70/98.87 # Paramodulations : 298481
% 0.70/98.87 # Factorizations : 192
% 0.70/98.87 # Equation resolutions : 94
% 0.70/98.87 # Current number of processed clauses : 2417
% 0.70/98.87 # Positive orientable unit clauses : 37
% 0.70/98.87 # Positive unorientable unit clauses: 0
% 0.70/98.87 # Negative unit clauses : 36
% 0.70/98.87 # Non-unit-clauses : 2344
% 0.70/98.87 # Current number of unprocessed clauses: 82120
% 0.70/98.87 # ...number of literals in the above : 463819
% 0.70/98.87 # Current number of archived formulas : 0
% 0.70/98.87 # Current number of archived clauses : 287
% 0.70/98.87 # Clause-clause subsumption calls (NU) : 1972033
% 0.70/98.87 # Rec. Clause-clause subsumption calls : 640233
% 0.70/98.87 # Non-unit clause-clause subsumptions : 8061
% 0.70/98.87 # Unit Clause-clause subsumption calls : 11447
% 0.70/98.87 # Rewrite failures with RHS unbound : 0
% 0.70/98.87 # BW rewrite match attempts : 57
% 0.70/98.87 # BW rewrite match successes : 14
% 0.70/98.87 # Condensation attempts : 0
% 0.70/98.87 # Condensation successes : 0
% 0.70/98.87 # Termbank termtop insertions : 9073633
% 0.70/98.87
% 0.70/98.87 # -------------------------------------------------
% 0.70/98.87 # User time : 5.423 s
% 0.70/98.87 # System time : 0.100 s
% 0.70/98.87 # Total time : 5.523 s
% 0.70/98.87 # Maximum resident set size: 134108 pages
% 0.70/115.47 eprover: CPU time limit exceeded, terminating
% 0.70/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.48 eprover: No such file or directory
% 0.70/115.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.48 eprover: No such file or directory
% 0.70/115.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.49 eprover: No such file or directory
% 0.70/115.49 eprover: CPU time limit exceeded, terminating
% 0.70/115.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.49 eprover: No such file or directory
% 0.70/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.50 eprover: No such file or directory
% 0.70/115.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.50 eprover: No such file or directory
% 0.70/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.51 eprover: No such file or directory
% 0.70/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.51 eprover: No such file or directory
% 0.70/115.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.51 eprover: No such file or directory
% 0.70/115.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.52 eprover: No such file or directory
% 0.70/115.52 eprover: CPU time limit exceeded, terminating
% 0.70/115.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.52 eprover: No such file or directory
% 0.70/115.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.53 eprover: No such file or directory
% 0.70/115.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.53 eprover: No such file or directory
% 0.70/115.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.53 eprover: No such file or directory
% 0.70/115.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.54 eprover: No such file or directory
% 0.70/115.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.70/115.54 eprover: No such file or directory
% 0.70/115.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.54 eprover: No such file or directory
% 0.70/115.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.55 eprover: No such file or directory
% 0.70/115.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.56 eprover: No such file or directory
% 0.70/115.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.56 eprover: No such file or directory
% 0.70/115.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.70/115.57 eprover: No such file or directory
%------------------------------------------------------------------------------