TSTP Solution File: NUM580+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM580+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 : Mon Jul 18 09:34:02 EDT 2022
% Result : Theorem 0.28s 5.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 150 ( 21 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 170 ( 56 ~; 51 |; 43 &)
% ( 4 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 37 ( 2 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__) ).
fof(m__3989_02,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__3989_02) ).
fof(mCardCons,axiom,
! [X1] :
( ( aSet0(X1)
& isFinite0(X1) )
=> ! [X2] :
( aElement0(X2)
=> ( ~ aElementOf0(X2,X1)
=> sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',mCardCons) ).
fof(mEOfElem,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aElementOf0(X2,X1)
=> aElement0(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',mEOfElem) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__3533) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',mCardNum) ).
fof(m__3671,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( aSet0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> aElementOf0(X2,szNzAzT0) )
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
& isCountable0(sdtlpdtrp0(xN,X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__3671) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',m__3989) ).
fof(c_0_8,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,hypothesis,
! [X2,X3,X3,X4] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X3)
| ~ aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X3,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X3 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElement0(X3)
| ~ aElementOf0(X3,sdtlpdtrp0(xN,xi))
| X3 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X3,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSet0(xQ)
& ( ~ aElementOf0(X4,xQ)
| aElementOf0(X4,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
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)],[m__3989_02])])])])])]) ).
fof(c_0_10,negated_conjecture,
! [X2,X3,X3] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X2,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X2) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X3)
| ~ aElementOf0(X3,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X3,xQ)
| X3 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X3,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X3,xQ)
| ~ aElement0(X3)
| aElementOf0(X3,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X3 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X3)
| aElementOf0(X3,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK ),
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)],[c_0_8])])])])])]) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ isFinite0(X3)
| ~ aElement0(X4)
| aElementOf0(X4,X3)
| sbrdtbr0(sdtpldt0(X3,X4)) = szszuzczcdt0(sbrdtbr0(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)],[inference(fof_simplification,[status(thm)],[mCardCons])])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ aSet0(X3)
| ~ aElementOf0(X4,X3)
| aElement0(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)],[mEOfElem])])])])]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) != xK,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( sbrdtbr0(sdtpldt0(X1,X2)) = szszuzczcdt0(sbrdtbr0(X1))
| aElementOf0(X2,X1)
| ~ aElement0(X2)
| ~ isFinite0(X1)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
sbrdtbr0(xQ) = xk,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,hypothesis,
szszuzczcdt0(xk) = xK,
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_19,hypothesis,
aSet0(xQ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( aElement0(X1)
| ~ aElementOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,hypothesis,
( X1 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X1,xQ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ)
| ~ isFinite0(xQ)
| ~ aElement0(szmzizndt0(sdtlpdtrp0(xN,xi))) ),
inference(cn,[status(thm)],[inference(rw,[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]),c_0_19])]) ).
cnf(c_0_24,hypothesis,
( aElement0(szmzizndt0(sdtlpdtrp0(xN,xi)))
| ~ aSet0(sdtlpdtrp0(xN,xi)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,hypothesis,
~ aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xQ)
| ~ isFinite0(xQ)
| ~ aSet0(sdtlpdtrp0(xN,xi)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X2] :
( ( ~ aElementOf0(sbrdtbr0(X2),szNzAzT0)
| isFinite0(X2)
| ~ aSet0(X2) )
& ( ~ isFinite0(X2)
| aElementOf0(sbrdtbr0(X2),szNzAzT0)
| ~ aSet0(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])]) ).
cnf(c_0_28,hypothesis,
( ~ isFinite0(xQ)
| ~ aSet0(sdtlpdtrp0(xN,xi)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( isFinite0(X1)
| ~ aSet0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
fof(c_0_31,hypothesis,
! [X3,X4] :
( ( aSet0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) )
& ( ~ aElementOf0(X4,sdtlpdtrp0(xN,X3))
| aElementOf0(X4,szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( aSubsetOf0(sdtlpdtrp0(xN,X3),szNzAzT0)
| ~ aElementOf0(X3,szNzAzT0) )
& ( isCountable0(sdtlpdtrp0(xN,X3))
| ~ aElementOf0(X3,szNzAzT0) ) ),
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)],[m__3671])])])])])]) ).
cnf(c_0_32,hypothesis,
~ aSet0(sdtlpdtrp0(xN,xi)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]),c_0_30]),c_0_19])]) ).
cnf(c_0_33,hypothesis,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_34,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3989]) ).
cnf(c_0_35,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM580+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jul 6 15:30:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.28/5.46 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.28/5.46 # Preprocessing time : 0.265 s
% 0.28/5.46
% 0.28/5.46 # Proof found!
% 0.28/5.46 # SZS status Theorem
% 0.28/5.46 # SZS output start CNFRefutation
% See solution above
% 0.28/5.46 # Proof object total steps : 36
% 0.28/5.46 # Proof object clause steps : 21
% 0.28/5.46 # Proof object formula steps : 15
% 0.28/5.46 # Proof object conjectures : 5
% 0.28/5.46 # Proof object clause conjectures : 2
% 0.28/5.46 # Proof object formula conjectures : 3
% 0.28/5.46 # Proof object initial clauses used : 13
% 0.28/5.46 # Proof object initial formulas used : 8
% 0.28/5.46 # Proof object generating inferences : 8
% 0.28/5.46 # Proof object simplifying inferences : 10
% 0.28/5.46 # Training examples: 0 positive, 0 negative
% 0.28/5.46 # Parsed axioms : 87
% 0.28/5.46 # Removed by relevancy pruning/SinE : 0
% 0.28/5.46 # Initial clauses : 4207
% 0.28/5.46 # Removed in clause preprocessing : 7
% 0.28/5.46 # Initial clauses in saturation : 4200
% 0.28/5.46 # Processed clauses : 4296
% 0.28/5.46 # ...of these trivial : 4
% 0.28/5.46 # ...subsumed : 51
% 0.28/5.46 # ...remaining for further processing : 4241
% 0.28/5.46 # Other redundant clauses eliminated : 4251
% 0.28/5.46 # Clauses deleted for lack of memory : 0
% 0.28/5.46 # Backward-subsumed : 3
% 0.28/5.46 # Backward-rewritten : 0
% 0.28/5.46 # Generated clauses : 43123
% 0.28/5.46 # ...of the previous two non-trivial : 34700
% 0.28/5.46 # Contextual simplify-reflections : 107
% 0.28/5.46 # Paramodulations : 38679
% 0.28/5.46 # Factorizations : 0
% 0.28/5.46 # Equation resolutions : 4444
% 0.28/5.46 # Current number of processed clauses : 4235
% 0.28/5.46 # Positive orientable unit clauses : 44
% 0.28/5.46 # Positive unorientable unit clauses: 0
% 0.28/5.46 # Negative unit clauses : 20
% 0.28/5.46 # Non-unit-clauses : 4171
% 0.28/5.46 # Current number of unprocessed clauses: 34585
% 0.28/5.46 # ...number of literals in the above : 595696
% 0.28/5.46 # Current number of archived formulas : 0
% 0.28/5.46 # Current number of archived clauses : 3
% 0.28/5.46 # Clause-clause subsumption calls (NU) : 6325556
% 0.28/5.46 # Rec. Clause-clause subsumption calls : 49457
% 0.28/5.46 # Non-unit clause-clause subsumptions : 137
% 0.28/5.46 # Unit Clause-clause subsumption calls : 82089
% 0.28/5.46 # Rewrite failures with RHS unbound : 0
% 0.28/5.46 # BW rewrite match attempts : 0
% 0.28/5.46 # BW rewrite match successes : 0
% 0.28/5.46 # Condensation attempts : 0
% 0.28/5.46 # Condensation successes : 0
% 0.28/5.46 # Termbank termtop insertions : 2650913
% 0.28/5.46
% 0.28/5.46 # -------------------------------------------------
% 0.28/5.46 # User time : 4.536 s
% 0.28/5.46 # System time : 0.045 s
% 0.28/5.46 # Total time : 4.581 s
% 0.28/5.46 # Maximum resident set size: 69924 pages
% 0.28/23.42 eprover: CPU time limit exceeded, terminating
% 0.28/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.44 eprover: No such file or directory
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.45 eprover: CPU time limit exceeded, terminating
% 0.28/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.45 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.46 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.51 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.51 eprover: No such file or directory
% 0.28/23.52 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------