details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.0804959 seconds
cpu usage	0.035757
user time	0.020418
system time	0.015339
max virtual memory	113188.0
max residence set size	7684.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: app(app(:(),app(app(:(),x),y)),z) -> app(app(:(),x),app(app(:(),y),z)) 2: app(app(:(),app(app(+(),x),y)),z) -> app(app(+(),app(app(:(),x),z)),app(app(:(),y),z)) 3: app(app(:(),z),app(app(+(),x),app(f,y))) -> app(app(:(),app(app(g(),z),y)),app(app(+(),x),a())) 4: app(app(map(),f),nil()) -> nil() 5: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 6: app(app(filter(),f),nil()) -> nil() 7: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 8: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 9: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Number of strict rules: 9 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #app(app(:(),app(app(+(),x),y)),z) -> #app(app(+(),app(app(:(),x),z)),app(app(:(),y),z)) #2: #app(app(:(),app(app(+(),x),y)),z) -> #app(+(),app(app(:(),x),z)) #3: #app(app(:(),app(app(+(),x),y)),z) -> #app(app(:(),x),z) #4: #app(app(:(),app(app(+(),x),y)),z) -> #app(:(),x) #5: #app(app(:(),app(app(+(),x),y)),z) -> #app(app(:(),y),z) #6: #app(app(:(),app(app(+(),x),y)),z) -> #app(:(),y) #7: #app(app(app(app(filter2(),false()),f),x),xs) -> #app(app(filter(),f),xs) #8: #app(app(app(app(filter2(),false()),f),x),xs) -> #app(filter(),f) #9: #app(app(filter(),f),app(app(cons(),x),xs)) -> #app(app(app(app(filter2(),app(f,x)),f),x),xs) #10: #app(app(filter(),f),app(app(cons(),x),xs)) -> #app(app(app(filter2(),app(f,x)),f),x) #11: #app(app(filter(),f),app(app(cons(),x),xs)) -> #app(app(filter2(),app(f,x)),f) #12: #app(app(filter(),f),app(app(cons(),x),xs)) -> #app(filter2(),app(f,x)) #13: #app(app(filter(),f),app(app(cons(),x),xs)) -> #app(f,x) #14: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(app(cons(),app(f,x)),app(app(map(),f),xs)) #15: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(cons(),app(f,x)) #16: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(f,x) #17: #app(app(map(),f),app(app(cons(),x),xs)) -> #app(app(map(),f),xs) #18: #app(app(:(),z),app(app(+(),x),app(f,y))) -> #app(app(:(),app(app(g(),z),y)),app(app(+(),x),a())) #19: #app(app(:(),z),app(app(+(),x),app(f,y))) -> #app(:(),app(app(g(),z),y)) #20: #app(app(:(),z),app(app(+(),x),app(f,y))) -> #app(app(g(),z),y) #21: #app(app(:(),z),app(app(+(),x),app(f,y))) -> #app(g(),z) #22: #app(app(:(),z),app(app(+(),x),app(f,y))) -> #app(app(+(),x),a()) #23: #app(app(:(),app(app(:(),x),y)),z) -> #app(app(:(),x),app(app(:(),y),z)) #24: #app(app(:(),app(app(:(),x),y)),z) -> #app(app(:(),y),z) #25: #app(app(:(),app(app(:(),x),y)),z) -> #app(:(),y) #26: #app(app(app(app(filter2(),true()),f),x),xs) -> #app(app(cons(),x),app(app(filter(),f),xs)) #27: #app(app(app(app(filter2(),true()),f),x),xs) -> #app(cons(),x) #28: #app(app(app(app(filter2(),true()),f),x),xs) -> #app(app(filter(),f),xs) #29: #app(app(app(app(filter2(),true()),f),x),xs) -> #app(filter(),f) Number of SCCs: 2, DPs: 9 SCC { #3 #5 #23 #24 } POLO(Sum)... succeeded. a w: 20538 false w: 1 true w: 1 filter2 w: 12940 : w: 1 nil w: 14219 #app w: x1 map w: 60386 cons w: 10732 filter w: 12944 + w: 1 g w: 46534 app w: x1 + x2 + 1 USABLE RULES: { } Removed DPs: #3 #5 #23 #24 Number of SCCs: 1, DPs: 5 SCC { #7 #13 #16 #17 #28 } POLO(Sum)... succeeded. a w: 1 false w: 47181 true w: 14903 filter2 w: 1458 : w: 7719 nil w: 31205 #app w: x1 map w: 60386 cons w: 46441 filter w: 16362 + w: 49461 g w: 41499 app w: x1 + x2 + 1 USABLE RULES: { } Removed DPs: #7 #13 #16 #28 Number of SCCs: 1, DPs: 1 SCC { #17 } POLO(Sum)... POLO(max)... succeeded. a w: 0 false w: 0 true w: 0 filter2 w: 0 : w: 0 nil w: 0 #app w: max(x2 + 7720) map w: 1 cons w: 1 filter w: 0 + w: 0 g w: 0 app w: max(x1, x2 + 1) USABLE RULES: { } Removed DPs: #17 Number of SCCs: 0, DPs: 0 popout

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

job log

popout

actions

all output return to TRS Standard