details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.258656 seconds
cpu usage	0.264075
user time	0.158186
system time	0.105889
max virtual memory	113188.0
max residence set size	15188.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S x:S y:S z:S) (RULES +(0(x:S),0(y:S)) -> 0(+(x:S,y:S)) +(0(x:S),1(y:S)) -> 1(+(x:S,y:S)) +(#,x:S) -> x:S +(1(x:S),0(y:S)) -> 1(+(x:S,y:S)) +(1(x:S),1(y:S)) -> 0(+(+(x:S,y:S),1(#))) +(x:S,+(y:S,z:S)) -> +(+(x:S,y:S),z:S) +(x:S,#) -> x:S -(0(x:S),0(y:S)) -> 0(-(x:S,y:S)) -(0(x:S),1(y:S)) -> 1(-(-(x:S,y:S),1(#))) -(#,x:S) -> # -(1(x:S),0(y:S)) -> 1(-(x:S,y:S)) -(1(x:S),1(y:S)) -> 0(-(x:S,y:S)) -(x:S,#) -> x:S 0(#) -> # and(x:S,ffalse) -> ffalse and(x:S,ttrue) -> x:S bs(l(x:S)) -> ttrue bs(n(x:S,y:S,z:S)) -> and(and(ge(x:S,max(y:S)),ge(min(z:S),x:S)),and(bs(y:S),bs(z:S))) ge(0(x:S),0(y:S)) -> ge(x:S,y:S) ge(0(x:S),1(y:S)) -> not(ge(y:S,x:S)) ge(#,0(x:S)) -> ge(#,x:S) ge(#,1(x:S)) -> ffalse ge(1(x:S),0(y:S)) -> ge(x:S,y:S) ge(1(x:S),1(y:S)) -> ge(x:S,y:S) ge(x:S,#) -> ttrue if(ffalse,x:S,y:S) -> y:S if(ttrue,x:S,y:S) -> x:S max(l(x:S)) -> x:S max(n(x:S,y:S,z:S)) -> max(z:S) min(l(x:S)) -> x:S min(n(x:S,y:S,z:S)) -> min(y:S) not(ffalse) -> ttrue not(ttrue) -> ffalse size(l(x:S)) -> 1(#) size(n(x:S,y:S,z:S)) -> +(+(size(x:S),size(y:S)),1(#)) val(l(x:S)) -> x:S val(n(x:S,y:S,z:S)) -> x:S wb(l(x:S)) -> ttrue wb(n(x:S,y:S,z:S)) -> and(if(ge(size(y:S),size(z:S)),ge(1(#),-(size(y:S),size(z:S))),ge(1(#),-(size(z:S),size(y:S)))),and(wb(y:S),wb(z:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: +#(0(x:S),0(y:S)) -> +#(x:S,y:S) +#(0(x:S),0(y:S)) -> 0#(+(x:S,y:S)) +#(0(x:S),1(y:S)) -> +#(x:S,y:S) +#(1(x:S),0(y:S)) -> +#(x:S,y:S) +#(1(x:S),1(y:S)) -> +#(+(x:S,y:S),1(#)) +#(1(x:S),1(y:S)) -> +#(x:S,y:S) +#(1(x:S),1(y:S)) -> 0#(+(+(x:S,y:S),1(#))) +#(x:S,+(y:S,z:S)) -> +#(+(x:S,y:S),z:S) +#(x:S,+(y:S,z:S)) -> +#(x:S,y:S) -#(0(x:S),0(y:S)) -> -#(x:S,y:S) -#(0(x:S),0(y:S)) -> 0#(-(x:S,y:S)) -#(0(x:S),1(y:S)) -> -#(-(x:S,y:S),1(#)) -#(0(x:S),1(y:S)) -> -#(x:S,y:S) -#(1(x:S),0(y:S)) -> -#(x:S,y:S) -#(1(x:S),1(y:S)) -> -#(x:S,y:S) -#(1(x:S),1(y:S)) -> 0#(-(x:S,y:S)) BS(n(x:S,y:S,z:S)) -> AND(and(ge(x:S,max(y:S)),ge(min(z:S),x:S)),and(bs(y:S),bs(z:S))) BS(n(x:S,y:S,z:S)) -> AND(bs(y:S),bs(z:S)) BS(n(x:S,y:S,z:S)) -> AND(ge(x:S,max(y:S)),ge(min(z:S),x:S)) BS(n(x:S,y:S,z:S)) -> BS(y:S) BS(n(x:S,y:S,z:S)) -> BS(z:S) BS(n(x:S,y:S,z:S)) -> GE(min(z:S),x:S) BS(n(x:S,y:S,z:S)) -> GE(x:S,max(y:S)) BS(n(x:S,y:S,z:S)) -> MAX(y:S) BS(n(x:S,y:S,z:S)) -> MIN(z:S) GE(0(x:S),0(y:S)) -> GE(x:S,y:S) GE(0(x:S),1(y:S)) -> GE(y:S,x:S) GE(0(x:S),1(y:S)) -> NOT(ge(y:S,x:S)) GE(#,0(x:S)) -> GE(#,x:S) GE(1(x:S),0(y:S)) -> GE(x:S,y:S) GE(1(x:S),1(y:S)) -> GE(x:S,y:S) MAX(n(x:S,y:S,z:S)) -> MAX(z:S) MIN(n(x:S,y:S,z:S)) -> MIN(y:S) SIZE(n(x:S,y:S,z:S)) -> +#(+(size(x:S),size(y:S)),1(#)) SIZE(n(x:S,y:S,z:S)) -> +#(size(x:S),size(y:S)) SIZE(n(x:S,y:S,z:S)) -> SIZE(x:S) SIZE(n(x:S,y:S,z:S)) -> SIZE(y:S) WB(n(x:S,y:S,z:S)) -> -#(size(y:S),size(z:S)) WB(n(x:S,y:S,z:S)) -> -#(size(z:S),size(y:S)) WB(n(x:S,y:S,z:S)) -> AND(if(ge(size(y:S),size(z:S)),ge(1(#),-(size(y:S),size(z:S))),ge(1(#),-(size(z:S),size(y:S)))),and(wb(y:S),wb(z:S))) WB(n(x:S,y:S,z:S)) -> AND(wb(y:S),wb(z:S)) WB(n(x:S,y:S,z:S)) -> GE(size(y:S),size(z:S)) WB(n(x:S,y:S,z:S)) -> GE(1(#),-(size(y:S),size(z:S))) WB(n(x:S,y:S,z:S)) -> GE(1(#),-(size(z:S),size(y:S))) WB(n(x:S,y:S,z:S)) -> IF(ge(size(y:S),size(z:S)),ge(1(#),-(size(y:S),size(z:S))),ge(1(#),-(size(z:S),size(y:S)))) WB(n(x:S,y:S,z:S)) -> SIZE(y:S) WB(n(x:S,y:S,z:S)) -> SIZE(z:S) WB(n(x:S,y:S,z:S)) -> WB(y:S) WB(n(x:S,y:S,z:S)) -> WB(z:S) popout

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

job log

popout

actions

all output return to TRS Standard