Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Innermost pair #487093138
details
property
value
status
complete
benchmark
Ex9_BLR02_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
Transformed_CSR_innermost_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.182478 seconds
cpu usage
0.190446
user time
0.140389
system time
0.050057
max virtual memory
113188.0
max residence set size
8908.0
stage attributes
key
value
starexec-result
YES
output
YES Problem 1: (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S X3:S Y:S) (RULES a__filter(cons(X:S,Y:S),0,M:S) -> cons(0,filter(Y:S,M:S,M:S)) a__filter(cons(X:S,Y:S),s(N:S),M:S) -> cons(mark(X:S),filter(Y:S,N:S,M:S)) a__filter(X1:S,X2:S,X3:S) -> filter(X1:S,X2:S,X3:S) a__nats(N:S) -> cons(mark(N:S),nats(s(N:S))) a__nats(X:S) -> nats(X:S) a__sieve(cons(0,Y:S)) -> cons(0,sieve(Y:S)) a__sieve(cons(s(N:S),Y:S)) -> cons(s(mark(N:S)),sieve(filter(Y:S,N:S,N:S))) a__sieve(X:S) -> sieve(X:S) a__zprimes -> a__sieve(a__nats(s(s(0)))) a__zprimes -> zprimes mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(filter(X1:S,X2:S,X3:S)) -> a__filter(mark(X1:S),mark(X2:S),mark(X3:S)) mark(nats(X:S)) -> a__nats(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(sieve(X:S)) -> a__sieve(mark(X:S)) mark(zprimes) -> a__zprimes ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__FILTER(cons(X:S,Y:S),s(N:S),M:S) -> MARK(X:S) A__NATS(N:S) -> MARK(N:S) A__SIEVE(cons(s(N:S),Y:S)) -> MARK(N:S) A__ZPRIMES -> A__NATS(s(s(0))) A__ZPRIMES -> A__SIEVE(a__nats(s(s(0)))) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(filter(X1:S,X2:S,X3:S)) -> A__FILTER(mark(X1:S),mark(X2:S),mark(X3:S)) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X2:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X3:S) MARK(nats(X:S)) -> A__NATS(mark(X:S)) MARK(nats(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) MARK(sieve(X:S)) -> A__SIEVE(mark(X:S)) MARK(sieve(X:S)) -> MARK(X:S) MARK(zprimes) -> A__ZPRIMES -> Rules: a__filter(cons(X:S,Y:S),0,M:S) -> cons(0,filter(Y:S,M:S,M:S)) a__filter(cons(X:S,Y:S),s(N:S),M:S) -> cons(mark(X:S),filter(Y:S,N:S,M:S)) a__filter(X1:S,X2:S,X3:S) -> filter(X1:S,X2:S,X3:S) a__nats(N:S) -> cons(mark(N:S),nats(s(N:S))) a__nats(X:S) -> nats(X:S) a__sieve(cons(0,Y:S)) -> cons(0,sieve(Y:S)) a__sieve(cons(s(N:S),Y:S)) -> cons(s(mark(N:S)),sieve(filter(Y:S,N:S,N:S))) a__sieve(X:S) -> sieve(X:S) a__zprimes -> a__sieve(a__nats(s(s(0)))) a__zprimes -> zprimes mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(filter(X1:S,X2:S,X3:S)) -> a__filter(mark(X1:S),mark(X2:S),mark(X3:S)) mark(nats(X:S)) -> a__nats(mark(X:S)) mark(s(X:S)) -> s(mark(X:S)) mark(sieve(X:S)) -> a__sieve(mark(X:S)) mark(zprimes) -> a__zprimes Problem 1: SCC Processor: -> Pairs: A__FILTER(cons(X:S,Y:S),s(N:S),M:S) -> MARK(X:S) A__NATS(N:S) -> MARK(N:S) A__SIEVE(cons(s(N:S),Y:S)) -> MARK(N:S) A__ZPRIMES -> A__NATS(s(s(0))) A__ZPRIMES -> A__SIEVE(a__nats(s(s(0)))) MARK(cons(X1:S,X2:S)) -> MARK(X1:S) MARK(filter(X1:S,X2:S,X3:S)) -> A__FILTER(mark(X1:S),mark(X2:S),mark(X3:S)) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X2:S) MARK(filter(X1:S,X2:S,X3:S)) -> MARK(X3:S) MARK(nats(X:S)) -> A__NATS(mark(X:S)) MARK(nats(X:S)) -> MARK(X:S) MARK(s(X:S)) -> MARK(X:S) MARK(sieve(X:S)) -> A__SIEVE(mark(X:S)) MARK(sieve(X:S)) -> MARK(X:S) MARK(zprimes) -> A__ZPRIMES -> Rules: a__filter(cons(X:S,Y:S),0,M:S) -> cons(0,filter(Y:S,M:S,M:S)) a__filter(cons(X:S,Y:S),s(N:S),M:S) -> cons(mark(X:S),filter(Y:S,N:S,M:S)) a__filter(X1:S,X2:S,X3:S) -> filter(X1:S,X2:S,X3:S) a__nats(N:S) -> cons(mark(N:S),nats(s(N:S))) a__nats(X:S) -> nats(X:S) a__sieve(cons(0,Y:S)) -> cons(0,sieve(Y:S)) a__sieve(cons(s(N:S),Y:S)) -> cons(s(mark(N:S)),sieve(filter(Y:S,N:S,N:S))) a__sieve(X:S) -> sieve(X:S) a__zprimes -> a__sieve(a__nats(s(s(0)))) a__zprimes -> zprimes mark(0) -> 0 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S) mark(filter(X1:S,X2:S,X3:S)) -> a__filter(mark(X1:S),mark(X2:S),mark(X3:S)) mark(nats(X:S)) -> a__nats(mark(X:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Innermost