TSTP Solution File: SEU408+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU408+4 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n016.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:19:46 EDT 2022
% Result : Theorem 3.93s 8.12s
% Output : CNFRefutation 3.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 47 ( 27 unt; 0 def)
% Number of atoms : 138 ( 31 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 138 ( 47 ~; 37 |; 40 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-6 aty)
% Number of variables : 79 ( 3 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t11_latsum_1,conjecture,
! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_latsum_1) ).
fof(t46_zfmisc_1,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> k2_xboole_0(k1_tarski(X1),X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t46_zfmisc_1) ).
fof(t4_xboole_1,axiom,
! [X1,X2,X3] : k2_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(X1,k2_xboole_0(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t4_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : r1_tarski(X1,k2_xboole_0(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t7_xboole_1) ).
fof(t1_boole,axiom,
! [X1] : k2_xboole_0(X1,k1_xboole_0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+3.ax',t1_boole) ).
fof(t45_zfmisc_1,axiom,
! [X1,X2] :
( r1_tarski(k2_xboole_0(k1_tarski(X1),X2),X2)
=> r2_hidden(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+6.ax',t45_zfmisc_1) ).
fof(t6_xboole_1,axiom,
! [X1,X2] : k2_xboole_0(X1,k2_xboole_0(X1,X2)) = k2_xboole_0(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t6_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k2_xboole_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( r2_hidden(X1,X2)
=> m1_subset_1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+9.ax',t1_subset) ).
fof(d2_latsum_1,axiom,
! [X1] :
( l1_orders_2(X1)
=> ! [X2] :
( l1_orders_2(X2)
=> ! [X3] :
( ( v1_orders_2(X3)
& l1_orders_2(X3) )
=> ( X3 = k1_latsum_1(X1,X2)
<=> ( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
& u1_orders_2(X3) = k2_xboole_0(k2_xboole_0(u1_orders_2(X1),u1_orders_2(X2)),k7_relset_1(u1_struct_0(X1),u1_struct_0(X1),u1_struct_0(X2),u1_struct_0(X2),u1_orders_2(X1),u1_orders_2(X2))) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_latsum_1) ).
fof(dt_k1_latsum_1,axiom,
! [X1,X2] :
( ( l1_orders_2(X1)
& l1_orders_2(X2) )
=> ( v1_orders_2(k1_latsum_1(X1,X2))
& l1_orders_2(k1_latsum_1(X1,X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_latsum_1) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( ~ v3_struct_0(X1)
& v2_orders_2(X1)
& v3_orders_2(X1)
& v4_orders_2(X1)
& v1_lattice3(X1)
& l1_orders_2(X1) )
=> ! [X2] :
( ( ~ v3_struct_0(X2)
& v2_orders_2(X2)
& v3_orders_2(X2)
& v4_orders_2(X2)
& v1_lattice3(X2)
& l1_orders_2(X2) )
=> ! [X3] :
( r2_hidden(X3,u1_struct_0(X2))
=> m1_subset_1(X3,u1_struct_0(k1_latsum_1(X1,X2))) ) ) ),
inference(assume_negation,[status(cth)],[t11_latsum_1]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| k2_xboole_0(k1_tarski(X3),X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t46_zfmisc_1])]) ).
fof(c_0_13,negated_conjecture,
( ~ v3_struct_0(esk1_0)
& v2_orders_2(esk1_0)
& v3_orders_2(esk1_0)
& v4_orders_2(esk1_0)
& v1_lattice3(esk1_0)
& l1_orders_2(esk1_0)
& ~ v3_struct_0(esk2_0)
& v2_orders_2(esk2_0)
& v3_orders_2(esk2_0)
& v4_orders_2(esk2_0)
& v1_lattice3(esk2_0)
& l1_orders_2(esk2_0)
& r2_hidden(esk3_0,u1_struct_0(esk2_0))
& ~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_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)],[inference(fof_simplification,[status(thm)],[c_0_11])])])])])]) ).
fof(c_0_14,plain,
! [X4,X5,X6] : k2_xboole_0(k2_xboole_0(X4,X5),X6) = k2_xboole_0(X4,k2_xboole_0(X5,X6)),
inference(variable_rename,[status(thm)],[t4_xboole_1]) ).
cnf(c_0_15,plain,
( k2_xboole_0(k1_tarski(X1),X2) = X2
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X3,X4] : r1_tarski(X3,k2_xboole_0(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_18,plain,
! [X2] : k2_xboole_0(X2,k1_xboole_0) = X2,
inference(variable_rename,[status(thm)],[t1_boole]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ r1_tarski(k2_xboole_0(k1_tarski(X3),X4),X4)
| r2_hidden(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t45_zfmisc_1])]) ).
cnf(c_0_20,plain,
k2_xboole_0(k2_xboole_0(X1,X2),X3) = k2_xboole_0(X1,k2_xboole_0(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
k2_xboole_0(k1_tarski(esk3_0),u1_struct_0(esk2_0)) = u1_struct_0(esk2_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
r1_tarski(X1,k2_xboole_0(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
k2_xboole_0(X1,k1_xboole_0) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X3,X4] : k2_xboole_0(X3,k2_xboole_0(X3,X4)) = k2_xboole_0(X3,X4),
inference(variable_rename,[status(thm)],[t6_xboole_1]) ).
fof(c_0_25,plain,
! [X3,X4] : k2_xboole_0(X3,X4) = k2_xboole_0(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_27,plain,
! [X4,X5,X6] :
( ( u1_struct_0(X6) = k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_orders_2(X6) = k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 != k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) )
& ( u1_struct_0(X6) != k2_xboole_0(u1_struct_0(X4),u1_struct_0(X5))
| u1_orders_2(X6) != k2_xboole_0(k2_xboole_0(u1_orders_2(X4),u1_orders_2(X5)),k7_relset_1(u1_struct_0(X4),u1_struct_0(X4),u1_struct_0(X5),u1_struct_0(X5),u1_orders_2(X4),u1_orders_2(X5)))
| X6 = k1_latsum_1(X4,X5)
| ~ v1_orders_2(X6)
| ~ l1_orders_2(X6)
| ~ l1_orders_2(X5)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_latsum_1])])])])])]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ( v1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) )
& ( l1_orders_2(k1_latsum_1(X3,X4))
| ~ l1_orders_2(X3)
| ~ l1_orders_2(X4) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_latsum_1])])]) ).
cnf(c_0_29,plain,
( r2_hidden(X1,X2)
| ~ r1_tarski(k2_xboole_0(k1_tarski(X1),X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,negated_conjecture,
k2_xboole_0(k1_tarski(esk3_0),k2_xboole_0(u1_struct_0(esk2_0),X1)) = k2_xboole_0(u1_struct_0(esk2_0),X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_31,plain,
r1_tarski(X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
k2_xboole_0(X1,k2_xboole_0(X1,X2)) = k2_xboole_0(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
k2_xboole_0(X1,X2) = k2_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_35,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( u1_struct_0(X3) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X3)
| ~ v1_orders_2(X3)
| X3 != k1_latsum_1(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( v1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(u1_struct_0(esk2_0),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_40,plain,
k2_xboole_0(X1,k2_xboole_0(X2,X1)) = k2_xboole_0(X2,X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ r2_hidden(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( u1_struct_0(k1_latsum_1(X1,X2)) = k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : SEU408+4 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.15 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 21:25:02 EDT 2022
% 0.14/0.36 % CPUTime :
% 3.93/8.12 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 3.93/8.12 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 3.93/8.12 # Preprocessing time : 2.911 s
% 3.93/8.12
% 3.93/8.12 # Proof found!
% 3.93/8.12 # SZS status Theorem
% 3.93/8.12 # SZS output start CNFRefutation
% See solution above
% 3.93/8.12 # Proof object total steps : 47
% 3.93/8.12 # Proof object clause steps : 24
% 3.93/8.12 # Proof object formula steps : 23
% 3.93/8.12 # Proof object conjectures : 13
% 3.93/8.12 # Proof object clause conjectures : 10
% 3.93/8.12 # Proof object formula conjectures : 3
% 3.93/8.12 # Proof object initial clauses used : 15
% 3.93/8.12 # Proof object initial formulas used : 11
% 3.93/8.12 # Proof object generating inferences : 9
% 3.93/8.12 # Proof object simplifying inferences : 8
% 3.93/8.12 # Training examples: 0 positive, 0 negative
% 3.93/8.12 # Parsed axioms : 66047
% 3.93/8.12 # Removed by relevancy pruning/SinE : 65946
% 3.93/8.12 # Initial clauses : 218
% 3.93/8.12 # Removed in clause preprocessing : 3
% 3.93/8.12 # Initial clauses in saturation : 215
% 3.93/8.12 # Processed clauses : 1465
% 3.93/8.12 # ...of these trivial : 147
% 3.93/8.12 # ...subsumed : 656
% 3.93/8.12 # ...remaining for further processing : 662
% 3.93/8.12 # Other redundant clauses eliminated : 55
% 3.93/8.12 # Clauses deleted for lack of memory : 0
% 3.93/8.12 # Backward-subsumed : 11
% 3.93/8.12 # Backward-rewritten : 66
% 3.93/8.12 # Generated clauses : 10031
% 3.93/8.12 # ...of the previous two non-trivial : 7762
% 3.93/8.12 # Contextual simplify-reflections : 154
% 3.93/8.12 # Paramodulations : 9947
% 3.93/8.12 # Factorizations : 12
% 3.93/8.12 # Equation resolutions : 72
% 3.93/8.12 # Current number of processed clauses : 584
% 3.93/8.12 # Positive orientable unit clauses : 127
% 3.93/8.12 # Positive unorientable unit clauses: 3
% 3.93/8.12 # Negative unit clauses : 42
% 3.93/8.12 # Non-unit-clauses : 412
% 3.93/8.12 # Current number of unprocessed clauses: 5909
% 3.93/8.12 # ...number of literals in the above : 20681
% 3.93/8.12 # Current number of archived formulas : 0
% 3.93/8.12 # Current number of archived clauses : 78
% 3.93/8.12 # Clause-clause subsumption calls (NU) : 46186
% 3.93/8.12 # Rec. Clause-clause subsumption calls : 28318
% 3.93/8.12 # Non-unit clause-clause subsumptions : 489
% 3.93/8.12 # Unit Clause-clause subsumption calls : 2534
% 3.93/8.12 # Rewrite failures with RHS unbound : 0
% 3.93/8.12 # BW rewrite match attempts : 197
% 3.93/8.12 # BW rewrite match successes : 91
% 3.93/8.12 # Condensation attempts : 0
% 3.93/8.12 # Condensation successes : 0
% 3.93/8.12 # Termbank termtop insertions : 2489971
% 3.93/8.12
% 3.93/8.12 # -------------------------------------------------
% 3.93/8.12 # User time : 2.997 s
% 3.93/8.12 # System time : 0.117 s
% 3.93/8.12 # Total time : 3.114 s
% 3.93/8.12 # Maximum resident set size: 165852 pages
% 3.95/27.09 eprover: CPU time limit exceeded, terminating
% 3.95/27.09 eprover: CPU time limit exceeded, terminating
% 3.95/27.10 eprover: CPU time limit exceeded, terminating
% 3.95/27.12 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.12 eprover: No such file or directory
% 3.95/27.13 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.13 eprover: No such file or directory
% 3.95/27.13 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.13 eprover: No such file or directory
% 3.95/27.14 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.14 eprover: No such file or directory
% 3.95/27.15 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.15 eprover: No such file or directory
% 3.95/27.15 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.15 eprover: No such file or directory
% 3.95/27.16 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.16 eprover: No such file or directory
% 3.95/27.16 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.16 eprover: No such file or directory
% 3.95/27.16 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.16 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.17 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.17 eprover: No such file or directory
% 3.95/27.18 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.18 eprover: No such file or directory
% 3.95/27.18 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.18 eprover: No such file or directory
% 3.95/27.18 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.18 eprover: No such file or directory
% 3.95/27.18 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.18 eprover: No such file or directory
% 3.95/27.18 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.18 eprover: No such file or directory
% 3.95/27.19 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.19 eprover: No such file or directory
% 3.95/27.19 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.19 eprover: No such file or directory
% 3.95/27.19 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.19 eprover: No such file or directory
% 3.95/27.19 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.19 eprover: No such file or directory
% 3.95/27.19 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.19 eprover: No such file or directory
% 3.95/27.20 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.20 eprover: No such file or directory
% 3.95/27.20 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.20 eprover: No such file or directory
% 3.95/27.20 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.20 eprover: No such file or directory
% 3.95/27.20 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.20 eprover: No such file or directory
% 3.95/27.20 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.20 eprover: No such file or directory
% 3.95/27.21 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 3.95/27.21 eprover: No such file or directory
% 3.95/27.21 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.21 eprover: No such file or directory
% 3.95/27.21 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 3.95/27.21 eprover: No such file or directory
%------------------------------------------------------------------------------