details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.11630320549 seconds
cpu usage	0.04837874
max memory	3923968.0

stage attributes

key	value
output-size	7141
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 v_NonEmpty:S N:S X:S XS:S Y:S YS:S ZS:S) (RULES U11(tt,N:S,X:S,XS:S) -> U12(splitAt(activate(N:S),activate(XS:S)),activate(X:S)) U12(pair(YS:S,ZS:S),X:S) -> pair(cons(activate(X:S),YS:S),ZS:S) activate(n__natsFrom(X:S)) -> natsFrom(X:S) activate(X:S) -> X:S afterNth(N:S,XS:S) -> snd(splitAt(N:S,XS:S)) and(tt,X:S) -> activate(X:S) fst(pair(X:S,Y:S)) -> X:S head(cons(N:S,XS:S)) -> N:S natsFrom(N:S) -> cons(N:S,n__natsFrom(s(N:S))) natsFrom(X:S) -> n__natsFrom(X:S) sel(N:S,XS:S) -> head(afterNth(N:S,XS:S)) snd(pair(X:S,Y:S)) -> Y:S splitAt(0,XS:S) -> pair(nil,XS:S) splitAt(s(N:S),cons(X:S,XS:S)) -> U11(tt,N:S,X:S,activate(XS:S)) tail(cons(N:S,XS:S)) -> activate(XS:S) take(N:S,XS:S) -> fst(splitAt(N:S,XS:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,N:S,X:S,XS:S) -> U12#(splitAt(activate(N:S),activate(XS:S)),activate(X:S)) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(N:S) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(X:S) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(XS:S) U11#(tt,N:S,X:S,XS:S) -> SPLITAT(activate(N:S),activate(XS:S)) U12#(pair(YS:S,ZS:S),X:S) -> ACTIVATE(X:S) ACTIVATE(n__natsFrom(X:S)) -> NATSFROM(X:S) AFTERNTH(N:S,XS:S) -> SND(splitAt(N:S,XS:S)) AFTERNTH(N:S,XS:S) -> SPLITAT(N:S,XS:S) AND(tt,X:S) -> ACTIVATE(X:S) SEL(N:S,XS:S) -> AFTERNTH(N:S,XS:S) SEL(N:S,XS:S) -> HEAD(afterNth(N:S,XS:S)) SPLITAT(s(N:S),cons(X:S,XS:S)) -> U11#(tt,N:S,X:S,activate(XS:S)) SPLITAT(s(N:S),cons(X:S,XS:S)) -> ACTIVATE(XS:S) TAIL(cons(N:S,XS:S)) -> ACTIVATE(XS:S) TAKE(N:S,XS:S) -> FST(splitAt(N:S,XS:S)) TAKE(N:S,XS:S) -> SPLITAT(N:S,XS:S) -> Rules: U11(tt,N:S,X:S,XS:S) -> U12(splitAt(activate(N:S),activate(XS:S)),activate(X:S)) U12(pair(YS:S,ZS:S),X:S) -> pair(cons(activate(X:S),YS:S),ZS:S) activate(n__natsFrom(X:S)) -> natsFrom(X:S) activate(X:S) -> X:S afterNth(N:S,XS:S) -> snd(splitAt(N:S,XS:S)) and(tt,X:S) -> activate(X:S) fst(pair(X:S,Y:S)) -> X:S head(cons(N:S,XS:S)) -> N:S natsFrom(N:S) -> cons(N:S,n__natsFrom(s(N:S))) natsFrom(X:S) -> n__natsFrom(X:S) sel(N:S,XS:S) -> head(afterNth(N:S,XS:S)) snd(pair(X:S,Y:S)) -> Y:S splitAt(0,XS:S) -> pair(nil,XS:S) splitAt(s(N:S),cons(X:S,XS:S)) -> U11(tt,N:S,X:S,activate(XS:S)) tail(cons(N:S,XS:S)) -> activate(XS:S) take(N:S,XS:S) -> fst(splitAt(N:S,XS:S)) Problem 1: SCC Processor: -> Pairs: U11#(tt,N:S,X:S,XS:S) -> U12#(splitAt(activate(N:S),activate(XS:S)),activate(X:S)) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(N:S) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(X:S) U11#(tt,N:S,X:S,XS:S) -> ACTIVATE(XS:S) U11#(tt,N:S,X:S,XS:S) -> SPLITAT(activate(N:S),activate(XS:S)) U12#(pair(YS:S,ZS:S),X:S) -> ACTIVATE(X:S) ACTIVATE(n__natsFrom(X:S)) -> NATSFROM(X:S) AFTERNTH(N:S,XS:S) -> SND(splitAt(N:S,XS:S)) AFTERNTH(N:S,XS:S) -> SPLITAT(N:S,XS:S) AND(tt,X:S) -> ACTIVATE(X:S) SEL(N:S,XS:S) -> AFTERNTH(N:S,XS:S) SEL(N:S,XS:S) -> HEAD(afterNth(N:S,XS:S)) SPLITAT(s(N:S),cons(X:S,XS:S)) -> U11#(tt,N:S,X:S,activate(XS:S)) SPLITAT(s(N:S),cons(X:S,XS:S)) -> ACTIVATE(XS:S) TAIL(cons(N:S,XS:S)) -> ACTIVATE(XS:S) TAKE(N:S,XS:S) -> FST(splitAt(N:S,XS:S)) TAKE(N:S,XS:S) -> SPLITAT(N:S,XS:S) -> Rules: U11(tt,N:S,X:S,XS:S) -> U12(splitAt(activate(N:S),activate(XS:S)),activate(X:S)) U12(pair(YS:S,ZS:S),X:S) -> pair(cons(activate(X:S),YS:S),ZS:S) activate(n__natsFrom(X:S)) -> natsFrom(X:S) activate(X:S) -> X:S afterNth(N:S,XS:S) -> snd(splitAt(N:S,XS:S)) and(tt,X:S) -> activate(X:S) fst(pair(X:S,Y:S)) -> X:S head(cons(N:S,XS:S)) -> N:S natsFrom(N:S) -> cons(N:S,n__natsFrom(s(N:S))) popout

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

job log

popout

actions

all output return to TRS Standard