TSTP Solution File: SEU236+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU236+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:10 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 12 unt; 0 def)
% Number of atoms : 168 ( 18 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 187 ( 74 ~; 75 |; 21 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 79 ( 6 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t33_ordinal1) ).
fof(d1_ordinal1,axiom,
! [X1] : succ(X1) = set_union2(X1,singleton(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d1_ordinal1) ).
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',redefinition_r1_ordinal1) ).
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',d3_tarski) ).
fof(t10_ordinal1,axiom,
! [X1] : in(X1,succ(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t10_ordinal1) ).
fof(t8_xboole_1,axiom,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t8_xboole_1) ).
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',fc3_ordinal1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d1_tarski) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d2_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',cc1_ordinal1) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ( in(X1,X2)
<=> ordinal_subset(succ(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t33_ordinal1]) ).
fof(c_0_11,negated_conjecture,
( ordinal(esk18_0)
& ordinal(esk19_0)
& ( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(succ(esk18_0),esk19_0) )
& ( in(esk18_0,esk19_0)
| ordinal_subset(succ(esk18_0),esk19_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)],[c_0_10])])])])]) ).
fof(c_0_12,plain,
! [X2] : succ(X2) = set_union2(X2,singleton(X2)),
inference(variable_rename,[status(thm)],[d1_ordinal1]) ).
fof(c_0_13,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_14,negated_conjecture,
( ordinal_subset(succ(esk18_0),esk19_0)
| in(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
succ(X1) = set_union2(X1,singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ ordinal_subset(succ(esk18_0),esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk3_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_18,plain,
( subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ ordinal_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( in(esk18_0,esk19_0)
| ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
ordinal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_21,plain,
! [X2] : in(X2,succ(X2)),
inference(variable_rename,[status(thm)],[t10_ordinal1]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(esk18_0,esk19_0)
| ~ ordinal_subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0) ),
inference(rw,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_23,plain,
( ordinal_subset(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
fof(c_0_25,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_26,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| in(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_28,plain,
in(X1,succ(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk1_2(X4,X5),X5)
| esk1_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
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_tarski])])])])])])]) ).
cnf(c_0_30,negated_conjecture,
( ~ subset(set_union2(esk18_0,singleton(esk18_0)),esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ in(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20])]) ).
cnf(c_0_31,plain,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ordinal(succ(X1))
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( in(esk18_0,esk19_0)
| in(X1,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ in(X1,set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
in(X1,set_union2(X1,singleton(X1))),
inference(rw,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_35,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,negated_conjecture,
( ~ subset(singleton(esk18_0),esk19_0)
| ~ subset(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0)))
| ~ in(esk18_0,esk19_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ordinal(set_union2(X1,singleton(X1)))
| ~ ordinal(X1) ),
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_39,negated_conjecture,
ordinal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_40,negated_conjecture,
( in(esk18_0,esk19_0)
| ~ ordinal(set_union2(esk18_0,singleton(esk18_0))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_41,plain,
( X1 = esk3_2(X2,X3)
| subset(X2,X3)
| X2 != singleton(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ~ subset(singleton(esk18_0),esk19_0)
| ~ subset(esk18_0,esk19_0)
| ~ in(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_43,negated_conjecture,
in(esk18_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_38]),c_0_39])]) ).
cnf(c_0_44,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_45,plain,
( esk3_2(singleton(X1),X2) = X1
| subset(singleton(X1),X2) ),
inference(er,[status(thm)],[c_0_41]) ).
fof(c_0_46,plain,
! [X3,X4,X3] :
( ( ~ epsilon_transitive(X3)
| ~ in(X4,X3)
| subset(X4,X3) )
& ( in(esk2_1(X3),X3)
| epsilon_transitive(X3) )
& ( ~ subset(esk2_1(X3),X3)
| epsilon_transitive(X3) ) ),
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)],[d2_ordinal1])])])])])])]) ).
fof(c_0_47,plain,
! [X2] :
( ( epsilon_transitive(X2)
| ~ ordinal(X2) )
& ( epsilon_connected(X2)
| ~ ordinal(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_48,negated_conjecture,
( ~ subset(singleton(esk18_0),esk19_0)
| ~ subset(esk18_0,esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]) ).
cnf(c_0_49,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ in(X1,X2)
| ~ epsilon_transitive(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_51,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
~ subset(esk18_0,esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_43])]) ).
cnf(c_0_53,plain,
( subset(X1,X2)
| ~ ordinal(X2)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_20]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU236+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n012.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 : Sun Jun 19 10:37:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.018 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 55
% 0.24/1.42 # Proof object clause steps : 34
% 0.24/1.42 # Proof object formula steps : 21
% 0.24/1.42 # Proof object conjectures : 19
% 0.24/1.42 # Proof object clause conjectures : 16
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 16
% 0.24/1.42 # Proof object initial formulas used : 10
% 0.24/1.42 # Proof object generating inferences : 13
% 0.24/1.42 # Proof object simplifying inferences : 19
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 52
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 105
% 0.24/1.42 # Removed in clause preprocessing : 3
% 0.24/1.42 # Initial clauses in saturation : 102
% 0.24/1.42 # Processed clauses : 854
% 0.24/1.42 # ...of these trivial : 10
% 0.24/1.42 # ...subsumed : 356
% 0.24/1.42 # ...remaining for further processing : 488
% 0.24/1.42 # Other redundant clauses eliminated : 1
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 22
% 0.24/1.42 # Backward-rewritten : 45
% 0.24/1.42 # Generated clauses : 1676
% 0.24/1.42 # ...of the previous two non-trivial : 1551
% 0.24/1.42 # Contextual simplify-reflections : 181
% 0.24/1.42 # Paramodulations : 1655
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 10
% 0.24/1.42 # Current number of processed clauses : 409
% 0.24/1.42 # Positive orientable unit clauses : 56
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 27
% 0.24/1.42 # Non-unit-clauses : 325
% 0.24/1.42 # Current number of unprocessed clauses: 670
% 0.24/1.42 # ...number of literals in the above : 2722
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 79
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 29583
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 24050
% 0.24/1.42 # Non-unit clause-clause subsumptions : 386
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1738
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 32
% 0.24/1.43 # BW rewrite match successes : 28
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 23693
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.082 s
% 0.24/1.43 # System time : 0.003 s
% 0.24/1.43 # Total time : 0.085 s
% 0.24/1.43 # Maximum resident set size: 4612 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------