TSTP Solution File: SWC308+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC308+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:57 EDT 2022
% Result : Theorem 0.36s 23.54s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 249 ( 105 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 343 ( 143 ~; 139 |; 38 &)
% ( 1 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 94 ( 0 sgn 36 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X1 = X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) != X3
& app(cons(X9,nil),X10) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssList(X5)
& X1 = X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X2) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X2) = X8
& neq(nil,X2) )
& neq(nil,X2) ) ) )
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(X10,cons(X9,nil)) != X3
& app(cons(X9,nil),X10) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_10,negated_conjecture,
! [X15,X16,X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ( ~ ssList(X15)
| esk1_0 != X15
| ~ ssList(X16)
| ~ ssList(X17)
| tl(esk2_0) != X16
| app(X16,X17) != X15
| ~ ssItem(X18)
| cons(X18,nil) != X17
| hd(esk2_0) != X18
| ~ neq(nil,esk2_0)
| ~ neq(nil,esk2_0) )
& ( ~ ssItem(X19)
| ~ ssList(X20)
| app(X20,cons(X19,nil)) = esk3_0
| app(cons(X19,nil),X20) != esk4_0 )
& ( nil = esk3_0
| nil != esk4_0 ) ),
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_9])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ neq(nil,esk2_0)
| ~ neq(nil,esk2_0)
| hd(esk2_0) != X1
| cons(X1,nil) != X2
| ~ ssItem(X1)
| app(X3,X2) != X4
| tl(esk2_0) != X3
| ~ ssList(X2)
| ~ ssList(X3)
| esk1_0 != X4
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( esk1_0 != X4
| hd(esk2_0) != X1
| tl(esk2_0) != X3
| app(X3,X2) != X4
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk2_0) ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ( ~ neq(X3,X4)
| X3 != X4
| ~ ssList(X4)
| ~ ssList(X3) )
& ( X3 = X4
| neq(X3,X4)
| ~ ssList(X4)
| ~ ssList(X3) ) ),
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)],[ax15])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( cons(X1,nil) != X2
| hd(esk2_0) != X1
| tl(esk2_0) != X3
| app(X3,X2) != X4
| esk3_0 != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ neq(nil,esk2_0)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( neq(X1,X2)
| X1 = X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
( esk2_0 = nil
| cons(X1,nil) != X2
| hd(esk2_0) != X1
| tl(esk2_0) != X3
| app(X3,X2) != X4
| esk3_0 != X4
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ ssList(X3)
| ~ ssList(X4)
| ssList(app(X3,X4)) ),
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)],[ax26])])])])]) ).
cnf(c_0_21,negated_conjecture,
( app(X2,cons(X1,nil)) = esk3_0
| app(cons(X1,nil),X2) != esk4_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_23,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_24,negated_conjecture,
( esk2_0 = nil
| app(X1,cons(X2,nil)) != X3
| hd(esk2_0) != X2
| tl(esk2_0) != X1
| esk3_0 != X3
| ~ ssList(cons(X2,nil))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( app(X1,cons(X2,nil)) = esk3_0
| app(cons(X2,nil),X1) != esk2_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( cons(X1,X2) = app(cons(X1,nil),X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
( esk2_0 = nil
| app(X1,cons(X2,nil)) != esk3_0
| hd(esk2_0) != X2
| tl(esk2_0) != X1
| ~ ssList(cons(X2,nil))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( app(X1,cons(X2,nil)) = esk3_0
| cons(X2,X1) != esk2_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_30,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_31,negated_conjecture,
( esk2_0 = nil
| cons(X1,X2) != esk2_0
| hd(esk2_0) != X1
| tl(esk2_0) != X2
| ~ ssList(cons(X1,nil))
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_33,negated_conjecture,
( esk2_0 = nil
| cons(X1,X2) != esk2_0
| hd(esk2_0) != X1
| tl(esk2_0) != X2
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18])]) ).
fof(c_0_34,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| cons(hd(X2),tl(X2)) = X2 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax78])]) ).
cnf(c_0_35,negated_conjecture,
( esk2_0 = nil
| cons(hd(esk2_0),X1) != esk2_0
| tl(esk2_0) != X1
| ~ ssList(X1)
| ~ ssItem(hd(esk2_0)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_37,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssItem(hd(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax22])]) ).
cnf(c_0_38,negated_conjecture,
( esk2_0 = nil
| ~ ssList(tl(esk2_0))
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_17])]) ).
cnf(c_0_39,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_40,plain,
! [X2] :
( ~ ssList(X2)
| nil = X2
| ssList(tl(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax24])]) ).
cnf(c_0_41,negated_conjecture,
( esk2_0 = nil
| ~ ssList(tl(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17])]) ).
cnf(c_0_42,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| X1 != X2
| ~ neq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_44,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_45,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_17])]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_43]) ).
cnf(c_0_47,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC308+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jun 12 08:16:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.42 eprover: CPU time limit exceeded, terminating
% 0.36/23.54 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.36/23.54
% 0.36/23.54 # Failure: Resource limit exceeded (time)
% 0.36/23.54 # OLD status Res
% 0.36/23.54 # Preprocessing time : 0.025 s
% 0.36/23.54 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.36/23.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.36/23.54 # Preprocessing time : 0.019 s
% 0.36/23.54
% 0.36/23.54 # Proof found!
% 0.36/23.54 # SZS status Theorem
% 0.36/23.54 # SZS output start CNFRefutation
% See solution above
% 0.36/23.54 # Proof object total steps : 49
% 0.36/23.54 # Proof object clause steps : 31
% 0.36/23.54 # Proof object formula steps : 18
% 0.36/23.54 # Proof object conjectures : 24
% 0.36/23.54 # Proof object clause conjectures : 21
% 0.36/23.54 # Proof object formula conjectures : 3
% 0.36/23.54 # Proof object initial clauses used : 15
% 0.36/23.54 # Proof object initial formulas used : 9
% 0.36/23.54 # Proof object generating inferences : 11
% 0.36/23.54 # Proof object simplifying inferences : 19
% 0.36/23.54 # Training examples: 0 positive, 0 negative
% 0.36/23.54 # Parsed axioms : 96
% 0.36/23.54 # Removed by relevancy pruning/SinE : 67
% 0.36/23.54 # Initial clauses : 49
% 0.36/23.54 # Removed in clause preprocessing : 0
% 0.36/23.54 # Initial clauses in saturation : 49
% 0.36/23.54 # Processed clauses : 186
% 0.36/23.54 # ...of these trivial : 19
% 0.36/23.54 # ...subsumed : 36
% 0.36/23.54 # ...remaining for further processing : 131
% 0.36/23.54 # Other redundant clauses eliminated : 8
% 0.36/23.54 # Clauses deleted for lack of memory : 0
% 0.36/23.54 # Backward-subsumed : 22
% 0.36/23.54 # Backward-rewritten : 41
% 0.36/23.54 # Generated clauses : 406
% 0.36/23.54 # ...of the previous two non-trivial : 358
% 0.36/23.54 # Contextual simplify-reflections : 55
% 0.36/23.54 # Paramodulations : 380
% 0.36/23.54 # Factorizations : 0
% 0.36/23.54 # Equation resolutions : 26
% 0.36/23.54 # Current number of processed clauses : 66
% 0.36/23.54 # Positive orientable unit clauses : 8
% 0.36/23.54 # Positive unorientable unit clauses: 0
% 0.36/23.54 # Negative unit clauses : 1
% 0.36/23.54 # Non-unit-clauses : 57
% 0.36/23.54 # Current number of unprocessed clauses: 169
% 0.36/23.54 # ...number of literals in the above : 1103
% 0.36/23.54 # Current number of archived formulas : 0
% 0.36/23.54 # Current number of archived clauses : 63
% 0.36/23.54 # Clause-clause subsumption calls (NU) : 5302
% 0.36/23.54 # Rec. Clause-clause subsumption calls : 832
% 0.36/23.54 # Non-unit clause-clause subsumptions : 113
% 0.36/23.54 # Unit Clause-clause subsumption calls : 71
% 0.36/23.54 # Rewrite failures with RHS unbound : 0
% 0.36/23.54 # BW rewrite match attempts : 3
% 0.36/23.54 # BW rewrite match successes : 3
% 0.36/23.54 # Condensation attempts : 0
% 0.36/23.54 # Condensation successes : 0
% 0.36/23.54 # Termbank termtop insertions : 11708
% 0.36/23.54
% 0.36/23.54 # -------------------------------------------------
% 0.36/23.54 # User time : 0.045 s
% 0.36/23.54 # System time : 0.004 s
% 0.36/23.54 # Total time : 0.049 s
% 0.36/23.54 # Maximum resident set size: 3204 pages
% 0.36/46.42 eprover: CPU time limit exceeded, terminating
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.43 eprover: CPU time limit exceeded, terminating
% 0.36/46.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.43 eprover: No such file or directory
% 0.36/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.44 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.45 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.46 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.47 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.48 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.49 eprover: No such file or directory
% 0.36/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.36/46.50 eprover: No such file or directory
%------------------------------------------------------------------------------