TSTP Solution File: SWC224+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC224+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n005.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 20:27:26 EDT 2022
% Result : Theorem 0.88s 96.07s
% Output : CNFRefutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 5 unt; 0 def)
% Number of atoms : 183 ( 57 equ)
% Maximal formula atoms : 42 ( 5 avg)
% Number of connectives : 245 ( 95 ~; 93 |; 38 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 32 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ( app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| nil = X1
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X6,X8)
| ~ memberP(X7,X8)
| ~ leq(X5,X8)
| leq(X8,X5) ) ) ) ) )
| ! [X9] :
( ssList(X9)
=> ( app(X3,X9) != X4
| ~ equalelemsP(X3)
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X9
& ? [X12] :
( ssList(X12)
& app(X12,cons(X10,nil)) = X3 ) ) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,plain,
! [X2] :
( ~ ssItem(X2)
| ~ memberP(nil,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).
fof(c_0_9,negated_conjecture,
! [X17,X18,X19,X22,X23,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& nil != esk1_0
& ( ssItem(esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X18,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( memberP(X19,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( leq(X17,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ leq(esk5_3(X17,X18,X19),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ssList(esk6_0)
& app(esk3_0,esk6_0) = esk4_0
& equalelemsP(esk3_0)
& ( ~ ssItem(X22)
| ~ ssList(X23)
| app(cons(X22,nil),X23) != esk6_0
| ~ ssList(X24)
| app(X24,cons(X22,nil)) != esk3_0 )
& ( nil = esk4_0
| nil != esk3_0 ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])])]) ).
cnf(c_0_10,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( memberP(X2,esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_13,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(esk5_3(X1,nil,X2))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ ssItem(X1)
| ~ ssList(X2)
| app(app(X2,cons(X1,nil)),X3) != esk1_0
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X2] :
( ~ ssList(X2)
| app(nil,X2) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])]) ).
cnf(c_0_16,negated_conjecture,
( app(app(nil,cons(X1,nil)),X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12])]) ).
cnf(c_0_17,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| cons(X4,X3) = app(cons(X4,nil),X3) ),
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)],[ax81])])])])]) ).
cnf(c_0_19,negated_conjecture,
( app(cons(X1,nil),X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssItem(X4)
| ssList(cons(X4,X3)) ),
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)],[ax16])])])])]) ).
cnf(c_0_22,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_24,plain,
! [X4] :
( ( ssList(esk7_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( ssItem(esk8_1(X4))
| nil = X4
| ~ ssList(X4) )
& ( cons(esk8_1(X4),esk7_1(X4)) = X4
| nil = X4
| ~ ssList(X4) ) ),
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)],[ax20])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( cons(X1,X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_12])]) ).
cnf(c_0_26,plain,
( nil = X1
| cons(esk8_1(X1),esk7_1(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( nil = X1
| ssItem(esk8_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,plain,
( nil = X1
| ssList(esk7_1(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( nil = X1
| X1 != esk1_0
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]) ).
cnf(c_0_30,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,negated_conjecture,
nil != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC224+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n005.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 : Sun Jun 12 04:28:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.42/23.43 eprover: CPU time limit exceeded, terminating
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.42/23.44 eprover: CPU time limit exceeded, terminating
% 0.58/46.45 eprover: CPU time limit exceeded, terminating
% 0.58/46.45 eprover: CPU time limit exceeded, terminating
% 0.58/46.46 eprover: CPU time limit exceeded, terminating
% 0.58/46.47 eprover: CPU time limit exceeded, terminating
% 0.72/69.47 eprover: CPU time limit exceeded, terminating
% 0.72/69.48 eprover: CPU time limit exceeded, terminating
% 0.72/69.49 eprover: CPU time limit exceeded, terminating
% 0.72/69.52 eprover: CPU time limit exceeded, terminating
% 0.87/92.53 eprover: CPU time limit exceeded, terminating
% 0.87/92.54 eprover: CPU time limit exceeded, terminating
% 0.87/92.56 eprover: CPU time limit exceeded, terminating
% 0.87/92.57 eprover: CPU time limit exceeded, terminating
% 0.88/96.07 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.88/96.07
% 0.88/96.07 # Failure: Resource limit exceeded (time)
% 0.88/96.07 # OLD status Res
% 0.88/96.07 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.88/96.07 # Preprocessing time : 0.020 s
% 0.88/96.07 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.88/96.07
% 0.88/96.07 # Failure: Resource limit exceeded (time)
% 0.88/96.07 # OLD status Res
% 0.88/96.07 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.88/96.07 # Preprocessing time : 0.011 s
% 0.88/96.07 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.88/96.07
% 0.88/96.07 # Failure: Resource limit exceeded (time)
% 0.88/96.07 # OLD status Res
% 0.88/96.07 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.88/96.07 # Preprocessing time : 0.011 s
% 0.88/96.07 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.88/96.07
% 0.88/96.07 # Failure: Resource limit exceeded (time)
% 0.88/96.07 # OLD status Res
% 0.88/96.07 # Preprocessing time : 0.018 s
% 0.88/96.07 # Running protocol protocol_eprover_260890dcdd2d907655d788d68835201aeffdef4a for 23 seconds:
% 0.88/96.07 # SinE strategy is GSinE(CountFormulas,,1.5,,03,100,1.0)
% 0.88/96.07 # Preprocessing time : 0.024 s
% 0.88/96.07
% 0.88/96.07 # Proof found!
% 0.88/96.07 # SZS status Theorem
% 0.88/96.07 # SZS output start CNFRefutation
% See solution above
% 0.88/96.07 # Proof object total steps : 33
% 0.88/96.07 # Proof object clause steps : 19
% 0.88/96.07 # Proof object formula steps : 14
% 0.88/96.07 # Proof object conjectures : 14
% 0.88/96.07 # Proof object clause conjectures : 11
% 0.88/96.07 # Proof object formula conjectures : 3
% 0.88/96.07 # Proof object initial clauses used : 12
% 0.88/96.07 # Proof object initial formulas used : 7
% 0.88/96.07 # Proof object generating inferences : 7
% 0.88/96.07 # Proof object simplifying inferences : 9
% 0.88/96.07 # Training examples: 0 positive, 0 negative
% 0.88/96.07 # Parsed axioms : 96
% 0.88/96.07 # Removed by relevancy pruning/SinE : 63
% 0.88/96.07 # Initial clauses : 71
% 0.88/96.07 # Removed in clause preprocessing : 0
% 0.88/96.07 # Initial clauses in saturation : 71
% 0.88/96.07 # Processed clauses : 3953
% 0.88/96.07 # ...of these trivial : 27
% 0.88/96.07 # ...subsumed : 2814
% 0.88/96.07 # ...remaining for further processing : 1112
% 0.88/96.07 # Other redundant clauses eliminated : 63
% 0.88/96.07 # Clauses deleted for lack of memory : 0
% 0.88/96.07 # Backward-subsumed : 86
% 0.88/96.07 # Backward-rewritten : 5
% 0.88/96.07 # Generated clauses : 62660
% 0.88/96.07 # ...of the previous two non-trivial : 61323
% 0.88/96.07 # Contextual simplify-reflections : 1342
% 0.88/96.07 # Paramodulations : 62529
% 0.88/96.07 # Factorizations : 0
% 0.88/96.07 # Equation resolutions : 131
% 0.88/96.07 # Current number of processed clauses : 1019
% 0.88/96.07 # Positive orientable unit clauses : 20
% 0.88/96.07 # Positive unorientable unit clauses: 0
% 0.88/96.07 # Negative unit clauses : 40
% 0.88/96.07 # Non-unit-clauses : 959
% 0.88/96.07 # Current number of unprocessed clauses: 56670
% 0.88/96.07 # ...number of literals in the above : 432454
% 0.88/96.07 # Current number of archived formulas : 0
% 0.88/96.07 # Current number of archived clauses : 91
% 0.88/96.07 # Clause-clause subsumption calls (NU) : 255474
% 0.88/96.07 # Rec. Clause-clause subsumption calls : 84092
% 0.88/96.07 # Non-unit clause-clause subsumptions : 3347
% 0.88/96.07 # Unit Clause-clause subsumption calls : 2495
% 0.88/96.07 # Rewrite failures with RHS unbound : 0
% 0.88/96.07 # BW rewrite match attempts : 5
% 0.88/96.07 # BW rewrite match successes : 5
% 0.88/96.07 # Condensation attempts : 0
% 0.88/96.07 # Condensation successes : 0
% 0.88/96.07 # Termbank termtop insertions : 1495808
% 0.88/96.07
% 0.88/96.07 # -------------------------------------------------
% 0.88/96.07 # User time : 3.421 s
% 0.88/96.07 # System time : 0.044 s
% 0.88/96.07 # Total time : 3.465 s
% 0.88/96.07 # Maximum resident set size: 59456 pages
% 0.88/115.55 eprover: CPU time limit exceeded, terminating
% 0.88/115.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.57 eprover: No such file or directory
% 0.88/115.58 eprover: CPU time limit exceeded, terminating
% 0.88/115.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.58 eprover: No such file or directory
% 0.88/115.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.58 eprover: No such file or directory
% 0.88/115.58 eprover: CPU time limit exceeded, terminating
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.59 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.59 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.60 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.60 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.61 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.61 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.62 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.62 eprover: No such file or directory
% 0.88/115.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.63 eprover: No such file or directory
% 0.88/115.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.63 eprover: No such file or directory
% 0.88/115.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.63 eprover: No such file or directory
% 0.88/115.63 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.88/115.63 eprover: No such file or directory
%------------------------------------------------------------------------------