details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	4.34532 seconds
cpu usage	3.91888
user time	3.17059
system time	0.748296
max virtual memory	708204.0
max residence set size	9780.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES a(l(x1:S)) -> a(t(x1:S)) n(s(x1:S)) -> a(l(a(t(x1:S)))) o(m(a(x1:S))) -> t(e(n(x1:S))) s(a(x1:S)) -> l(a(t(o(m(a(t(e(x1:S)))))))) t(o(x1:S)) -> m(a(x1:S)) t(e(x1:S)) -> n(s(x1:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(l(x1:S)) -> A(t(x1:S)) A(l(x1:S)) -> T(x1:S) N(s(x1:S)) -> A(t(x1:S)) N(s(x1:S)) -> A(l(a(t(x1:S)))) N(s(x1:S)) -> T(x1:S) O(m(a(x1:S))) -> N(x1:S) O(m(a(x1:S))) -> T(e(n(x1:S))) S(a(x1:S)) -> A(t(o(m(a(t(e(x1:S))))))) S(a(x1:S)) -> A(t(e(x1:S))) S(a(x1:S)) -> O(m(a(t(e(x1:S))))) S(a(x1:S)) -> T(o(m(a(t(e(x1:S)))))) S(a(x1:S)) -> T(e(x1:S)) T(o(x1:S)) -> A(x1:S) T(e(x1:S)) -> N(s(x1:S)) T(e(x1:S)) -> S(x1:S) -> Rules: a(l(x1:S)) -> a(t(x1:S)) n(s(x1:S)) -> a(l(a(t(x1:S)))) o(m(a(x1:S))) -> t(e(n(x1:S))) s(a(x1:S)) -> l(a(t(o(m(a(t(e(x1:S)))))))) t(o(x1:S)) -> m(a(x1:S)) t(e(x1:S)) -> n(s(x1:S)) Problem 1: SCC Processor: -> Pairs: A(l(x1:S)) -> A(t(x1:S)) A(l(x1:S)) -> T(x1:S) N(s(x1:S)) -> A(t(x1:S)) N(s(x1:S)) -> A(l(a(t(x1:S)))) N(s(x1:S)) -> T(x1:S) O(m(a(x1:S))) -> N(x1:S) O(m(a(x1:S))) -> T(e(n(x1:S))) S(a(x1:S)) -> A(t(o(m(a(t(e(x1:S))))))) S(a(x1:S)) -> A(t(e(x1:S))) S(a(x1:S)) -> O(m(a(t(e(x1:S))))) S(a(x1:S)) -> T(o(m(a(t(e(x1:S)))))) S(a(x1:S)) -> T(e(x1:S)) T(o(x1:S)) -> A(x1:S) T(e(x1:S)) -> N(s(x1:S)) T(e(x1:S)) -> S(x1:S) -> Rules: a(l(x1:S)) -> a(t(x1:S)) n(s(x1:S)) -> a(l(a(t(x1:S)))) o(m(a(x1:S))) -> t(e(n(x1:S))) s(a(x1:S)) -> l(a(t(o(m(a(t(e(x1:S)))))))) t(o(x1:S)) -> m(a(x1:S)) t(e(x1:S)) -> n(s(x1:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(l(x1:S)) -> A(t(x1:S)) A(l(x1:S)) -> T(x1:S) N(s(x1:S)) -> A(t(x1:S)) N(s(x1:S)) -> A(l(a(t(x1:S)))) N(s(x1:S)) -> T(x1:S) O(m(a(x1:S))) -> N(x1:S) O(m(a(x1:S))) -> T(e(n(x1:S))) S(a(x1:S)) -> A(t(o(m(a(t(e(x1:S))))))) S(a(x1:S)) -> A(t(e(x1:S))) S(a(x1:S)) -> O(m(a(t(e(x1:S))))) S(a(x1:S)) -> T(o(m(a(t(e(x1:S)))))) S(a(x1:S)) -> T(e(x1:S)) T(o(x1:S)) -> A(x1:S) T(e(x1:S)) -> N(s(x1:S)) T(e(x1:S)) -> S(x1:S) ->->-> Rules: a(l(x1:S)) -> a(t(x1:S)) n(s(x1:S)) -> a(l(a(t(x1:S)))) o(m(a(x1:S))) -> t(e(n(x1:S))) s(a(x1:S)) -> l(a(t(o(m(a(t(e(x1:S)))))))) t(o(x1:S)) -> m(a(x1:S)) t(e(x1:S)) -> n(s(x1:S)) Problem 1: Reduction Pair Processor: -> Pairs: A(l(x1:S)) -> A(t(x1:S)) A(l(x1:S)) -> T(x1:S) N(s(x1:S)) -> A(t(x1:S)) popout

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

job log

popout

actions

all output return to SRS Standard