TSTP Solution File: SET810+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET810+4 : TPTP v8.1.0. Released v3.2.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 00:54:30 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 221 ( 0 equ)
% Maximal formula atoms : 84 ( 6 avg)
% Number of connectives : 267 ( 82 ~; 119 |; 53 &)
% ( 5 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 87 ( 9 sgn 49 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(strict_order,axiom,
! [X6,X4] :
( strict_order(X6,X4)
<=> ( ! [X3,X5] :
( ( member(X3,X4)
& member(X5,X4) )
=> ~ ( apply(X6,X3,X5)
& apply(X6,X5,X3) ) )
& ! [X3,X5,X8] :
( ( member(X3,X4)
& member(X5,X4)
& member(X8,X4) )
=> ( ( apply(X6,X3,X5)
& apply(X6,X5,X8) )
=> apply(X6,X3,X8) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',strict_order) ).
fof(rel_member,axiom,
! [X3,X5] :
( apply(member_predicate,X3,X5)
<=> member(X3,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',rel_member) ).
fof(strict_well_order,axiom,
! [X6,X4] :
( strict_well_order(X6,X4)
<=> ( strict_order(X6,X4)
& ! [X1] :
( ( subset(X1,X4)
& ? [X3] : member(X3,X1) )
=> ? [X5] : least(X5,X6,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',strict_well_order) ).
fof(ordinal_number,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',ordinal_number) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(thV3,conjecture,
! [X1,X2] :
( ( member(X1,on)
& member(X2,on) )
=> ~ ( member(X1,X2)
& member(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thV3) ).
fof(c_0_6,plain,
! [X9,X10,X11,X12,X13,X14,X15,X9,X10] :
( ( ~ member(X11,X10)
| ~ member(X12,X10)
| ~ apply(X9,X11,X12)
| ~ apply(X9,X12,X11)
| ~ strict_order(X9,X10) )
& ( ~ member(X13,X10)
| ~ member(X14,X10)
| ~ member(X15,X10)
| ~ apply(X9,X13,X14)
| ~ apply(X9,X14,X15)
| apply(X9,X13,X15)
| ~ strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk12_2(X9,X10),X10)
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk13_2(X9,X10),X10)
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk11_2(X9,X10),esk12_2(X9,X10))
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk12_2(X9,X10),esk13_2(X9,X10))
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( ~ apply(X9,esk11_2(X9,X10),esk13_2(X9,X10))
| member(esk9_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk12_2(X9,X10),X10)
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk13_2(X9,X10),X10)
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk11_2(X9,X10),esk12_2(X9,X10))
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( apply(X9,esk12_2(X9,X10),esk13_2(X9,X10))
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( ~ apply(X9,esk11_2(X9,X10),esk13_2(X9,X10))
| member(esk10_2(X9,X10),X10)
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk12_2(X9,X10),X10)
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk13_2(X9,X10),X10)
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk11_2(X9,X10),esk12_2(X9,X10))
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk12_2(X9,X10),esk13_2(X9,X10))
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( ~ apply(X9,esk11_2(X9,X10),esk13_2(X9,X10))
| apply(X9,esk9_2(X9,X10),esk10_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk11_2(X9,X10),X10)
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk12_2(X9,X10),X10)
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) )
& ( member(esk13_2(X9,X10),X10)
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk11_2(X9,X10),esk12_2(X9,X10))
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) )
& ( apply(X9,esk12_2(X9,X10),esk13_2(X9,X10))
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) )
& ( ~ apply(X9,esk11_2(X9,X10),esk13_2(X9,X10))
| apply(X9,esk10_2(X9,X10),esk9_2(X9,X10))
| strict_order(X9,X10) ) ),
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)],[strict_order])])])])])])]) ).
fof(c_0_7,plain,
! [X6,X7,X6,X7] :
( ( ~ apply(member_predicate,X6,X7)
| member(X6,X7) )
& ( ~ member(X6,X7)
| apply(member_predicate,X6,X7) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_member])])])]) ).
cnf(c_0_8,plain,
( ~ strict_order(X1,X2)
| ~ apply(X1,X3,X4)
| ~ apply(X1,X4,X3)
| ~ member(X3,X2)
| ~ member(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X7,X8,X9,X10,X7,X8,X14] :
( ( strict_order(X7,X8)
| ~ strict_well_order(X7,X8) )
& ( ~ subset(X9,X8)
| ~ member(X10,X9)
| least(esk5_3(X7,X8,X9),X7,X9)
| ~ strict_well_order(X7,X8) )
& ( subset(esk6_2(X7,X8),X8)
| ~ strict_order(X7,X8)
| strict_well_order(X7,X8) )
& ( member(esk7_2(X7,X8),esk6_2(X7,X8))
| ~ strict_order(X7,X8)
| strict_well_order(X7,X8) )
& ( ~ least(X14,X7,esk6_2(X7,X8))
| ~ strict_order(X7,X8)
| strict_well_order(X7,X8) ) ),
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)],[strict_well_order])])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X4] :
( ( set(X4)
| ~ member(X4,on) )
& ( strict_well_order(member_predicate,X4)
| ~ member(X4,on) )
& ( ~ member(X5,X4)
| subset(X5,X4)
| ~ member(X4,on) )
& ( member(esk3_1(X4),X4)
| ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| member(X4,on) )
& ( ~ subset(esk3_1(X4),X4)
| ~ set(X4)
| ~ strict_well_order(member_predicate,X4)
| member(X4,on) ) ),
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)],[ordinal_number])])])])])])]) ).
fof(c_0_12,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk4_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)],[subset])])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( ( member(X1,on)
& member(X2,on) )
=> ~ ( member(X1,X2)
& member(X2,X1) ) ),
inference(assume_negation,[status(cth)],[thV3]) ).
cnf(c_0_14,plain,
( ~ apply(member_predicate,X1,X2)
| ~ strict_order(member_predicate,X3)
| ~ member(X2,X3)
| ~ member(X1,X3)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( strict_order(X1,X2)
| ~ strict_well_order(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( strict_well_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( subset(X2,X1)
| ~ member(X1,on)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_19,negated_conjecture,
( member(esk1_0,on)
& member(esk2_0,on)
& member(esk1_0,esk2_0)
& member(esk2_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
cnf(c_0_20,plain,
( ~ strict_order(member_predicate,X1)
| ~ member(X2,X1)
| ~ member(X3,X1)
| ~ member(X2,X3)
| ~ member(X3,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_21,plain,
( strict_order(member_predicate,X1)
| ~ member(X1,on) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| ~ member(X2,on)
| ~ member(X1,X3)
| ~ member(X3,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
member(esk1_0,on),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
( ~ member(X1,on)
| ~ member(X2,X1)
| ~ member(X2,X3)
| ~ member(X3,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
member(esk2_0,on),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X2,esk1_0)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
member(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,esk2_0)
| ~ member(X1,X2)
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
member(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X2,esk2_0)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk1_0,X1)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
member(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_31,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_27]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET810+4 : TPTP v8.1.0. Released v3.2.0.
% 0.04/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 : Sun Jul 10 07:05:45 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.018 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 36
% 0.23/1.42 # Proof object clause steps : 23
% 0.23/1.42 # Proof object formula steps : 13
% 0.23/1.42 # Proof object conjectures : 15
% 0.23/1.42 # Proof object clause conjectures : 12
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 10
% 0.23/1.42 # Proof object initial formulas used : 6
% 0.23/1.42 # Proof object generating inferences : 13
% 0.23/1.42 # Proof object simplifying inferences : 4
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 20
% 0.23/1.42 # Removed by relevancy pruning/SinE : 12
% 0.23/1.42 # Initial clauses : 51
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 51
% 0.23/1.42 # Processed clauses : 103
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 5
% 0.23/1.42 # ...remaining for further processing : 98
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 1
% 0.23/1.42 # Backward-rewritten : 3
% 0.23/1.42 # Generated clauses : 349
% 0.23/1.42 # ...of the previous two non-trivial : 332
% 0.23/1.42 # Contextual simplify-reflections : 5
% 0.23/1.42 # Paramodulations : 349
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 94
% 0.23/1.42 # Positive orientable unit clauses : 10
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 0
% 0.23/1.42 # Non-unit-clauses : 84
% 0.23/1.42 # Current number of unprocessed clauses: 279
% 0.23/1.42 # ...number of literals in the above : 1257
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 4
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 476
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 295
% 0.23/1.42 # Non-unit clause-clause subsumptions : 10
% 0.23/1.42 # Unit Clause-clause subsumption calls : 10
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 6
% 0.23/1.42 # BW rewrite match successes : 2
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 8607
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.027 s
% 0.23/1.42 # System time : 0.002 s
% 0.23/1.42 # Total time : 0.029 s
% 0.23/1.42 # Maximum resident set size: 3340 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------