details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.0777529 seconds
cpu usage	0.063741
user time	0.02936
system time	0.034381
max virtual memory	113188.0
max residence set size	5516.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ) Problem 1: Innermost Equivalent Processor: -> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S -> The term rewriting system is non-overlaping or locally confluent overlay system. Therefore, innermost termination implies termination. Problem 1: Dependency Pairs Processor: -> Pairs: COND(ttrue,x:S,y:S) -> COND(gr(x:S,y:S),p(x:S),s(y:S)) COND(ttrue,x:S,y:S) -> GR(x:S,y:S) COND(ttrue,x:S,y:S) -> P(x:S) GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S Problem 1: SCC Processor: -> Pairs: COND(ttrue,x:S,y:S) -> COND(gr(x:S,y:S),p(x:S),s(y:S)) COND(ttrue,x:S,y:S) -> GR(x:S,y:S) COND(ttrue,x:S,y:S) -> P(x:S) GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: GR(s(x:S),s(y:S)) -> GR(x:S,y:S) ->->-> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->->Cycle: ->->-> Pairs: COND(ttrue,x:S,y:S) -> COND(gr(x:S,y:S),p(x:S),s(y:S)) ->->-> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: cond(ttrue,x:S,y:S) -> cond(gr(x:S,y:S),p(x:S),s(y:S)) gr(0,x:S) -> ffalse gr(s(x:S),0) -> ttrue gr(s(x:S),s(y:S)) -> gr(x:S,y:S) p(0) -> 0 p(s(x:S)) -> x:S ->Projection: pi(GR) = 1 Problem 1.1: popout

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

job log

popout

actions

all output return to TRS Standard