details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	12.7483 seconds
cpu usage	12.6454
user time	12.2078
system time	0.437682
max virtual memory	794064.0
max residence set size	82968.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(x:S,y:S) -> B(0,c(y:S)) A(x:S,y:S) -> B(x:S,b(0,c(y:S))) A(x:S,y:S) -> C(y:S) C(b(y:S,c(x:S))) -> A(0,0) C(b(y:S,c(x:S))) -> B(a(0,0),y:S) C(b(y:S,c(x:S))) -> C(b(a(0,0),y:S)) C(b(y:S,c(x:S))) -> C(c(b(a(0,0),y:S))) -> Rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) Problem 1: SCC Processor: -> Pairs: A(x:S,y:S) -> B(0,c(y:S)) A(x:S,y:S) -> B(x:S,b(0,c(y:S))) A(x:S,y:S) -> C(y:S) C(b(y:S,c(x:S))) -> A(0,0) C(b(y:S,c(x:S))) -> B(a(0,0),y:S) C(b(y:S,c(x:S))) -> C(b(a(0,0),y:S)) C(b(y:S,c(x:S))) -> C(c(b(a(0,0),y:S))) -> Rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(x:S,y:S) -> C(y:S) C(b(y:S,c(x:S))) -> A(0,0) C(b(y:S,c(x:S))) -> C(b(a(0,0),y:S)) C(b(y:S,c(x:S))) -> C(c(b(a(0,0),y:S))) ->->-> Rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) Problem 1: Reduction Pair Processor: -> Pairs: A(x:S,y:S) -> C(y:S) C(b(y:S,c(x:S))) -> A(0,0) C(b(y:S,c(x:S))) -> C(b(a(0,0),y:S)) C(b(y:S,c(x:S))) -> C(c(b(a(0,0),y:S))) -> Rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) -> Usable rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a](X1,X2) = 2.X1 + 2 [b](X1,X2) = X1 + X2 [c](X) = 2 [0] = 0 [A](X1,X2) = 2.X1 + 2.X2 + 2 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: C(b(y:S,c(x:S))) -> A(0,0) C(b(y:S,c(x:S))) -> C(b(a(0,0),y:S)) C(b(y:S,c(x:S))) -> C(c(b(a(0,0),y:S))) -> Rules: a(x:S,y:S) -> b(x:S,b(0,c(y:S))) b(y:S,0) -> y:S c(b(y:S,c(x:S))) -> c(c(b(a(0,0),y:S))) ->Strongly Connected Components: ->->Cycle: popout

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

job log

popout

actions

all output return to TRS Standard