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	n180.star.cs.uiowa.edu
space	CiME_04

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.274195 seconds
cpu usage	0.122897
user time	0.083157
system time	0.03974
max virtual memory	113188.0
max residence set size	9248.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: 0(\#()) -> \#() 2: +(x,\#()) -> x 3: +(\#(),x) -> x 4: +(0(x),0(y)) -> 0(+(x,y)) 5: +(0(x),1(y)) -> 1(+(x,y)) 6: +(1(x),0(y)) -> 1(+(x,y)) 7: +(1(x),1(y)) -> 0(+(+(x,y),1(\#()))) 8: +(+(x,y),z) -> +(x,+(y,z)) 9: -(\#(),x) -> \#() 10: -(x,\#()) -> x 11: -(0(x),0(y)) -> 0(-(x,y)) 12: -(0(x),1(y)) -> 1(-(-(x,y),1(\#()))) 13: -(1(x),0(y)) -> 1(-(x,y)) 14: -(1(x),1(y)) -> 0(-(x,y)) 15: not(true()) -> false() 16: not(false()) -> true() 17: if(true(),x,y) -> x 18: if(false(),x,y) -> y 19: eq(\#(),\#()) -> true() 20: eq(\#(),1(y)) -> false() 21: eq(1(x),\#()) -> false() 22: eq(\#(),0(y)) -> eq(\#(),y) 23: eq(0(x),\#()) -> eq(x,\#()) 24: eq(1(x),1(y)) -> eq(x,y) 25: eq(0(x),1(y)) -> false() 26: eq(1(x),0(y)) -> false() 27: eq(0(x),0(y)) -> eq(x,y) 28: ge(0(x),0(y)) -> ge(x,y) 29: ge(0(x),1(y)) -> not(ge(y,x)) 30: ge(1(x),0(y)) -> ge(x,y) 31: ge(1(x),1(y)) -> ge(x,y) 32: ge(x,\#()) -> true() 33: ge(\#(),0(x)) -> ge(\#(),x) 34: ge(\#(),1(x)) -> false() 35: log(x) -> -(log'(x),1(\#())) 36: log'(\#()) -> \#() 37: log'(1(x)) -> +(log'(x),1(\#())) 38: log'(0(x)) -> if(ge(x,1(\#())),+(log'(x),1(\#())),\#()) 39: *(\#(),x) -> \#() 40: *(0(x),y) -> 0(*(x,y)) 41: *(1(x),y) -> +(0(*(x,y)),y) 42: *(*(x,y),z) -> *(x,*(y,z)) 43: *(x,+(y,z)) -> +(*(x,y),*(x,z)) 44: app(nil(),l) -> l 45: app(cons(x,l1),l2) -> cons(x,app(l1,l2)) 46: sum(nil()) -> 0(\#()) 47: sum(cons(x,l)) -> +(x,sum(l)) 48: sum(app(l1,l2)) -> +(sum(l1),sum(l2)) 49: prod(nil()) -> 1(\#()) 50: prod(cons(x,l)) -> *(x,prod(l)) 51: prod(app(l1,l2)) -> *(prod(l1),prod(l2)) 52: mem(x,nil()) -> false() 53: mem(x,cons(y,l)) -> if(eq(x,y),true(),mem(x,l)) 54: inter(x,nil()) -> nil() 55: inter(nil(),x) -> nil() 56: inter(app(l1,l2),l3) -> app(inter(l1,l3),inter(l2,l3)) 57: inter(l1,app(l2,l3)) -> app(inter(l1,l2),inter(l1,l3)) 58: inter(cons(x,l1),l2) -> ifinter(mem(x,l2),x,l1,l2) 59: inter(l1,cons(x,l2)) -> ifinter(mem(x,l1),x,l2,l1) 60: ifinter(true(),x,l1,l2) -> cons(x,inter(l1,l2)) 61: ifinter(false(),x,l1,l2) -> inter(l1,l2) Number of strict rules: 61 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #*(x,+(y,z)) -> #+(*(x,y),*(x,z)) #2: #*(x,+(y,z)) -> #*(x,y) #3: #*(x,+(y,z)) -> #*(x,z) #4: #ge(0(x),1(y)) -> #not(ge(y,x)) #5: #ge(0(x),1(y)) -> #ge(y,x) #6: #log(x) -> #-(log'(x),1(\#())) #7: #log(x) -> #log'(x) #8: #sum(nil()) -> #0(\#()) #9: #*(*(x,y),z) -> #*(x,*(y,z)) #10: #*(*(x,y),z) -> #*(y,z) #11: #*(1(x),y) -> #+(0(*(x,y)),y) #12: #*(1(x),y) -> #0(*(x,y)) #13: #*(1(x),y) -> #*(x,y) #14: #log'(1(x)) -> #+(log'(x),1(\#())) #15: #log'(1(x)) -> #log'(x) #16: #sum(cons(x,l)) -> #+(x,sum(l)) #17: #sum(cons(x,l)) -> #sum(l) #18: #mem(x,cons(y,l)) -> #if(eq(x,y),true(),mem(x,l)) #19: #mem(x,cons(y,l)) -> #eq(x,y) #20: #mem(x,cons(y,l)) -> #mem(x,l) #21: #sum(app(l1,l2)) -> #+(sum(l1),sum(l2)) #22: #sum(app(l1,l2)) -> #sum(l1) #23: #sum(app(l1,l2)) -> #sum(l2) #24: #inter(cons(x,l1),l2) -> #ifinter(mem(x,l2),x,l1,l2) #25: #inter(cons(x,l1),l2) -> #mem(x,l2) #26: #ifinter(false(),x,l1,l2) -> #inter(l1,l2) #27: #log'(0(x)) -> #if(ge(x,1(\#())),+(log'(x),1(\#())),\#()) #28: #log'(0(x)) -> #ge(x,1(\#())) #29: #log'(0(x)) -> #+(log'(x),1(\#())) #30: #log'(0(x)) -> #log'(x) #31: #+(1(x),0(y)) -> #+(x,y) #32: #inter(l1,cons(x,l2)) -> #ifinter(mem(x,l1),x,l2,l1) #33: #inter(l1,cons(x,l2)) -> #mem(x,l1) popout

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

job log

popout

actions

all output return to TRS Standard