details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	244.078 seconds
cpu usage	242.149
user time	224.71
system time	17.439
max virtual memory	816580.0
max residence set size	11696.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S) (RULES and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond1(ttrue,x:S,y:S) -> cond2(gr(x:S,y:S),x:S,y:S) cond2(ffalse,x:S,y:S) -> cond4(gr(y:S,0),x:S,y:S) cond2(ttrue,x:S,y:S) -> cond3(gr(x:S,0),x:S,y:S) cond3(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond3(ttrue,x:S,y:S) -> cond3(gr(x:S,0),p(x:S),y:S) cond4(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond4(ttrue,x:S,y:S) -> cond4(gr(y:S,0),x:S,p(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: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond1(ttrue,x:S,y:S) -> cond2(gr(x:S,y:S),x:S,y:S) cond2(ffalse,x:S,y:S) -> cond4(gr(y:S,0),x:S,y:S) cond2(ttrue,x:S,y:S) -> cond3(gr(x:S,0),x:S,y:S) cond3(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond3(ttrue,x:S,y:S) -> cond3(gr(x:S,0),p(x:S),y:S) cond4(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond4(ttrue,x:S,y:S) -> cond4(gr(y:S,0),x:S,p(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: COND1(ttrue,x:S,y:S) -> COND2(gr(x:S,y:S),x:S,y:S) COND1(ttrue,x:S,y:S) -> GR(x:S,y:S) COND2(ffalse,x:S,y:S) -> COND4(gr(y:S,0),x:S,y:S) COND2(ffalse,x:S,y:S) -> GR(y:S,0) COND2(ttrue,x:S,y:S) -> COND3(gr(x:S,0),x:S,y:S) COND2(ttrue,x:S,y:S) -> GR(x:S,0) COND3(ffalse,x:S,y:S) -> AND(gr(x:S,0),gr(y:S,0)) COND3(ffalse,x:S,y:S) -> COND1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) COND3(ffalse,x:S,y:S) -> GR(x:S,0) COND3(ffalse,x:S,y:S) -> GR(y:S,0) COND3(ttrue,x:S,y:S) -> COND3(gr(x:S,0),p(x:S),y:S) COND3(ttrue,x:S,y:S) -> GR(x:S,0) COND3(ttrue,x:S,y:S) -> P(x:S) COND4(ffalse,x:S,y:S) -> AND(gr(x:S,0),gr(y:S,0)) COND4(ffalse,x:S,y:S) -> COND1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) COND4(ffalse,x:S,y:S) -> GR(x:S,0) COND4(ffalse,x:S,y:S) -> GR(y:S,0) COND4(ttrue,x:S,y:S) -> COND4(gr(y:S,0),x:S,p(y:S)) COND4(ttrue,x:S,y:S) -> GR(y:S,0) COND4(ttrue,x:S,y:S) -> P(y:S) GR(s(x:S),s(y:S)) -> GR(x:S,y:S) -> Rules: and(ffalse,x:S) -> ffalse and(ttrue,ttrue) -> ttrue and(x:S,ffalse) -> ffalse cond1(ttrue,x:S,y:S) -> cond2(gr(x:S,y:S),x:S,y:S) cond2(ffalse,x:S,y:S) -> cond4(gr(y:S,0),x:S,y:S) cond2(ttrue,x:S,y:S) -> cond3(gr(x:S,0),x:S,y:S) cond3(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond3(ttrue,x:S,y:S) -> cond3(gr(x:S,0),p(x:S),y:S) cond4(ffalse,x:S,y:S) -> cond1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) cond4(ttrue,x:S,y:S) -> cond4(gr(y:S,0),x:S,p(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: COND1(ttrue,x:S,y:S) -> COND2(gr(x:S,y:S),x:S,y:S) COND1(ttrue,x:S,y:S) -> GR(x:S,y:S) COND2(ffalse,x:S,y:S) -> COND4(gr(y:S,0),x:S,y:S) COND2(ffalse,x:S,y:S) -> GR(y:S,0) COND2(ttrue,x:S,y:S) -> COND3(gr(x:S,0),x:S,y:S) COND2(ttrue,x:S,y:S) -> GR(x:S,0) COND3(ffalse,x:S,y:S) -> AND(gr(x:S,0),gr(y:S,0)) COND3(ffalse,x:S,y:S) -> COND1(and(gr(x:S,0),gr(y:S,0)),x:S,y:S) COND3(ffalse,x:S,y:S) -> GR(x:S,0) popout

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

job log

popout

actions

all output return to TRS Standard