Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Conte Sensi 17651 pair #381733364
details
property
value
status
complete
benchmark
LISTUTILITIES_nosorts.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
Maude_06
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0210859775543 seconds
cpu usage
0.018519552
max memory
1961984.0
stage attributes
key
value
output-size
5188
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 Y YS ZS) (STRATEGY CONTEXTSENSITIVE (U11 1) (U12 1) (afterNth 1 2) (and 1) (fst 1) (head 1) (natsFrom 1) (sel 1 2) (snd 1) (splitAt 1 2) (tail 1) (take 1 2) (0) (cons 1) (nil) (pair 1 2) (s 1) (tt) ) (RULES U11(tt,N,X,XS) -> U12(splitAt(N,XS),X) U12(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt,X) -> X fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) ) Problem 1: Innermost Equivalent Processor: -> Rules: U11(tt,N,X,XS) -> U12(splitAt(N,XS),X) U12(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt,X) -> X fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) -> The context-sensitive term rewriting system is an orthogonal system. Therefore, innermost cs-termination implies cs-termination. Problem 1: Dependency Pairs Processor: -> Pairs: U11#(tt,N,X,XS) -> U12#(splitAt(N,XS),X) U11#(tt,N,X,XS) -> SPLITAT(N,XS) U11#(tt,N,X,XS) -> N U11#(tt,N,X,XS) -> XS U12#(pair(YS,ZS),X) -> X AFTERNTH(N,XS) -> SND(splitAt(N,XS)) AFTERNTH(N,XS) -> SPLITAT(N,XS) AND(tt,X) -> X SEL(N,XS) -> AFTERNTH(N,XS) SEL(N,XS) -> HEAD(afterNth(N,XS)) SPLITAT(s(N),cons(X,XS)) -> U11#(tt,N,X,XS) TAIL(cons(N,XS)) -> XS TAKE(N,XS) -> FST(splitAt(N,XS)) TAKE(N,XS) -> SPLITAT(N,XS) -> Rules: U11(tt,N,X,XS) -> U12(splitAt(N,XS),X) U12(pair(YS,ZS),X) -> pair(cons(X,YS),ZS) afterNth(N,XS) -> snd(splitAt(N,XS)) and(tt,X) -> X fst(pair(X,Y)) -> X head(cons(N,XS)) -> N natsFrom(N) -> cons(N,natsFrom(s(N))) sel(N,XS) -> head(afterNth(N,XS)) snd(pair(X,Y)) -> Y splitAt(0,XS) -> pair(nil,XS) splitAt(s(N),cons(X,XS)) -> U11(tt,N,X,XS) tail(cons(N,XS)) -> XS take(N,XS) -> fst(splitAt(N,XS)) -> Unhiding Rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Conte Sensi 17651