TSTP Solution File: SEU408+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU408+2 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n029.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 1.38s 177.54s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 137 ( 21 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 167 ( 56 ~; 52 |; 45 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 53 ( 8 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = k2_xboole_0(X1,X2)
<=> ! [X4] :
( r2_hidden(X4,X3)
<=> ( r2_hidden(X4,X1)
| r2_hidden(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d2_xboole_0) ).
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(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_5,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ r2_hidden(X8,X7)
| r2_hidden(X8,X5)
| r2_hidden(X8,X6)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X5)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(X8,X6)
| r2_hidden(X8,X7)
| X7 != k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk19_3(X5,X6,X7),X5)
| ~ r2_hidden(esk19_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( ~ r2_hidden(esk19_3(X5,X6,X7),X6)
| ~ r2_hidden(esk19_3(X5,X6,X7),X7)
| X7 = k2_xboole_0(X5,X6) )
& ( r2_hidden(esk19_3(X5,X6,X7),X7)
| r2_hidden(esk19_3(X5,X6,X7),X5)
| r2_hidden(esk19_3(X5,X6,X7),X6)
| X7 = k2_xboole_0(X5,X6) ) ),
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)],[d2_xboole_0])])])])])])]) ).
fof(c_0_6,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]) ).
cnf(c_0_7,plain,
( r2_hidden(X4,X1)
| X1 != k2_xboole_0(X2,X3)
| ~ r2_hidden(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,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_6])])])])])]) ).
fof(c_0_9,plain,
! [X3,X4] :
( ~ r2_hidden(X3,X4)
| m1_subset_1(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_10,plain,
( r2_hidden(X1,k2_xboole_0(X2,X3))
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
r2_hidden(esk3_0,u1_struct_0(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,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_13,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_14,plain,
( m1_subset_1(X1,X2)
| ~ r2_hidden(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
r2_hidden(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(pm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,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_12]) ).
cnf(c_0_17,plain,
( l1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( v1_orders_2(k1_latsum_1(X2,X1))
| ~ l1_orders_2(X1)
| ~ l1_orders_2(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
m1_subset_1(esk3_0,k2_xboole_0(X1,u1_struct_0(esk2_0))),
inference(pm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( k2_xboole_0(u1_struct_0(X1),u1_struct_0(X2)) = u1_struct_0(k1_latsum_1(X1,X2))
| ~ l1_orders_2(X2)
| ~ l1_orders_2(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
l1_orders_2(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
~ m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(esk1_0,esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( m1_subset_1(esk3_0,u1_struct_0(k1_latsum_1(X1,esk2_0)))
| ~ l1_orders_2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
l1_orders_2(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU408+2 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 09:45:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.57/23.64 eprover: CPU time limit exceeded, terminating
% 0.57/23.64 eprover: CPU time limit exceeded, terminating
% 0.57/23.65 eprover: CPU time limit exceeded, terminating
% 0.57/23.67 eprover: CPU time limit exceeded, terminating
% 0.69/46.66 eprover: CPU time limit exceeded, terminating
% 0.69/46.66 eprover: CPU time limit exceeded, terminating
% 0.69/46.67 eprover: CPU time limit exceeded, terminating
% 0.70/47.14 eprover: CPU time limit exceeded, terminating
% 0.82/69.68 eprover: CPU time limit exceeded, terminating
% 0.82/69.69 eprover: CPU time limit exceeded, terminating
% 0.82/69.70 eprover: CPU time limit exceeded, terminating
% 0.82/70.16 eprover: CPU time limit exceeded, terminating
% 0.92/92.69 eprover: CPU time limit exceeded, terminating
% 0.92/92.71 eprover: CPU time limit exceeded, terminating
% 0.92/92.71 eprover: CPU time limit exceeded, terminating
% 0.94/93.17 eprover: CPU time limit exceeded, terminating
% 1.04/115.71 eprover: CPU time limit exceeded, terminating
% 1.04/115.72 eprover: CPU time limit exceeded, terminating
% 1.04/115.73 eprover: CPU time limit exceeded, terminating
% 1.04/116.18 eprover: CPU time limit exceeded, terminating
% 1.16/138.72 eprover: CPU time limit exceeded, terminating
% 1.16/138.74 eprover: CPU time limit exceeded, terminating
% 1.16/138.74 eprover: CPU time limit exceeded, terminating
% 1.16/139.20 eprover: CPU time limit exceeded, terminating
% 1.29/161.74 eprover: CPU time limit exceeded, terminating
% 1.29/161.76 eprover: CPU time limit exceeded, terminating
% 1.29/161.76 eprover: CPU time limit exceeded, terminating
% 1.29/162.21 eprover: CPU time limit exceeded, terminating
% 1.38/177.54 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.38/177.54 # Preprocessing time : 0.168 s
% 1.38/177.54 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # Preprocessing time : 0.834 s
% 1.38/177.54 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # Preprocessing time : 0.787 s
% 1.38/177.54 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.38/177.54 # Preprocessing time : 0.174 s
% 1.38/177.54 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.38/177.54 # Preprocessing time : 0.180 s
% 1.38/177.54 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.38/177.54 # Preprocessing time : 0.177 s
% 1.38/177.54 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 1.38/177.54
% 1.38/177.54 # Failure: Resource limit exceeded (time)
% 1.38/177.54 # OLD status Res
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 1.38/177.54 # Preprocessing time : 0.111 s
% 1.38/177.54 # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 1.38/177.54 # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 1.38/177.54 # Preprocessing time : 0.171 s
% 1.38/177.54
% 1.38/177.54 # Proof found!
% 1.38/177.54 # SZS status Theorem
% 1.38/177.54 # SZS output start CNFRefutation
% See solution above
% 1.38/177.54 # Proof object total steps : 26
% 1.38/177.54 # Proof object clause steps : 15
% 1.38/177.54 # Proof object formula steps : 11
% 1.38/177.54 # Proof object conjectures : 11
% 1.38/177.54 # Proof object clause conjectures : 8
% 1.38/177.54 # Proof object formula conjectures : 3
% 1.38/177.54 # Proof object initial clauses used : 9
% 1.38/177.54 # Proof object initial formulas used : 5
% 1.38/177.54 # Proof object generating inferences : 6
% 1.38/177.54 # Proof object simplifying inferences : 6
% 1.38/177.54 # Training examples: 0 positive, 0 negative
% 1.38/177.54 # Parsed axioms : 4448
% 1.38/177.54 # Removed by relevancy pruning/SinE : 4347
% 1.38/177.54 # Initial clauses : 255
% 1.38/177.54 # Removed in clause preprocessing : 2
% 1.38/177.54 # Initial clauses in saturation : 253
% 1.38/177.54 # Processed clauses : 57541
% 1.38/177.54 # ...of these trivial : 316
% 1.38/177.54 # ...subsumed : 47335
% 1.38/177.54 # ...remaining for further processing : 9890
% 1.38/177.54 # Other redundant clauses eliminated : 1408
% 1.38/177.54 # Clauses deleted for lack of memory : 761412
% 1.38/177.54 # Backward-subsumed : 58
% 1.38/177.54 # Backward-rewritten : 359
% 1.38/177.54 # Generated clauses : 972408
% 1.38/177.54 # ...of the previous two non-trivial : 945207
% 1.38/177.54 # Contextual simplify-reflections : 10349
% 1.38/177.54 # Paramodulations : 970559
% 1.38/177.54 # Factorizations : 22
% 1.38/177.54 # Equation resolutions : 1830
% 1.38/177.54 # Current number of processed clauses : 9462
% 1.38/177.54 # Positive orientable unit clauses : 549
% 1.38/177.54 # Positive unorientable unit clauses: 50
% 1.38/177.54 # Negative unit clauses : 1916
% 1.38/177.54 # Non-unit-clauses : 6947
% 1.38/177.54 # Current number of unprocessed clauses: 111741
% 1.38/177.54 # ...number of literals in the above : 277421
% 1.38/177.54 # Current number of archived formulas : 0
% 1.38/177.54 # Current number of archived clauses : 419
% 1.38/177.54 # Clause-clause subsumption calls (NU) : 19629737
% 1.38/177.54 # Rec. Clause-clause subsumption calls : 14475653
% 1.38/177.54 # Non-unit clause-clause subsumptions : 35868
% 1.38/177.54 # Unit Clause-clause subsumption calls : 454843
% 1.38/177.54 # Rewrite failures with RHS unbound : 679
% 1.38/177.54 # BW rewrite match attempts : 3560
% 1.38/177.54 # BW rewrite match successes : 239
% 1.38/177.54 # Condensation attempts : 0
% 1.38/177.54 # Condensation successes : 0
% 1.38/177.54 # Termbank termtop insertions : 9326253
% 1.38/177.54
% 1.38/177.54 # -------------------------------------------------
% 1.38/177.54 # User time : 15.366 s
% 1.38/177.54 # System time : 0.118 s
% 1.38/177.54 # Total time : 15.484 s
% 1.38/177.54 # Maximum resident set size: 145708 pages
% 1.38/184.75 eprover: CPU time limit exceeded, terminating
% 1.38/184.77 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/184.77 eprover: No such file or directory
% 1.38/184.77 eprover: CPU time limit exceeded, terminating
% 1.38/184.77 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/184.77 eprover: No such file or directory
% 1.38/184.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/184.78 eprover: No such file or directory
% 1.38/184.78 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/184.78 eprover: No such file or directory
% 1.38/184.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.38/184.79 eprover: No such file or directory
% 1.38/184.79 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.38/184.79 eprover: No such file or directory
% 1.38/184.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.38/184.80 eprover: No such file or directory
% 1.38/184.80 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.38/184.80 eprover: No such file or directory
% 1.38/185.22 eprover: CPU time limit exceeded, terminating
% 1.38/185.24 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/185.24 eprover: No such file or directory
% 1.38/185.25 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/185.25 eprover: No such file or directory
% 1.38/185.25 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 1.38/185.25 eprover: No such file or directory
%------------------------------------------------------------------------------