TSTP Solution File: NUM517+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM517+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:33:19 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 183 ( 40 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 231 ( 93 ~; 99 |; 27 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 41 ( 1 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__1799,hypothesis,
! [X1,X2,X3] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2)
& aNaturalNumber0(X3) )
=> ( ( isPrime0(X3)
& doDivides0(X3,sdtasdt0(X1,X2)) )
=> ( iLess0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
=> ( doDivides0(X3,X1)
| doDivides0(X3,X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1799) ).
fof(mIH_03,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != X2
& sdtlseqdt0(X1,X2) )
=> iLess0(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mIH_03) ).
fof(m__,conjecture,
( doDivides0(xp,sdtsldt0(xn,xr))
| doDivides0(xp,xm) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).
fof(m__2686,hypothesis,
( sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp)
& sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2686) ).
fof(m__1860,hypothesis,
( isPrime0(xp)
& doDivides0(xp,sdtasdt0(xn,xm)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1860) ).
fof(m__2529,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2529) ).
fof(m__1837,hypothesis,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xp) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1837) ).
fof(mSortsB,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> aNaturalNumber0(sdtpldt0(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsB) ).
fof(mDefQuot,axiom,
! [X1,X2] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X2) )
=> ( ( X1 != sz00
& doDivides0(X1,X2) )
=> ! [X3] :
( X3 = sdtsldt0(X2,X1)
<=> ( aNaturalNumber0(X3)
& X2 = sdtasdt0(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefQuot) ).
fof(mDefPrime,axiom,
! [X1] :
( aNaturalNumber0(X1)
=> ( isPrime0(X1)
<=> ( X1 != sz00
& X1 != sz10
& ! [X2] :
( ( aNaturalNumber0(X2)
& doDivides0(X2,X1) )
=> ( X2 = sz10
| X2 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mDefPrime) ).
fof(m__2342,hypothesis,
( aNaturalNumber0(xr)
& doDivides0(xr,xk)
& isPrime0(xr) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2342) ).
fof(m__2487,hypothesis,
doDivides0(xr,xn),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2487) ).
fof(c_0_12,hypothesis,
! [X4,X5,X6] :
( ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5)
| ~ aNaturalNumber0(X6)
| ~ isPrime0(X6)
| ~ doDivides0(X6,sdtasdt0(X4,X5))
| ~ iLess0(sdtpldt0(sdtpldt0(X4,X5),X6),sdtpldt0(sdtpldt0(xn,xm),xp))
| doDivides0(X6,X4)
| doDivides0(X6,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__1799])]) ).
fof(c_0_13,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| X3 = X4
| ~ sdtlseqdt0(X3,X4)
| iLess0(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mIH_03])]) ).
fof(c_0_14,negated_conjecture,
~ ( doDivides0(xp,sdtsldt0(xn,xr))
| doDivides0(xp,xm) ),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,hypothesis,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ iLess0(sdtpldt0(sdtpldt0(X3,X2),X1),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ doDivides0(X1,sdtasdt0(X3,X2))
| ~ isPrime0(X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( iLess0(X1,X2)
| X1 = X2
| ~ sdtlseqdt0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
( ~ doDivides0(xp,sdtsldt0(xn,xr))
& ~ doDivides0(xp,xm) ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_18,hypothesis,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(sdtpldt0(xn,xm),xp)
| doDivides0(X3,X1)
| doDivides0(X3,X2)
| ~ isPrime0(X3)
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ sdtlseqdt0(sdtpldt0(sdtpldt0(X1,X2),X3),sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(X1,X2),X3))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,hypothesis,
sdtlseqdt0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp),sdtpldt0(sdtpldt0(xn,xm),xp)),
inference(split_conjunct,[status(thm)],[m__2686]) ).
cnf(c_0_20,hypothesis,
isPrime0(xp),
inference(split_conjunct,[status(thm)],[m__1860]) ).
cnf(c_0_21,hypothesis,
doDivides0(xp,sdtasdt0(sdtsldt0(xn,xr),xm)),
inference(split_conjunct,[status(thm)],[m__2529]) ).
cnf(c_0_22,hypothesis,
aNaturalNumber0(xm),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_23,hypothesis,
aNaturalNumber0(xp),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_24,hypothesis,
sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp) != sdtpldt0(sdtpldt0(xn,xm),xp),
inference(split_conjunct,[status(thm)],[m__2686]) ).
cnf(c_0_25,negated_conjecture,
~ doDivides0(xp,sdtsldt0(xn,xr)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
~ doDivides0(xp,xm),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_27,plain,
! [X3,X4] :
( ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X4)
| aNaturalNumber0(sdtpldt0(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSortsB])]) ).
cnf(c_0_28,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(sdtsldt0(xn,xr),xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]),c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtpldt0(xn,xm),xp))
| ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_23])]) ).
cnf(c_0_31,hypothesis,
( ~ aNaturalNumber0(sdtpldt0(sdtsldt0(xn,xr),xm))
| ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_23])]) ).
fof(c_0_32,plain,
! [X4,X5,X6,X6] :
( ( aNaturalNumber0(X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( X5 = sdtasdt0(X4,X6)
| X6 != sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) )
& ( ~ aNaturalNumber0(X6)
| X5 != sdtasdt0(X4,X6)
| X6 = sdtsldt0(X5,X4)
| X4 = sz00
| ~ doDivides0(X4,X5)
| ~ aNaturalNumber0(X4)
| ~ aNaturalNumber0(X5) ) ),
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)],[mDefQuot])])])])])]) ).
fof(c_0_33,plain,
! [X3,X4] :
( ( X3 != sz00
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( X3 != sz10
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( ~ aNaturalNumber0(X4)
| ~ doDivides0(X4,X3)
| X4 = sz10
| X4 = X3
| ~ isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( aNaturalNumber0(esk3_1(X3))
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( doDivides0(esk3_1(X3),X3)
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( esk3_1(X3) != sz10
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) )
& ( esk3_1(X3) != X3
| X3 = sz00
| X3 = sz10
| isPrime0(X3)
| ~ aNaturalNumber0(X3) ) ),
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)],[mDefPrime])])])])])])]) ).
cnf(c_0_34,hypothesis,
( ~ aNaturalNumber0(sdtsldt0(xn,xr))
| ~ aNaturalNumber0(sdtpldt0(xn,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_22])]) ).
cnf(c_0_35,hypothesis,
aNaturalNumber0(xn),
inference(split_conjunct,[status(thm)],[m__1837]) ).
cnf(c_0_36,plain,
( X2 = sz00
| aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X2,X1)
| X3 != sdtsldt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( ~ aNaturalNumber0(X1)
| ~ isPrime0(X1)
| X1 != sz00 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,hypothesis,
isPrime0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_39,hypothesis,
aNaturalNumber0(xr),
inference(split_conjunct,[status(thm)],[m__2342]) ).
cnf(c_0_40,hypothesis,
~ aNaturalNumber0(sdtsldt0(xn,xr)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_29]),c_0_22]),c_0_35])]) ).
cnf(c_0_41,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_42,hypothesis,
doDivides0(xr,xn),
inference(split_conjunct,[status(thm)],[m__2487]) ).
cnf(c_0_43,hypothesis,
sz00 != xr,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_39]),c_0_35])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM517+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n008.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 : Thu Jul 7 20:27:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.22/1.41 # Preprocessing time : 0.018 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 45
% 0.22/1.41 # Proof object clause steps : 26
% 0.22/1.41 # Proof object formula steps : 19
% 0.22/1.41 # Proof object conjectures : 5
% 0.22/1.41 # Proof object clause conjectures : 2
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 17
% 0.22/1.41 # Proof object initial formulas used : 12
% 0.22/1.41 # Proof object generating inferences : 9
% 0.22/1.41 # Proof object simplifying inferences : 24
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 56
% 0.22/1.41 # Removed by relevancy pruning/SinE : 0
% 0.22/1.41 # Initial clauses : 103
% 0.22/1.41 # Removed in clause preprocessing : 3
% 0.22/1.41 # Initial clauses in saturation : 100
% 0.22/1.41 # Processed clauses : 1572
% 0.22/1.41 # ...of these trivial : 18
% 0.22/1.41 # ...subsumed : 788
% 0.22/1.41 # ...remaining for further processing : 766
% 0.22/1.41 # Other redundant clauses eliminated : 70
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 46
% 0.22/1.41 # Backward-rewritten : 33
% 0.22/1.41 # Generated clauses : 20408
% 0.22/1.41 # ...of the previous two non-trivial : 19882
% 0.22/1.41 # Contextual simplify-reflections : 490
% 0.22/1.41 # Paramodulations : 20272
% 0.22/1.41 # Factorizations : 2
% 0.22/1.41 # Equation resolutions : 115
% 0.22/1.41 # Current number of processed clauses : 675
% 0.22/1.41 # Positive orientable unit clauses : 54
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 41
% 0.22/1.41 # Non-unit-clauses : 580
% 0.22/1.41 # Current number of unprocessed clauses: 18116
% 0.22/1.41 # ...number of literals in the above : 125046
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 85
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 96200
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 19954
% 0.22/1.41 # Non-unit clause-clause subsumptions : 905
% 0.22/1.41 # Unit Clause-clause subsumption calls : 3968
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 18
% 0.22/1.41 # BW rewrite match successes : 18
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 451742
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.340 s
% 0.22/1.41 # System time : 0.016 s
% 0.22/1.41 # Total time : 0.356 s
% 0.22/1.41 # Maximum resident set size: 22880 pages
% 0.22/23.40 eprover: CPU time limit exceeded, terminating
% 0.22/23.41 eprover: CPU time limit exceeded, terminating
% 0.22/23.41 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.41 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.42 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------