details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	7.7614 seconds
cpu usage	6.50897
user time	5.30553
system time	1.20344
max virtual memory	712124.0
max residence set size	10576.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S) (RULES a(b(x:S)) -> b(a(a(x:S))) a(u(x:S)) -> x:S b(c(x:S)) -> c(b(b(x:S))) b(v(x:S)) -> x:S c(a(x:S)) -> a(c(c(x:S))) c(w(x:S)) -> x:S u(a(x:S)) -> x:S v(b(x:S)) -> x:S w(c(x:S)) -> x:S ) Problem 1: Dependency Pairs Processor: -> Pairs: A(b(x:S)) -> A(a(x:S)) A(b(x:S)) -> A(x:S) A(b(x:S)) -> B(a(a(x:S))) B(c(x:S)) -> B(b(x:S)) B(c(x:S)) -> B(x:S) B(c(x:S)) -> C(b(b(x:S))) C(a(x:S)) -> A(c(c(x:S))) C(a(x:S)) -> C(c(x:S)) C(a(x:S)) -> C(x:S) -> Rules: a(b(x:S)) -> b(a(a(x:S))) a(u(x:S)) -> x:S b(c(x:S)) -> c(b(b(x:S))) b(v(x:S)) -> x:S c(a(x:S)) -> a(c(c(x:S))) c(w(x:S)) -> x:S u(a(x:S)) -> x:S v(b(x:S)) -> x:S w(c(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: A(b(x:S)) -> A(a(x:S)) A(b(x:S)) -> A(x:S) A(b(x:S)) -> B(a(a(x:S))) B(c(x:S)) -> B(b(x:S)) B(c(x:S)) -> B(x:S) B(c(x:S)) -> C(b(b(x:S))) C(a(x:S)) -> A(c(c(x:S))) C(a(x:S)) -> C(c(x:S)) C(a(x:S)) -> C(x:S) -> Rules: a(b(x:S)) -> b(a(a(x:S))) a(u(x:S)) -> x:S b(c(x:S)) -> c(b(b(x:S))) b(v(x:S)) -> x:S c(a(x:S)) -> a(c(c(x:S))) c(w(x:S)) -> x:S u(a(x:S)) -> x:S v(b(x:S)) -> x:S w(c(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(b(x:S)) -> A(a(x:S)) A(b(x:S)) -> A(x:S) A(b(x:S)) -> B(a(a(x:S))) B(c(x:S)) -> B(b(x:S)) B(c(x:S)) -> B(x:S) B(c(x:S)) -> C(b(b(x:S))) C(a(x:S)) -> A(c(c(x:S))) C(a(x:S)) -> C(c(x:S)) C(a(x:S)) -> C(x:S) ->->-> Rules: a(b(x:S)) -> b(a(a(x:S))) a(u(x:S)) -> x:S b(c(x:S)) -> c(b(b(x:S))) b(v(x:S)) -> x:S c(a(x:S)) -> a(c(c(x:S))) c(w(x:S)) -> x:S u(a(x:S)) -> x:S v(b(x:S)) -> x:S w(c(x:S)) -> x:S Problem 1: Reduction Pair Processor: -> Pairs: A(b(x:S)) -> A(a(x:S)) A(b(x:S)) -> A(x:S) A(b(x:S)) -> B(a(a(x:S))) B(c(x:S)) -> B(b(x:S)) B(c(x:S)) -> B(x:S) B(c(x:S)) -> C(b(b(x:S))) C(a(x:S)) -> A(c(c(x:S))) C(a(x:S)) -> C(c(x:S)) C(a(x:S)) -> C(x:S) popout

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

job log

popout

actions

all output return to TRS Standard