TSTP Solution File: SWC191+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWC191+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:15 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 41 ( 14 unt; 0 def)
% Number of atoms : 186 ( 36 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 230 ( 85 ~; 85 |; 28 &)
% ( 1 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn 45 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
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(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[co1]) ).
fof(c_0_8,negated_conjecture,
! [X14] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& frontsegP(esk51_0,esk50_0)
& equalelemsP(esk50_0)
& ( ~ ssList(X14)
| ~ neq(esk50_0,X14)
| ~ frontsegP(esk51_0,X14)
| ~ segmentP(X14,esk50_0)
| ~ equalelemsP(X14) )
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& esk52_0 != esk53_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_7])])])])])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6] :
( ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
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)],[ax82])])])])]) ).
fof(c_0_10,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_11,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ssList(app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk48_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_16,plain,
( app(app(X1,app(X2,X3)),X4) = app(app(X1,X2),app(X3,X4))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_12]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
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(app(esk54_0,cons(esk52_0,nil)),app(cons(esk53_0,nil),esk55_0)) = esk48_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
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_13])]) ).
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]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ equalelemsP(X6)
| ~ ssItem(X7)
| ~ ssItem(X8)
| ~ ssList(X9)
| ~ ssList(X10)
| app(X9,cons(X7,cons(X8,X10))) != X6
| X7 = X8
| ~ ssList(X6) )
& ( ssItem(esk40_1(X6))
| equalelemsP(X6)
| ~ ssList(X6) )
& ( ssItem(esk41_1(X6))
| equalelemsP(X6)
| ~ ssList(X6) )
& ( ssList(esk42_1(X6))
| equalelemsP(X6)
| ~ ssList(X6) )
& ( ssList(esk43_1(X6))
| equalelemsP(X6)
| ~ ssList(X6) )
& ( app(esk42_1(X6),cons(esk40_1(X6),cons(esk41_1(X6),esk43_1(X6)))) = X6
| equalelemsP(X6)
| ~ ssList(X6) )
& ( esk40_1(X6) != esk41_1(X6)
| equalelemsP(X6)
| ~ ssList(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)],[ax14])])])])])])]) ).
cnf(c_0_23,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,esk55_0)) = esk48_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_21])]) ).
cnf(c_0_24,plain,
( X2 = X3
| ~ ssList(X1)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,esk55_0))) = esk48_0
| ~ ssList(cons(esk53_0,esk55_0))
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_23]),c_0_13])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,negated_conjecture,
equalelemsP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk48_0
| ~ ssList(cons(esk53_0,esk55_0))
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
equalelemsP(esk48_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_34,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_35,negated_conjecture,
( ~ ssList(cons(esk53_0,esk55_0))
| ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_17]),c_0_13]),c_0_21]),c_0_26])]),c_0_33]) ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(cons(esk52_0,nil))
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_17]),c_0_21])]) ).
cnf(c_0_38,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_39,negated_conjecture,
~ ssList(cons(esk52_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_36]),c_0_38]),c_0_21])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_36]),c_0_38]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC191+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n009.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 : Sun Jun 12 10:23:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.025 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 41
% 0.21/1.40 # Proof object clause steps : 27
% 0.21/1.40 # Proof object formula steps : 14
% 0.21/1.40 # Proof object conjectures : 22
% 0.21/1.40 # Proof object clause conjectures : 19
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 15
% 0.21/1.40 # Proof object initial formulas used : 7
% 0.21/1.40 # Proof object generating inferences : 11
% 0.21/1.40 # Proof object simplifying inferences : 31
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 96
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 205
% 0.21/1.40 # Removed in clause preprocessing : 2
% 0.21/1.40 # Initial clauses in saturation : 203
% 0.21/1.40 # Processed clauses : 2076
% 0.21/1.40 # ...of these trivial : 29
% 0.21/1.40 # ...subsumed : 984
% 0.21/1.40 # ...remaining for further processing : 1063
% 0.21/1.40 # Other redundant clauses eliminated : 538
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 355
% 0.21/1.40 # Backward-rewritten : 37
% 0.21/1.40 # Generated clauses : 23589
% 0.21/1.40 # ...of the previous two non-trivial : 21770
% 0.21/1.40 # Contextual simplify-reflections : 2080
% 0.21/1.40 # Paramodulations : 22967
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 601
% 0.21/1.40 # Current number of processed clauses : 655
% 0.21/1.40 # Positive orientable unit clauses : 37
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 20
% 0.21/1.40 # Non-unit-clauses : 598
% 0.21/1.40 # Current number of unprocessed clauses: 11741
% 0.21/1.40 # ...number of literals in the above : 92879
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 392
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 269313
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 27792
% 0.21/1.40 # Non-unit clause-clause subsumptions : 3089
% 0.21/1.40 # Unit Clause-clause subsumption calls : 7240
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 9
% 0.21/1.40 # BW rewrite match successes : 9
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 576632
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.537 s
% 0.21/1.40 # System time : 0.009 s
% 0.21/1.40 # Total time : 0.546 s
% 0.21/1.40 # Maximum resident set size: 21508 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.41 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------