details

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

run statistics

property	value
solver	muterm 5.18
configuration	default
runtime (wallclock)	0.0539197921753 seconds
cpu usage	0.042553401
max memory	4075520.0

stage attributes

key	value
output-size	9258
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X XS Y YS ZS) (RULES U11(tt,N,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) activate(n__natsFrom(X)) -> natsFrom(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt,X) -> activate(X) fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,n__natsFrom(n__s(N))) natsFrom(X) -> n__natsFrom(X) s(X) -> n__s(X) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,activate(XS)) splitAt(0,XS) -> pair(nil,XS) tail(cons(N,XS)) -> activate(XS) take(N,XS) -> fst(splitAt(N,XS)) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,N,X,XS) -> U12#(splitAt(activate(N),activate(XS)),activate(X)) U11#(tt,N,X,XS) -> ACTIVATE(N) U11#(tt,N,X,XS) -> ACTIVATE(X) U11#(tt,N,X,XS) -> ACTIVATE(XS) U11#(tt,N,X,XS) -> SPLITAT(activate(N),activate(XS)) U12#(pair(YS,ZS),X) -> ACTIVATE(X) ACTIVATE(n__natsFrom(X)) -> ACTIVATE(X) ACTIVATE(n__natsFrom(X)) -> NATSFROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) AFTERNTH(N,XS) -> SND(splitAt(N,XS)) AFTERNTH(N,XS) -> SPLITAT(N,XS) AND(tt,X) -> ACTIVATE(X) SEL(N,XS) -> AFTERNTH(N,XS) SEL(N,XS) -> HEAD(afterNth(N,XS)) SPLITAT(s(N),cons(X,XS)) -> U11#(tt,N,X,activate(XS)) SPLITAT(s(N),cons(X,XS)) -> ACTIVATE(XS) TAIL(cons(N,XS)) -> ACTIVATE(XS) TAKE(N,XS) -> FST(splitAt(N,XS)) TAKE(N,XS) -> SPLITAT(N,XS) -> Rules: U11(tt,N,X,XS) -> U12(splitAt(activate(N),activate(XS)),activate(X)) U12(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS) activate(n__natsFrom(X)) -> natsFrom(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt,X) -> activate(X) fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,n__natsFrom(n__s(N))) natsFrom(X) -> n__natsFrom(X) s(X) -> n__s(X) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,activate(XS)) splitAt(0,XS) -> pair(nil,XS) tail(cons(N,XS)) -> activate(XS) take(N,XS) -> fst(splitAt(N,XS)) Problem 1: SCC Processor: -> Pairs: U11#(tt,N,X,XS) -> U12#(splitAt(activate(N),activate(XS)),activate(X)) U11#(tt,N,X,XS) -> ACTIVATE(N) U11#(tt,N,X,XS) -> ACTIVATE(X) U11#(tt,N,X,XS) -> ACTIVATE(XS) U11#(tt,N,X,XS) -> SPLITAT(activate(N),activate(XS)) U12#(pair(YS,ZS),X) -> ACTIVATE(X) ACTIVATE(n__natsFrom(X)) -> ACTIVATE(X) ACTIVATE(n__natsFrom(X)) -> NATSFROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) AFTERNTH(N,XS) -> SND(splitAt(N,XS)) AFTERNTH(N,XS) -> SPLITAT(N,XS) AND(tt,X) -> ACTIVATE(X) SEL(N,XS) -> AFTERNTH(N,XS) SEL(N,XS) -> HEAD(afterNth(N,XS)) SPLITAT(s(N),cons(X,XS)) -> U11#(tt,N,X,activate(XS)) SPLITAT(s(N),cons(X,XS)) -> ACTIVATE(XS) TAIL(cons(N,XS)) -> ACTIVATE(XS) TAKE(N,XS) -> FST(splitAt(N,XS)) TAKE(N,XS) -> SPLITAT(N,XS) popout

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

job log

popout

actions

all output return to TRS Stand 20472