details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	7.59061 seconds
cpu usage	6.92513
user time	4.82266
system time	2.10247
max virtual memory	710652.0
max residence set size	7584.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES b(b(x1:S)) -> c(d(x1:S)) c(c(x1:S)) -> d(d(d(x1:S))) c(x1:S) -> g(x1:S) d(d(d(x1:S))) -> g(c(x1:S)) d(d(x1:S)) -> c(f(x1:S)) f(x1:S) -> a(g(x1:S)) g(g(x1:S)) -> b(c(x1:S)) g(x1:S) -> d(a(b(x1:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: B(b(x1:S)) -> C(d(x1:S)) B(b(x1:S)) -> D(x1:S) C(c(x1:S)) -> D(d(d(x1:S))) C(c(x1:S)) -> D(d(x1:S)) C(c(x1:S)) -> D(x1:S) C(x1:S) -> G(x1:S) D(d(d(x1:S))) -> C(x1:S) D(d(d(x1:S))) -> G(c(x1:S)) D(d(x1:S)) -> C(f(x1:S)) D(d(x1:S)) -> F(x1:S) F(x1:S) -> G(x1:S) G(g(x1:S)) -> B(c(x1:S)) G(g(x1:S)) -> C(x1:S) G(x1:S) -> B(x1:S) G(x1:S) -> D(a(b(x1:S))) -> Rules: b(b(x1:S)) -> c(d(x1:S)) c(c(x1:S)) -> d(d(d(x1:S))) c(x1:S) -> g(x1:S) d(d(d(x1:S))) -> g(c(x1:S)) d(d(x1:S)) -> c(f(x1:S)) f(x1:S) -> a(g(x1:S)) g(g(x1:S)) -> b(c(x1:S)) g(x1:S) -> d(a(b(x1:S))) Problem 1: SCC Processor: -> Pairs: B(b(x1:S)) -> C(d(x1:S)) B(b(x1:S)) -> D(x1:S) C(c(x1:S)) -> D(d(d(x1:S))) C(c(x1:S)) -> D(d(x1:S)) C(c(x1:S)) -> D(x1:S) C(x1:S) -> G(x1:S) D(d(d(x1:S))) -> C(x1:S) D(d(d(x1:S))) -> G(c(x1:S)) D(d(x1:S)) -> C(f(x1:S)) D(d(x1:S)) -> F(x1:S) F(x1:S) -> G(x1:S) G(g(x1:S)) -> B(c(x1:S)) G(g(x1:S)) -> C(x1:S) G(x1:S) -> B(x1:S) G(x1:S) -> D(a(b(x1:S))) -> Rules: b(b(x1:S)) -> c(d(x1:S)) c(c(x1:S)) -> d(d(d(x1:S))) c(x1:S) -> g(x1:S) d(d(d(x1:S))) -> g(c(x1:S)) d(d(x1:S)) -> c(f(x1:S)) f(x1:S) -> a(g(x1:S)) g(g(x1:S)) -> b(c(x1:S)) g(x1:S) -> d(a(b(x1:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B(b(x1:S)) -> C(d(x1:S)) B(b(x1:S)) -> D(x1:S) C(c(x1:S)) -> D(d(d(x1:S))) C(c(x1:S)) -> D(d(x1:S)) C(c(x1:S)) -> D(x1:S) C(x1:S) -> G(x1:S) D(d(d(x1:S))) -> C(x1:S) D(d(d(x1:S))) -> G(c(x1:S)) D(d(x1:S)) -> C(f(x1:S)) D(d(x1:S)) -> F(x1:S) F(x1:S) -> G(x1:S) G(g(x1:S)) -> B(c(x1:S)) G(g(x1:S)) -> C(x1:S) G(x1:S) -> B(x1:S) ->->-> Rules: b(b(x1:S)) -> c(d(x1:S)) c(c(x1:S)) -> d(d(d(x1:S))) c(x1:S) -> g(x1:S) d(d(d(x1:S))) -> g(c(x1:S)) d(d(x1:S)) -> c(f(x1:S)) f(x1:S) -> a(g(x1:S)) g(g(x1:S)) -> b(c(x1:S)) g(x1:S) -> d(a(b(x1:S))) popout

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

job log

popout

actions

all output return to SRS Standard