TSTP Solution File: SET097+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET097+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 00:49:07 EDT 2022
% Result : Theorem 1.04s 108.22s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 14 unt; 0 def)
% Number of atoms : 148 ( 35 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 154 ( 59 ~; 65 |; 23 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 18 sgn 49 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(complement,axiom,
! [X1,X5] :
( member(X5,complement(X1))
<=> ( member(X5,universal_class)
& ~ member(X5,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',complement) ).
fof(number_of_elements_in_class,conjecture,
! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] : member(X7,intersection(complement(singleton(X4)),X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',number_of_elements_in_class) ).
fof(unordered_pair_defn,axiom,
! [X3,X1,X2] :
( member(X3,unordered_pair(X1,X2))
<=> ( member(X3,universal_class)
& ( X3 = X1
| X3 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',unordered_pair_defn) ).
fof(singleton_set_defn,axiom,
! [X1] : singleton(X1) = unordered_pair(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',singleton_set_defn) ).
fof(intersection,axiom,
! [X1,X2,X5] :
( member(X5,intersection(X1,X2))
<=> ( member(X5,X1)
& member(X5,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',intersection) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(regularity,axiom,
! [X1] :
( X1 != null_class
=> ? [X3] :
( member(X3,universal_class)
& member(X3,X1)
& disjoint(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',regularity) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subclass(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk1_2(X4,X5),X4)
| subclass(X4,X5) )
& ( ~ member(esk1_2(X4,X5),X5)
| subclass(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)],[subclass_defn])])])])])])]) ).
fof(c_0_10,plain,
! [X2] : subclass(X2,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subclass(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X6,X7,X6,X7] :
( ( member(X7,universal_class)
| ~ member(X7,complement(X6)) )
& ( ~ member(X7,X6)
| ~ member(X7,complement(X6)) )
& ( ~ member(X7,universal_class)
| member(X7,X6)
| member(X7,complement(X6)) ) ),
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)],[complement])])])])])]) ).
cnf(c_0_14,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(pm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( subclass(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( X1 = null_class
| ? [X2] : singleton(X2) = X1
| ? [X4] :
( member(X4,X1)
& ? [X7] : member(X7,intersection(complement(singleton(X4)),X1)) ) ),
inference(assume_negation,[status(cth)],[number_of_elements_in_class]) ).
cnf(c_0_17,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( member(esk1_2(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(pm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,universal_class)
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 = X5
| X4 = X6
| ~ member(X4,unordered_pair(X5,X6)) )
& ( X4 != X5
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) )
& ( X4 != X6
| ~ member(X4,universal_class)
| member(X4,unordered_pair(X5,X6)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair_defn])])])])]) ).
fof(c_0_22,negated_conjecture,
! [X9,X10,X11] :
( esk8_0 != null_class
& singleton(X9) != esk8_0
& ( ~ member(X10,esk8_0)
| ~ member(X11,intersection(complement(singleton(X10)),esk8_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_16])])])])])]) ).
fof(c_0_23,plain,
! [X2] : singleton(X2) = unordered_pair(X2,X2),
inference(variable_rename,[status(thm)],[singleton_set_defn]) ).
cnf(c_0_24,plain,
( member(esk1_2(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_25,plain,
( subclass(complement(X1),X2)
| ~ member(esk1_2(complement(X1),X2),X1) ),
inference(pm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_26,plain,
( X1 = X3
| X1 = X2
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X1,intersection(complement(singleton(X2)),esk8_0))
| ~ member(X2,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_29,plain,
! [X6,X7,X8,X6,X7,X8] :
( ( member(X8,X6)
| ~ member(X8,intersection(X6,X7)) )
& ( member(X8,X7)
| ~ member(X8,intersection(X6,X7)) )
& ( ~ member(X8,X6)
| ~ member(X8,X7)
| member(X8,intersection(X6,X7)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])])]) ).
fof(c_0_30,plain,
! [X3,X4,X3,X4] :
( ( subclass(X3,X4)
| X3 != X4 )
& ( subclass(X4,X3)
| X3 != X4 )
& ( ~ subclass(X3,X4)
| ~ subclass(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])])])]) ).
cnf(c_0_31,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(esk1_2(X1,complement(complement(X2))),X2) ),
inference(pm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_32,plain,
( member(esk1_2(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(pm,[status(thm)],[c_0_25,c_0_18]),c_0_19]) ).
cnf(c_0_33,plain,
( esk1_2(unordered_pair(X1,X2),X3) = X2
| esk1_2(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3) ),
inference(pm,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X2,esk8_0)
| ~ member(X1,intersection(complement(unordered_pair(X2,X2)),esk8_0)) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ subclass(X2,X1)
| ~ subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
subclass(X1,complement(complement(X1))),
inference(pm,[status(thm)],[c_0_31,c_0_15]) ).
cnf(c_0_38,plain,
subclass(complement(complement(X1)),X1),
inference(pm,[status(thm)],[c_0_17,c_0_32]) ).
cnf(c_0_39,plain,
( esk1_2(unordered_pair(X1,X1),X2) = X1
| subclass(unordered_pair(X1,X1),X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_33])]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(X1,complement(unordered_pair(X2,X2)))
| ~ member(X2,esk8_0)
| ~ member(X1,esk8_0) ),
inference(pm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_42,plain,
( subclass(unordered_pair(X1,X1),X2)
| ~ member(X1,X2) ),
inference(pm,[status(thm)],[c_0_17,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( subclass(X1,unordered_pair(X2,X2))
| ~ member(esk1_2(X1,unordered_pair(X2,X2)),esk8_0)
| ~ member(X2,esk8_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_40,c_0_24]),c_0_41]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
singleton(X1) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_45,plain,
( X1 = unordered_pair(X2,X2)
| ~ member(X2,X1)
| ~ subclass(X1,unordered_pair(X2,X2)) ),
inference(pm,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( subclass(esk8_0,unordered_pair(X1,X1))
| ~ member(X1,esk8_0) ),
inference(pm,[status(thm)],[c_0_43,c_0_15]) ).
cnf(c_0_47,negated_conjecture,
unordered_pair(X1,X1) != esk8_0,
inference(rw,[status(thm)],[c_0_44,c_0_28]) ).
fof(c_0_48,plain,
! [X4] :
( ( member(esk6_1(X4),universal_class)
| X4 = null_class )
& ( member(esk6_1(X4),X4)
| X4 = null_class )
& ( disjoint(esk6_1(X4),X4)
| X4 = null_class ) ),
inference(distribute,[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)],[regularity])])])])])]) ).
cnf(c_0_49,negated_conjecture,
~ member(X1,esk8_0),
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
( X1 = null_class
| member(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_51,negated_conjecture,
esk8_0 != null_class,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(pm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET097+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n027.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 Jul 10 20:43:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.40/23.41 eprover: CPU time limit exceeded, terminating
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.42 eprover: CPU time limit exceeded, terminating
% 0.40/23.47 eprover: CPU time limit exceeded, terminating
% 0.59/46.42 eprover: CPU time limit exceeded, terminating
% 0.59/46.43 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 0.59/46.43
% 0.59/46.51 eprover: CPU time limit exceeded, terminating
% 0.76/69.44 eprover: CPU time limit exceeded, terminating
% 0.76/69.45 eprover: CPU time limit exceeded, terminating
% 0.76/69.45 eprover: CPU time limit exceeded, terminating
% 0.76/69.58 eprover: CPU time limit exceeded, terminating
% 0.94/92.45 eprover: CPU time limit exceeded, terminating
% 0.94/92.47 eprover: CPU time limit exceeded, terminating
% 0.94/92.47 eprover: CPU time limit exceeded, terminating
% 0.94/92.59 eprover: CPU time limit exceeded, terminating
% 1.04/108.22 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.04/108.22
% 1.04/108.22 # Failure: Resource limit exceeded (time)
% 1.04/108.22 # OLD status Res
% 1.04/108.22 # Preprocessing time : 0.020 s
% 1.04/108.22 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.04/108.22
% 1.04/108.22 # Failure: Resource limit exceeded (time)
% 1.04/108.22 # OLD status Res
% 1.04/108.22 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.04/108.22 # Preprocessing time : 0.011 s
% 1.04/108.22 # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.04/108.22
% 1.04/108.22 # Failure: Resource limit exceeded (time)
% 1.04/108.22 # OLD status Res
% 1.04/108.22 # Preprocessing time : 0.022 s
% 1.04/108.22 # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.04/108.22
% 1.04/108.22 # Failure: Resource limit exceeded (time)
% 1.04/108.22 # OLD status Res
% 1.04/108.22 # Preprocessing time : 0.013 s
% 1.04/108.22 # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.04/108.22 # Preprocessing time : 0.020 s
% 1.04/108.22
% 1.04/108.22 # Proof found!
% 1.04/108.22 # SZS status Theorem
% 1.04/108.22 # SZS output start CNFRefutation
% See solution above
% 1.04/108.22 # Proof object total steps : 53
% 1.04/108.22 # Proof object clause steps : 34
% 1.04/108.22 # Proof object formula steps : 19
% 1.04/108.22 # Proof object conjectures : 13
% 1.04/108.22 # Proof object clause conjectures : 10
% 1.04/108.22 # Proof object formula conjectures : 3
% 1.04/108.22 # Proof object initial clauses used : 14
% 1.04/108.22 # Proof object initial formulas used : 9
% 1.04/108.22 # Proof object generating inferences : 18
% 1.04/108.22 # Proof object simplifying inferences : 11
% 1.04/108.22 # Training examples: 0 positive, 0 negative
% 1.04/108.22 # Parsed axioms : 44
% 1.04/108.22 # Removed by relevancy pruning/SinE : 0
% 1.04/108.22 # Initial clauses : 92
% 1.04/108.22 # Removed in clause preprocessing : 8
% 1.04/108.22 # Initial clauses in saturation : 84
% 1.04/108.22 # Processed clauses : 10722
% 1.04/108.22 # ...of these trivial : 68
% 1.04/108.22 # ...subsumed : 6998
% 1.04/108.22 # ...remaining for further processing : 3656
% 1.04/108.22 # Other redundant clauses eliminated : 131
% 1.04/108.22 # Clauses deleted for lack of memory : 627187
% 1.04/108.22 # Backward-subsumed : 104
% 1.04/108.22 # Backward-rewritten : 219
% 1.04/108.22 # Generated clauses : 994560
% 1.04/108.22 # ...of the previous two non-trivial : 806761
% 1.04/108.22 # Contextual simplify-reflections : 2121
% 1.04/108.22 # Paramodulations : 993966
% 1.04/108.22 # Factorizations : 443
% 1.04/108.22 # Equation resolutions : 142
% 1.04/108.22 # Current number of processed clauses : 3325
% 1.04/108.22 # Positive orientable unit clauses : 159
% 1.04/108.22 # Positive unorientable unit clauses: 1
% 1.04/108.22 # Negative unit clauses : 11
% 1.04/108.22 # Non-unit-clauses : 3154
% 1.04/108.22 # Current number of unprocessed clauses: 130224
% 1.04/108.22 # ...number of literals in the above : 541202
% 1.04/108.22 # Current number of archived formulas : 0
% 1.04/108.22 # Current number of archived clauses : 331
% 1.04/108.22 # Clause-clause subsumption calls (NU) : 1643648
% 1.04/108.22 # Rec. Clause-clause subsumption calls : 697368
% 1.04/108.22 # Non-unit clause-clause subsumptions : 7295
% 1.04/108.22 # Unit Clause-clause subsumption calls : 38481
% 1.04/108.22 # Rewrite failures with RHS unbound : 0
% 1.04/108.22 # BW rewrite match attempts : 1887
% 1.04/108.22 # BW rewrite match successes : 993
% 1.04/108.22 # Condensation attempts : 0
% 1.04/108.22 # Condensation successes : 0
% 1.04/108.22 # Termbank termtop insertions : 31419444
% 1.04/108.22
% 1.04/108.22 # -------------------------------------------------
% 1.04/108.22 # User time : 15.209 s
% 1.04/108.22 # System time : 0.140 s
% 1.04/108.22 # Total time : 15.349 s
% 1.04/108.22 # Maximum resident set size: 148296 pages
% 1.10/115.47 eprover: CPU time limit exceeded, terminating
% 1.10/115.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.49 eprover: No such file or directory
% 1.10/115.49 eprover: CPU time limit exceeded, terminating
% 1.10/115.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.49 eprover: No such file or directory
% 1.10/115.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.50 eprover: No such file or directory
% 1.10/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.51 eprover: No such file or directory
% 1.10/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.51 eprover: No such file or directory
% 1.10/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.51 eprover: No such file or directory
% 1.10/115.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.51 eprover: No such file or directory
% 1.10/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.52 eprover: No such file or directory
% 1.10/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.52 eprover: No such file or directory
% 1.10/115.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.10/115.52 eprover: No such file or directory
% 1.10/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.53 eprover: No such file or directory
% 1.10/115.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.53 eprover: No such file or directory
% 1.10/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.54 eprover: No such file or directory
% 1.10/115.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.10/115.54 eprover: No such file or directory
%------------------------------------------------------------------------------