Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093146
details
property
value
status
complete
benchmark
Ex5_DLMMU04_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
2.12568 seconds
cpu usage
2.11319
user time
1.98623
system time
0.12696
max virtual memory
730512.0
max residence set size
26720.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S N:S X:S X1:S X2:S XS:S Y:S YS:S) (RULES active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(incr(cons(X:S,XS:S))) -> mark(cons(s(X:S),incr(XS:S))) active(incr(X:S)) -> incr(active(X:S)) active(pair(X1:S,X2:S)) -> pair(active(X1:S),X2:S) active(pair(X1:S,X2:S)) -> pair(X1:S,active(X2:S)) active(repItems(cons(X:S,XS:S))) -> mark(cons(X:S,cons(X:S,repItems(XS:S)))) active(repItems(nil)) -> mark(nil) active(repItems(X:S)) -> repItems(active(X:S)) active(s(X:S)) -> s(active(X:S)) active(tail(cons(X:S,XS:S))) -> mark(XS:S) active(tail(X:S)) -> tail(active(X:S)) active(take(s(N:S),cons(X:S,XS:S))) -> mark(cons(X:S,take(N:S,XS:S))) active(take(0,XS:S)) -> mark(nil) active(take(X1:S,X2:S)) -> take(active(X1:S),X2:S) active(take(X1:S,X2:S)) -> take(X1:S,active(X2:S)) active(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> mark(cons(pair(X:S,Y:S),zip(XS:S,YS:S))) active(zip(nil,XS:S)) -> mark(nil) active(zip(X:S,nil)) -> mark(nil) active(zip(X1:S,X2:S)) -> zip(active(X1:S),X2:S) active(zip(X1:S,X2:S)) -> zip(X1:S,active(X2:S)) active(oddNs) -> mark(incr(pairNs)) active(pairNs) -> mark(cons(0,incr(oddNs))) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) incr(mark(X:S)) -> mark(incr(X:S)) incr(ok(X:S)) -> ok(incr(X:S)) pair(mark(X1:S),X2:S) -> mark(pair(X1:S,X2:S)) pair(ok(X1:S),ok(X2:S)) -> ok(pair(X1:S,X2:S)) pair(X1:S,mark(X2:S)) -> mark(pair(X1:S,X2:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(incr(X:S)) -> incr(proper(X:S)) proper(pair(X1:S,X2:S)) -> pair(proper(X1:S),proper(X2:S)) proper(repItems(X:S)) -> repItems(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(tail(X:S)) -> tail(proper(X:S)) proper(take(X1:S,X2:S)) -> take(proper(X1:S),proper(X2:S)) proper(zip(X1:S,X2:S)) -> zip(proper(X1:S),proper(X2:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) proper(oddNs) -> ok(oddNs) proper(pairNs) -> ok(pairNs) repItems(mark(X:S)) -> mark(repItems(X:S)) repItems(ok(X:S)) -> ok(repItems(X:S)) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) tail(mark(X:S)) -> mark(tail(X:S)) tail(ok(X:S)) -> ok(tail(X:S)) take(mark(X1:S),X2:S) -> mark(take(X1:S,X2:S)) take(ok(X1:S),ok(X2:S)) -> ok(take(X1:S,X2:S)) take(X1:S,mark(X2:S)) -> mark(take(X1:S,X2:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) zip(mark(X1:S),X2:S) -> mark(zip(X1:S,X2:S)) zip(ok(X1:S),ok(X2:S)) -> ok(zip(X1:S,X2:S)) zip(X1:S,mark(X2:S)) -> mark(zip(X1:S,X2:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(incr(cons(X:S,XS:S))) -> CONS(s(X:S),incr(XS:S)) ACTIVE(incr(cons(X:S,XS:S))) -> INCR(XS:S) ACTIVE(incr(cons(X:S,XS:S))) -> S(X:S) ACTIVE(incr(X:S)) -> ACTIVE(X:S) ACTIVE(incr(X:S)) -> INCR(active(X:S)) ACTIVE(pair(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(pair(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(pair(X1:S,X2:S)) -> PAIR(active(X1:S),X2:S) ACTIVE(pair(X1:S,X2:S)) -> PAIR(X1:S,active(X2:S)) ACTIVE(repItems(cons(X:S,XS:S))) -> CONS(X:S,cons(X:S,repItems(XS:S))) ACTIVE(repItems(cons(X:S,XS:S))) -> CONS(X:S,repItems(XS:S)) ACTIVE(repItems(cons(X:S,XS:S))) -> REPITEMS(XS:S) ACTIVE(repItems(X:S)) -> ACTIVE(X:S) ACTIVE(repItems(X:S)) -> REPITEMS(active(X:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) ACTIVE(tail(X:S)) -> ACTIVE(X:S) ACTIVE(tail(X:S)) -> TAIL(active(X:S)) ACTIVE(take(s(N:S),cons(X:S,XS:S))) -> CONS(X:S,take(N:S,XS:S)) ACTIVE(take(s(N:S),cons(X:S,XS:S))) -> TAKE(N:S,XS:S) ACTIVE(take(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(take(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(take(X1:S,X2:S)) -> TAKE(active(X1:S),X2:S) ACTIVE(take(X1:S,X2:S)) -> TAKE(X1:S,active(X2:S)) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> CONS(pair(X:S,Y:S),zip(XS:S,YS:S)) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> PAIR(X:S,Y:S) ACTIVE(zip(cons(X:S,XS:S),cons(Y:S,YS:S))) -> ZIP(XS:S,YS:S) ACTIVE(zip(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(zip(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(zip(X1:S,X2:S)) -> ZIP(active(X1:S),X2:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost