details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	2.21349 seconds
cpu usage	2.11926
user time	1.36922
system time	0.750039
max virtual memory	705996.0
max residence set size	6696.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(a(d(d(x1:S)))) -> B(b(x1:S)) A(a(d(d(x1:S)))) -> B(x1:S) A(a(x1:S)) -> B(b(b(b(b(b(x1:S)))))) A(a(x1:S)) -> B(b(b(b(b(x1:S))))) A(a(x1:S)) -> B(b(b(b(x1:S)))) A(a(x1:S)) -> B(b(b(x1:S))) A(a(x1:S)) -> B(b(x1:S)) A(a(x1:S)) -> B(x1:S) B(b(d(d(b(b(x1:S)))))) -> A(a(c(c(x1:S)))) B(b(d(d(b(b(x1:S)))))) -> A(c(c(x1:S))) B(b(d(d(b(b(x1:S)))))) -> C(c(x1:S)) B(b(d(d(b(b(x1:S)))))) -> C(x1:S) -> Rules: a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) Problem 1: SCC Processor: -> Pairs: A(a(d(d(x1:S)))) -> B(b(x1:S)) A(a(d(d(x1:S)))) -> B(x1:S) A(a(x1:S)) -> B(b(b(b(b(b(x1:S)))))) A(a(x1:S)) -> B(b(b(b(b(x1:S))))) A(a(x1:S)) -> B(b(b(b(x1:S)))) A(a(x1:S)) -> B(b(b(x1:S))) A(a(x1:S)) -> B(b(x1:S)) A(a(x1:S)) -> B(x1:S) B(b(d(d(b(b(x1:S)))))) -> A(a(c(c(x1:S)))) B(b(d(d(b(b(x1:S)))))) -> A(c(c(x1:S))) B(b(d(d(b(b(x1:S)))))) -> C(c(x1:S)) B(b(d(d(b(b(x1:S)))))) -> C(x1:S) -> Rules: a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(a(d(d(x1:S)))) -> B(b(x1:S)) A(a(d(d(x1:S)))) -> B(x1:S) A(a(x1:S)) -> B(b(b(b(b(b(x1:S)))))) A(a(x1:S)) -> B(b(b(b(b(x1:S))))) A(a(x1:S)) -> B(b(b(b(x1:S)))) A(a(x1:S)) -> B(b(b(x1:S))) A(a(x1:S)) -> B(b(x1:S)) A(a(x1:S)) -> B(x1:S) B(b(d(d(b(b(x1:S)))))) -> A(a(c(c(x1:S)))) B(b(d(d(b(b(x1:S)))))) -> A(c(c(x1:S))) ->->-> Rules: a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: A(a(d(d(x1:S)))) -> B(b(x1:S)) A(a(d(d(x1:S)))) -> B(x1:S) A(a(x1:S)) -> B(b(b(b(b(b(x1:S)))))) A(a(x1:S)) -> B(b(b(b(b(x1:S))))) A(a(x1:S)) -> B(b(b(b(x1:S)))) A(a(x1:S)) -> B(b(b(x1:S))) A(a(x1:S)) -> B(b(x1:S)) A(a(x1:S)) -> B(x1:S) B(b(d(d(b(b(x1:S)))))) -> A(a(c(c(x1:S)))) B(b(d(d(b(b(x1:S)))))) -> A(c(c(x1:S))) -> Rules: a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) -> Usable rules: a(a(d(d(x1:S)))) -> d(d(b(b(x1:S)))) a(a(x1:S)) -> b(b(b(b(b(b(x1:S)))))) b(b(d(d(b(b(x1:S)))))) -> a(a(c(c(x1:S)))) c(c(x1:S)) -> d(d(x1:S)) ->Interpretation type: Linear popout

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

job log

popout

actions

all output return to SRS Standard