details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	1.09852 seconds
cpu usage	1.02432
user time	0.717047
system time	0.30727
max virtual memory	452896.0
max residence set size	6352.0

stage attributes

key	value
starexec-result	YES

output

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

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

job log

popout

actions

all output return to SRS Standard