Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093338
details
property
value
status
complete
benchmark
ExIntrod_GM01_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
2.12357 seconds
cpu usage
2.11198
user time
1.99796
system time
0.114019
max virtual memory
726000.0
max residence set size
22496.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S L:S X:S X1:S X2:S) (RULES active(adx(cons(X:S,L:S))) -> mark(incr(cons(X:S,adx(L:S)))) active(adx(nil)) -> mark(nil) active(adx(X:S)) -> adx(active(X:S)) active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(head(cons(X:S,L:S))) -> mark(X:S) active(head(X:S)) -> head(active(X:S)) active(incr(cons(X:S,L:S))) -> mark(cons(s(X:S),incr(L:S))) active(incr(nil)) -> mark(nil) active(incr(X:S)) -> incr(active(X:S)) active(s(X:S)) -> s(active(X:S)) active(tail(cons(X:S,L:S))) -> mark(L:S) active(tail(X:S)) -> tail(active(X:S)) active(nats) -> mark(adx(zeros)) active(zeros) -> mark(cons(0,zeros)) adx(mark(X:S)) -> mark(adx(X:S)) adx(ok(X:S)) -> ok(adx(X:S)) 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)) head(mark(X:S)) -> mark(head(X:S)) head(ok(X:S)) -> ok(head(X:S)) incr(mark(X:S)) -> mark(incr(X:S)) incr(ok(X:S)) -> ok(incr(X:S)) proper(adx(X:S)) -> adx(proper(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(head(X:S)) -> head(proper(X:S)) proper(incr(X:S)) -> incr(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(tail(X:S)) -> tail(proper(X:S)) proper(0) -> ok(0) proper(nats) -> ok(nats) proper(nil) -> ok(nil) proper(zeros) -> ok(zeros) 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)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(adx(cons(X:S,L:S))) -> ADX(L:S) ACTIVE(adx(cons(X:S,L:S))) -> CONS(X:S,adx(L:S)) ACTIVE(adx(cons(X:S,L:S))) -> INCR(cons(X:S,adx(L:S))) ACTIVE(adx(X:S)) -> ACTIVE(X:S) ACTIVE(adx(X:S)) -> ADX(active(X:S)) ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(head(X:S)) -> ACTIVE(X:S) ACTIVE(head(X:S)) -> HEAD(active(X:S)) ACTIVE(incr(cons(X:S,L:S))) -> CONS(s(X:S),incr(L:S)) ACTIVE(incr(cons(X:S,L:S))) -> INCR(L:S) ACTIVE(incr(cons(X:S,L:S))) -> S(X:S) ACTIVE(incr(X:S)) -> ACTIVE(X:S) ACTIVE(incr(X:S)) -> INCR(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)) ADX(mark(X:S)) -> ADX(X:S) ADX(ok(X:S)) -> ADX(X:S) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) HEAD(mark(X:S)) -> HEAD(X:S) HEAD(ok(X:S)) -> HEAD(X:S) INCR(mark(X:S)) -> INCR(X:S) INCR(ok(X:S)) -> INCR(X:S) PROPER(adx(X:S)) -> ADX(proper(X:S)) PROPER(adx(X:S)) -> PROPER(X:S) PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(head(X:S)) -> HEAD(proper(X:S)) PROPER(head(X:S)) -> PROPER(X:S) PROPER(incr(X:S)) -> INCR(proper(X:S)) PROPER(incr(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) PROPER(tail(X:S)) -> PROPER(X:S) PROPER(tail(X:S)) -> TAIL(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TAIL(mark(X:S)) -> TAIL(X:S) TAIL(ok(X:S)) -> TAIL(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(adx(cons(X:S,L:S))) -> mark(incr(cons(X:S,adx(L:S))))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost