details

property	value
status	complete
benchmark	ExSec4_2_DLMMU04.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n008.star.cs.uiowa.edu
space	CSR_04

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0212659835815 seconds
cpu usage	0.017904602
max memory	1859584.0

stage attributes

key	value
output-size	4636
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X XS YS ZS) (STRATEGY CONTEXTSENSITIVE (afterNth 1 2) (fst 1) (head 1) (natsFrom 1) (sel 1 2) (snd 1) (splitAt 1 2) (tail 1) (take 1 2) (u 1) (0) (cons 1) (nil) (pair 1 2) (s 1) ) (RULES afterNth(N,XS) -> snd(splitAt(N,XS)) fst(pair(XS,YS)) -> XS head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(XS,YS)) -> YS splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> u(splitAt(N,XS),N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) u(pair(YS,ZS),N,X,XS) -> pair(cons(X,YS),ZS) ) Problem 1: Innermost Equivalent Processor: -> Rules: afterNth(N,XS) -> snd(splitAt(N,XS)) fst(pair(XS,YS)) -> XS head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(XS,YS)) -> YS splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> u(splitAt(N,XS),N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) u(pair(YS,ZS),N,X,XS) -> pair(cons(X,YS),ZS) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: AFTERNTH(N,XS) -> SND(splitAt(N,XS)) AFTERNTH(N,XS) -> SPLITAT(N,XS) SEL(N,XS) -> AFTERNTH(N,XS) SEL(N,XS) -> HEAD(afterNth(N,XS)) SPLITAT(s(N),cons(X,XS)) -> SPLITAT(N,XS) SPLITAT(s(N),cons(X,XS)) -> U(splitAt(N,XS),N,X,XS) SPLITAT(s(N),cons(X,XS)) -> XS TAIL(cons(N,XS)) -> XS TAKE(N,XS) -> FST(splitAt(N,XS)) TAKE(N,XS) -> SPLITAT(N,XS) U(pair(YS,ZS),N,X,XS) -> X -> Rules: afterNth(N,XS) -> snd(splitAt(N,XS)) fst(pair(XS,YS)) -> XS head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(XS,YS)) -> YS splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> u(splitAt(N,XS),N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) u(pair(YS,ZS),N,X,XS) -> pair(cons(X,YS),ZS) -> Unhiding Rules: natsFrom(s(N)) -> NATSFROM(s(N)) Problem 1: SCC Processor: -> Pairs: AFTERNTH(N,XS) -> SND(splitAt(N,XS)) AFTERNTH(N,XS) -> SPLITAT(N,XS) SEL(N,XS) -> AFTERNTH(N,XS) SEL(N,XS) -> HEAD(afterNth(N,XS)) SPLITAT(s(N),cons(X,XS)) -> SPLITAT(N,XS) SPLITAT(s(N),cons(X,XS)) -> U(splitAt(N,XS),N,X,XS) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Conte Sensi 17651