TSTP Solution File: SEU170+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU170+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:17:26 EDT 2022
% Result : Theorem 0.25s 1.42s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of formulae : 63 ( 22 unt; 0 def)
% Number of atoms : 146 ( 33 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 134 ( 51 ~; 52 |; 12 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 11 sgn 71 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t43_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t43_subset_1) ).
fof(t63_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& disjoint(X2,X3) )
=> disjoint(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t63_xboole_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_r1_xboole_0) ).
fof(t83_xboole_1,lemma,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t83_xboole_1) ).
fof(t40_xboole_1,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t40_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(t39_xboole_1,lemma,
! [X1,X2] : set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_xboole_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_subset_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_subset_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_subset_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_zfmisc_1) ).
fof(t33_xboole_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_difference(X1,X3),set_difference(X2,X3)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_xboole_1) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( element(X3,powerset(X1))
=> ( disjoint(X2,X3)
<=> subset(X2,subset_complement(X1,X3)) ) ) ),
inference(assume_negation,[status(cth)],[t43_subset_1]) ).
fof(c_0_15,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ disjoint(X5,X6)
| disjoint(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t63_xboole_1])]) ).
fof(c_0_16,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& element(esk3_0,powerset(esk1_0))
& ( ~ disjoint(esk2_0,esk3_0)
| ~ subset(esk2_0,subset_complement(esk1_0,esk3_0)) )
& ( disjoint(esk2_0,esk3_0)
| subset(esk2_0,subset_complement(esk1_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)],[c_0_14])])])])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_18,lemma,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_difference(X3,X4) = X3 )
& ( set_difference(X3,X4) != X3
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])])]) ).
fof(c_0_19,lemma,
! [X3,X4] : set_difference(set_union2(X3,X4),X4) = set_difference(X3,X4),
inference(variable_rename,[status(thm)],[t40_xboole_1]) ).
fof(c_0_20,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_21,lemma,
( disjoint(X1,X2)
| ~ disjoint(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( subset(esk2_0,subset_complement(esk1_0,esk3_0))
| disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,lemma,
( disjoint(X1,X2)
| set_difference(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,lemma,
! [X3,X4] : set_union2(X3,set_difference(X4,X3)) = set_union2(X3,X4),
inference(variable_rename,[status(thm)],[t39_xboole_1]) ).
cnf(c_0_28,negated_conjecture,
( disjoint(esk2_0,esk3_0)
| disjoint(esk2_0,X1)
| ~ disjoint(subset_complement(esk1_0,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,lemma,
( disjoint(X1,X2)
| set_difference(X2,X1) != X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,lemma,
set_difference(set_union2(X1,X2),X1) = set_difference(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,lemma,
set_union2(X1,set_difference(X2,X1)) = set_union2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,X4) = set_difference(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| subset_complement(X3,subset_complement(X3,X4)) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])]) ).
fof(c_0_34,plain,
! [X3,X4] :
( ~ element(X4,powerset(X3))
| element(subset_complement(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])]) ).
cnf(c_0_35,lemma,
( disjoint(esk2_0,esk3_0)
| disjoint(esk2_0,X1)
| set_difference(X1,subset_complement(esk1_0,esk3_0)) != X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,lemma,
set_difference(set_difference(X1,X2),X2) = set_difference(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
cnf(c_0_37,plain,
( subset_complement(X1,X2) = set_difference(X1,X2)
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( subset_complement(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,plain,
( element(subset_complement(X1,X2),powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X3,X4,X4,X3,X4,X4] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X4,X3)
| element(X4,X3)
| empty(X3) )
& ( ~ element(X4,X3)
| empty(X4)
| ~ empty(X3) )
& ( ~ empty(X4)
| element(X4,X3)
| ~ empty(X3) ) ),
inference(distribute,[status(thm)],[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)],[d2_subset_1])])])])])]) ).
fof(c_0_41,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_subset_1])]) ).
cnf(c_0_42,lemma,
( disjoint(esk2_0,set_difference(X1,subset_complement(esk1_0,esk3_0)))
| disjoint(esk2_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( set_difference(X1,subset_complement(X1,X2)) = X2
| ~ element(X2,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,negated_conjecture,
element(esk3_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_45,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X6,X4)
| in(X6,X5)
| X5 != powerset(X4) )
& ( ~ in(esk10_2(X4,X5),X5)
| ~ subset(esk10_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk10_2(X4,X5),X5)
| subset(esk10_2(X4,X5),X4)
| X5 = powerset(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_zfmisc_1])])])])])])]) ).
cnf(c_0_46,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_48,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( ~ subset(esk2_0,subset_complement(esk1_0,esk3_0))
| ~ disjoint(esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_50,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_difference(X4,X6),set_difference(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_xboole_1])])])]) ).
cnf(c_0_51,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_52,lemma,
disjoint(esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_53,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_54,negated_conjecture,
in(esk2_0,powerset(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_55,negated_conjecture,
( ~ disjoint(esk2_0,esk3_0)
| ~ subset(esk2_0,set_difference(esk1_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_37]),c_0_44])]) ).
cnf(c_0_56,lemma,
( subset(set_difference(X1,X2),set_difference(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,lemma,
set_difference(esk2_0,esk3_0) = esk2_0,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
( subset(esk2_0,X1)
| powerset(esk1_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_59,negated_conjecture,
~ subset(esk2_0,set_difference(esk1_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52])]) ).
cnf(c_0_60,lemma,
( subset(esk2_0,set_difference(X1,esk3_0))
| ~ subset(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
subset(esk2_0,esk1_0),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU170+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 : Sat Jun 18 21:18:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.25/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.42 # Preprocessing time : 0.022 s
% 0.25/1.42
% 0.25/1.42 # Proof found!
% 0.25/1.42 # SZS status Theorem
% 0.25/1.42 # SZS output start CNFRefutation
% See solution above
% 0.25/1.42 # Proof object total steps : 63
% 0.25/1.42 # Proof object clause steps : 34
% 0.25/1.42 # Proof object formula steps : 29
% 0.25/1.42 # Proof object conjectures : 14
% 0.25/1.42 # Proof object clause conjectures : 11
% 0.25/1.42 # Proof object formula conjectures : 3
% 0.25/1.42 # Proof object initial clauses used : 18
% 0.25/1.42 # Proof object initial formulas used : 14
% 0.25/1.42 # Proof object generating inferences : 15
% 0.25/1.42 # Proof object simplifying inferences : 11
% 0.25/1.42 # Training examples: 0 positive, 0 negative
% 0.25/1.42 # Parsed axioms : 110
% 0.25/1.42 # Removed by relevancy pruning/SinE : 36
% 0.25/1.42 # Initial clauses : 123
% 0.25/1.42 # Removed in clause preprocessing : 1
% 0.25/1.42 # Initial clauses in saturation : 122
% 0.25/1.42 # Processed clauses : 5373
% 0.25/1.42 # ...of these trivial : 288
% 0.25/1.42 # ...subsumed : 3647
% 0.25/1.42 # ...remaining for further processing : 1438
% 0.25/1.42 # Other redundant clauses eliminated : 257
% 0.25/1.42 # Clauses deleted for lack of memory : 0
% 0.25/1.42 # Backward-subsumed : 127
% 0.25/1.42 # Backward-rewritten : 152
% 0.25/1.42 # Generated clauses : 36174
% 0.25/1.42 # ...of the previous two non-trivial : 28288
% 0.25/1.42 # Contextual simplify-reflections : 696
% 0.25/1.42 # Paramodulations : 35776
% 0.25/1.42 # Factorizations : 68
% 0.25/1.42 # Equation resolutions : 330
% 0.25/1.42 # Current number of processed clauses : 1156
% 0.25/1.42 # Positive orientable unit clauses : 192
% 0.25/1.42 # Positive unorientable unit clauses: 2
% 0.25/1.42 # Negative unit clauses : 106
% 0.25/1.42 # Non-unit-clauses : 856
% 0.25/1.42 # Current number of unprocessed clauses: 19224
% 0.25/1.42 # ...number of literals in the above : 58994
% 0.25/1.42 # Current number of archived formulas : 0
% 0.25/1.42 # Current number of archived clauses : 280
% 0.25/1.42 # Clause-clause subsumption calls (NU) : 196376
% 0.25/1.42 # Rec. Clause-clause subsumption calls : 159733
% 0.25/1.42 # Non-unit clause-clause subsumptions : 2345
% 0.25/1.42 # Unit Clause-clause subsumption calls : 19353
% 0.25/1.42 # Rewrite failures with RHS unbound : 0
% 0.25/1.42 # BW rewrite match attempts : 163
% 0.25/1.42 # BW rewrite match successes : 43
% 0.25/1.42 # Condensation attempts : 0
% 0.25/1.42 # Condensation successes : 0
% 0.25/1.42 # Termbank termtop insertions : 385402
% 0.25/1.42
% 0.25/1.42 # -------------------------------------------------
% 0.25/1.42 # User time : 0.550 s
% 0.25/1.42 # System time : 0.021 s
% 0.25/1.42 # Total time : 0.571 s
% 0.25/1.42 # Maximum resident set size: 21748 pages
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------