details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	87.6881 seconds
cpu usage	87.4696
user time	80.0063
system time	7.46326
max virtual memory	752244.0
max residence set size	44440.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S ) Problem 1: Innermost Equivalent Processor: -> Rules: A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: A#(b(x1:S)) -> A#(x1:S) A#(b(x1:S)) -> B#(A(x1:S)) B#(a(x1:S)) -> A#(B(x1:S)) B#(a(x1:S)) -> B#(x1:S) -> Rules: A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S Problem 1: SCC Processor: -> Pairs: A#(b(x1:S)) -> A#(x1:S) A#(b(x1:S)) -> B#(A(x1:S)) B#(a(x1:S)) -> A#(B(x1:S)) B#(a(x1:S)) -> B#(x1:S) -> Rules: A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(b(x1:S)) -> A#(x1:S) A#(b(x1:S)) -> B#(A(x1:S)) B#(a(x1:S)) -> A#(B(x1:S)) B#(a(x1:S)) -> B#(x1:S) ->->-> Rules: A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S Problem 1: Narrowing Processor: -> Pairs: A#(b(x1:S)) -> A#(x1:S) A#(b(x1:S)) -> B#(A(x1:S)) B#(a(x1:S)) -> A#(B(x1:S)) B#(a(x1:S)) -> B#(x1:S) -> Rules: A(a(x1:S)) -> x1:S A(b(x1:S)) -> b(a(B(A(x1:S)))) B(a(x1:S)) -> a(b(A(B(x1:S)))) B(b(x1:S)) -> x1:S ->Narrowed Pairs: ->->Original Pair: A#(b(x1:S)) -> B#(A(x1:S)) ->-> Narrowed pairs: A#(b(a(x1:S))) -> B#(x1:S) A#(b(b(x1:S))) -> B#(b(a(B(A(x1:S))))) ->->Original Pair: B#(a(x1:S)) -> A#(B(x1:S)) ->-> Narrowed pairs: B#(a(a(x1:S))) -> A#(a(b(A(B(x1:S))))) B#(a(b(x1:S))) -> A#(x1:S) Problem 1: SCC Processor: -> Pairs: A#(b(a(x1:S))) -> B#(x1:S) A#(b(b(x1:S))) -> B#(b(a(B(A(x1:S))))) A#(b(x1:S)) -> A#(x1:S) B#(a(a(x1:S))) -> A#(a(b(A(B(x1:S))))) B#(a(b(x1:S))) -> A#(x1:S) B#(a(x1:S)) -> B#(x1:S) -> Rules: A(a(x1:S)) -> x1:S popout

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

job log

popout

actions

all output return to SRS Standard