TSTP Solution File: SET630+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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:52:42 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 18 unt; 0 def)
% Number of atoms : 45 ( 6 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 32 ( 14 ~; 13 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 5 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_intersection_and_symmetric_difference_disjoint,conjecture,
! [X1,X2] : disjoint(intersection(X1,X2),symmetric_difference(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',prove_intersection_and_symmetric_difference_disjoint) ).
fof(symmetric_difference_defn,axiom,
! [X1,X2] : symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',symmetric_difference_defn) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',disjoint_defn) ).
fof(intersect_with_union,axiom,
! [X1,X2,X3] :
( intersect(X1,union(X2,X3))
<=> ( intersect(X1,X2)
| intersect(X1,X3) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',intersect_with_union) ).
fof(intersection_and_union_disjoint,axiom,
! [X1,X2] : disjoint(intersection(X1,X2),difference(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',intersection_and_union_disjoint) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',commutativity_of_intersection) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] : disjoint(intersection(X1,X2),symmetric_difference(X1,X2)),
inference(assume_negation,[status(cth)],[prove_intersection_and_symmetric_difference_disjoint]) ).
fof(c_0_7,negated_conjecture,
~ disjoint(intersection(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X3,X4] : symmetric_difference(X3,X4) = union(difference(X3,X4),difference(X4,X3)),
inference(variable_rename,[status(thm)],[symmetric_difference_defn]) ).
cnf(c_0_9,negated_conjecture,
~ disjoint(intersection(esk3_0,esk4_0),symmetric_difference(esk3_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
symmetric_difference(X1,X2) = union(difference(X1,X2),difference(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| ~ intersect(X3,X4) )
& ( intersect(X3,X4)
| disjoint(X3,X4) ) ),
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)],[disjoint_defn])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ intersect(X4,union(X5,X6))
| intersect(X4,X5)
| intersect(X4,X6) )
& ( ~ intersect(X4,X5)
| intersect(X4,union(X5,X6)) )
& ( ~ intersect(X4,X6)
| intersect(X4,union(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)],[intersect_with_union])])])])]) ).
cnf(c_0_13,negated_conjecture,
~ disjoint(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( disjoint(X1,X2)
| intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( intersect(X1,X2)
| intersect(X1,X3)
| ~ intersect(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
intersect(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] : disjoint(intersection(X3,X4),difference(X3,X4)),
inference(variable_rename,[status(thm)],[intersection_and_union_disjoint]) ).
fof(c_0_18,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_19,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
( intersect(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))
| intersect(intersection(esk3_0,esk4_0),difference(esk4_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
disjoint(intersection(X1,X2),difference(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( intersect(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0))
| ~ disjoint(intersection(esk3_0,esk4_0),difference(esk4_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
disjoint(intersection(X1,X2),difference(X2,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
intersect(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 19:15:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.43 # Preprocessing time : 0.013 s
% 0.24/1.43
% 0.24/1.43 # Failure: Out of unprocessed clauses!
% 0.24/1.43 # OLD status GaveUp
% 0.24/1.43 # Parsed axioms : 12
% 0.24/1.43 # Removed by relevancy pruning/SinE : 7
% 0.24/1.43 # Initial clauses : 6
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 6
% 0.24/1.43 # Processed clauses : 8
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 8
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 4
% 0.24/1.43 # ...of the previous two non-trivial : 2
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 4
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 8
% 0.24/1.43 # Positive orientable unit clauses : 2
% 0.24/1.43 # Positive unorientable unit clauses: 2
% 0.24/1.43 # Negative unit clauses : 1
% 0.24/1.43 # Non-unit-clauses : 3
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 0
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 0
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 0
% 0.24/1.43 # BW rewrite match successes : 0
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 383
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.014 s
% 0.24/1.43 # System time : 0.000 s
% 0.24/1.43 # Total time : 0.014 s
% 0.24/1.43 # Maximum resident set size: 2776 pages
% 0.24/1.43 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.24/1.43 # Preprocessing time : 0.014 s
% 0.24/1.43
% 0.24/1.43 # Failure: Out of unprocessed clauses!
% 0.24/1.43 # OLD status GaveUp
% 0.24/1.43 # Parsed axioms : 12
% 0.24/1.43 # Removed by relevancy pruning/SinE : 8
% 0.24/1.43 # Initial clauses : 5
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 5
% 0.24/1.43 # Processed clauses : 5
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 5
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 1
% 0.24/1.43 # ...of the previous two non-trivial : 0
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 1
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 5
% 0.24/1.43 # Positive orientable unit clauses : 0
% 0.24/1.43 # Positive unorientable unit clauses: 2
% 0.24/1.43 # Negative unit clauses : 1
% 0.24/1.43 # Non-unit-clauses : 2
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 0
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 0
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 4
% 0.24/1.43 # BW rewrite match successes : 4
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 314
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.013 s
% 0.24/1.43 # System time : 0.001 s
% 0.24/1.43 # Total time : 0.014 s
% 0.24/1.43 # Maximum resident set size: 2780 pages
% 0.24/1.43 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.24/1.43 # Preprocessing time : 0.014 s
% 0.24/1.43
% 0.24/1.43 # Failure: Out of unprocessed clauses!
% 0.24/1.43 # OLD status GaveUp
% 0.24/1.43 # Parsed axioms : 12
% 0.24/1.43 # Removed by relevancy pruning/SinE : 7
% 0.24/1.43 # Initial clauses : 6
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 6
% 0.24/1.43 # Processed clauses : 8
% 0.24/1.43 # ...of these trivial : 0
% 0.24/1.43 # ...subsumed : 0
% 0.24/1.43 # ...remaining for further processing : 8
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 0
% 0.24/1.43 # Generated clauses : 4
% 0.24/1.43 # ...of the previous two non-trivial : 2
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 4
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 8
% 0.24/1.43 # Positive orientable unit clauses : 2
% 0.24/1.43 # Positive unorientable unit clauses: 2
% 0.24/1.43 # Negative unit clauses : 1
% 0.24/1.43 # Non-unit-clauses : 3
% 0.24/1.43 # Current number of unprocessed clauses: 0
% 0.24/1.43 # ...number of literals in the above : 0
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 0
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.24/1.43 # Non-unit clause-clause subsumptions : 0
% 0.24/1.43 # Unit Clause-clause subsumption calls : 0
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 4
% 0.24/1.43 # BW rewrite match successes : 4
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 364
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.012 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.014 s
% 0.24/1.43 # Maximum resident set size: 2776 pages
% 0.24/1.43 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.24/1.43 # Preprocessing time : 0.015 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 27
% 0.24/1.43 # Proof object clause steps : 14
% 0.24/1.43 # Proof object formula steps : 13
% 0.24/1.43 # Proof object conjectures : 10
% 0.24/1.43 # Proof object clause conjectures : 7
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 7
% 0.24/1.43 # Proof object initial formulas used : 6
% 0.24/1.43 # Proof object generating inferences : 5
% 0.24/1.43 # Proof object simplifying inferences : 5
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 12
% 0.24/1.43 # Removed by relevancy pruning/SinE : 0
% 0.24/1.43 # Initial clauses : 22
% 0.24/1.43 # Removed in clause preprocessing : 3
% 0.24/1.43 # Initial clauses in saturation : 19
% 0.24/1.43 # Processed clauses : 305
% 0.24/1.43 # ...of these trivial : 84
% 0.24/1.43 # ...subsumed : 116
% 0.24/1.43 # ...remaining for further processing : 105
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 4
% 0.24/1.43 # Generated clauses : 578
% 0.24/1.43 # ...of the previous two non-trivial : 455
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 576
% 0.24/1.43 # Factorizations : 2
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 101
% 0.24/1.43 # Positive orientable unit clauses : 51
% 0.24/1.43 # Positive unorientable unit clauses: 2
% 0.24/1.43 # Negative unit clauses : 34
% 0.24/1.43 # Non-unit-clauses : 14
% 0.24/1.43 # Current number of unprocessed clauses: 161
% 0.24/1.43 # ...number of literals in the above : 223
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 5
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 18
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 18
% 0.24/1.43 # Non-unit clause-clause subsumptions : 3
% 0.24/1.43 # Unit Clause-clause subsumption calls : 561
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 30
% 0.24/1.43 # BW rewrite match successes : 4
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 11385
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.023 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.025 s
% 0.24/1.43 # Maximum resident set size: 3312 pages
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------