details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.151574 seconds
cpu usage	0.116873
user time	0.062348
system time	0.054525
max virtual memory	113188.0
max residence set size	5636.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x1:S) (RULES a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S ) Problem 1: Dependency Pairs Processor: -> Pairs: A(s(x1:S)) -> B(p(p(s(s(x1:S))))) A(s(x1:S)) -> P(p(s(s(x1:S)))) A(s(x1:S)) -> P(s(b(p(p(s(s(x1:S))))))) A(s(x1:S)) -> P(s(s(x1:S))) B(s(x1:S)) -> C(p(s(p(s(x1:S))))) B(s(x1:S)) -> P(p(s(s(c(p(s(p(s(x1:S))))))))) B(s(x1:S)) -> P(s(p(s(x1:S)))) B(s(x1:S)) -> P(s(s(c(p(s(p(s(x1:S)))))))) B(s(x1:S)) -> P(s(x1:S)) C(s(x1:S)) -> A(p(s(p(s(x1:S))))) C(s(x1:S)) -> P(s(a(p(s(p(s(x1:S))))))) C(s(x1:S)) -> P(s(p(s(a(p(s(p(s(x1:S))))))))) C(s(x1:S)) -> P(s(p(s(x1:S)))) C(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) -> Rules: a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S Problem 1: SCC Processor: -> Pairs: A(s(x1:S)) -> B(p(p(s(s(x1:S))))) A(s(x1:S)) -> P(p(s(s(x1:S)))) A(s(x1:S)) -> P(s(b(p(p(s(s(x1:S))))))) A(s(x1:S)) -> P(s(s(x1:S))) B(s(x1:S)) -> C(p(s(p(s(x1:S))))) B(s(x1:S)) -> P(p(s(s(c(p(s(p(s(x1:S))))))))) B(s(x1:S)) -> P(s(p(s(x1:S)))) B(s(x1:S)) -> P(s(s(c(p(s(p(s(x1:S)))))))) B(s(x1:S)) -> P(s(x1:S)) C(s(x1:S)) -> A(p(s(p(s(x1:S))))) C(s(x1:S)) -> P(s(a(p(s(p(s(x1:S))))))) C(s(x1:S)) -> P(s(p(s(a(p(s(p(s(x1:S))))))))) C(s(x1:S)) -> P(s(p(s(x1:S)))) C(s(x1:S)) -> P(s(x1:S)) P(p(s(x1:S))) -> P(x1:S) -> Rules: a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(p(s(x1:S))) -> P(x1:S) ->->-> Rules: a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S ->->Cycle: ->->-> Pairs: A(s(x1:S)) -> B(p(p(s(s(x1:S))))) B(s(x1:S)) -> C(p(s(p(s(x1:S))))) C(s(x1:S)) -> A(p(s(p(s(x1:S))))) ->->-> Rules: a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: P(p(s(x1:S))) -> P(x1:S) -> Rules: a(s(x1:S)) -> s(s(s(p(s(b(p(p(s(s(x1:S)))))))))) b(s(x1:S)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1:S)))))))))))) c(s(x1:S)) -> p(s(p(s(a(p(s(p(s(x1:S))))))))) p(p(s(x1:S))) -> p(x1:S) p(s(x1:S)) -> x1:S popout

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

job log

popout

actions

all output return to SRS Standard