details

property	value
status	complete
benchmark	big.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	CiME_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	0.582114 seconds
cpu usage	0.53565
user time	0.341688
system time	0.193962
max virtual memory	113188.0
max residence set size	23864.0

stage attributes

key	value
starexec-result	YES

output

YES Problem 1: (VAR v_NonEmpty:S l:S l1:S l2:S l3:S x:S y:S z:S) (RULES *(*(x:S,y:S),z:S) -> *(x:S,*(y:S,z:S)) *(0(x:S),y:S) -> 0(*(x:S,y:S)) *(#,x:S) -> # *(1(x:S),y:S) -> +(0(*(x:S,y:S)),y:S) *(x:S,+(y:S,z:S)) -> +(*(x:S,y:S),*(x:S,z:S)) +(+(x:S,y:S),z:S) -> +(x:S,+(y:S,z:S)) +(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,#) -> 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(#) -> # app(cons(x:S,l1:S),l2:S) -> cons(x:S,app(l1:S,l2:S)) app(nil,l:S) -> l:S eq(0(x:S),0(y:S)) -> eq(x:S,y:S) eq(0(x:S),#) -> eq(x:S,#) eq(0(x:S),1(y:S)) -> ffalse eq(#,0(y:S)) -> eq(#,y:S) eq(#,#) -> ttrue eq(#,1(y:S)) -> ffalse eq(1(x:S),0(y:S)) -> ffalse eq(1(x:S),#) -> ffalse eq(1(x:S),1(y:S)) -> eq(x:S,y: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 ifinter(ffalse,x:S,l1:S,l2:S) -> inter(l1:S,l2:S) ifinter(ttrue,x:S,l1:S,l2:S) -> cons(x:S,inter(l1:S,l2:S)) inter(app(l1:S,l2:S),l3:S) -> app(inter(l1:S,l3:S),inter(l2:S,l3:S)) inter(cons(x:S,l1:S),l2:S) -> ifinter(mem(x:S,l2:S),x:S,l1:S,l2:S) inter(nil,x:S) -> nil inter(l1:S,app(l2:S,l3:S)) -> app(inter(l1:S,l2:S),inter(l1:S,l3:S)) inter(l1:S,cons(x:S,l2:S)) -> ifinter(mem(x:S,l1:S),x:S,l2:S,l1:S) inter(x:S,nil) -> nil log(x:S) -> -(log'(x:S),1(#)) log'(0(x:S)) -> if(ge(x:S,1(#)),+(log'(x:S),1(#)),#) log'(#) -> # log'(1(x:S)) -> +(log'(x:S),1(#)) mem(x:S,cons(y:S,l:S)) -> if(eq(x:S,y:S),ttrue,mem(x:S,l:S)) mem(x:S,nil) -> ffalse not(ffalse) -> ttrue not(ttrue) -> ffalse prod(app(l1:S,l2:S)) -> *(prod(l1:S),prod(l2:S)) prod(cons(x:S,l:S)) -> *(x:S,prod(l:S)) prod(nil) -> 1(#) sum(app(l1:S,l2:S)) -> +(sum(l1:S),sum(l2:S)) sum(cons(x:S,l:S)) -> +(x:S,sum(l:S)) sum(nil) -> 0(#) ) Problem 1: Dependency Pairs Processor: -> Pairs: *#(*(x:S,y:S),z:S) -> *#(x:S,*(y:S,z:S)) *#(*(x:S,y:S),z:S) -> *#(y:S,z:S) *#(0(x:S),y:S) -> *#(x:S,y:S) *#(0(x:S),y:S) -> 0#(*(x:S,y:S)) *#(1(x:S),y:S) -> *#(x:S,y:S) *#(1(x:S),y:S) -> +#(0(*(x:S,y:S)),y:S) *#(1(x:S),y:S) -> 0#(*(x:S,y:S)) *#(x:S,+(y:S,z:S)) -> *#(x:S,y:S) *#(x:S,+(y:S,z:S)) -> *#(x:S,z:S) *#(x:S,+(y:S,z:S)) -> +#(*(x:S,y:S),*(x:S,z:S)) +#(+(x:S,y:S),z:S) -> +#(x:S,+(y:S,z:S)) +#(+(x:S,y:S),z:S) -> +#(y:S,z: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(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(#))) -#(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)) APP(cons(x:S,l1:S),l2:S) -> APP(l1:S,l2:S) popout

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

job log

popout

actions

all output return to TRS Standard