details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.076044 seconds
cpu usage	0.029563
user time	0.015609
system time	0.013954
max virtual memory	113188.0
max residence set size	9272.0

stage attributes

key	value
starexec-result	YES

output

YES Input TRS: 1: app(app(plus(),0()),y) -> y 2: app(app(plus(),app(s(),x)),y) -> app(s(),app(app(plus(),x),y)) 3: app(app(map(),f),nil()) -> nil() 4: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 5: app(app(app(curry(),g),x),y) -> app(app(g,x),y) 6: inc() -> app(map(),app(app(curry(),plus()),app(s(),0()))) Number of strict rules: 6 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_plus(0(),y) -> y 2: app^2_plus(app^1_s(x),y) -> app^1_s(app^2_plus(x,y)) 3: app^2_map(f,nil()) -> nil() 4: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 5: app^3_curry(g,x,y) -> app(app(g,x),y) 6: inc() -> app^1_map(app^2_curry(plus(),app^1_s(0()))) 7: app(plus(),_1) ->= app^1_plus(_1) 8: app(app^1_plus(_1),_2) ->= app^2_plus(_1,_2) 9: app(curry(),_1) ->= app^1_curry(_1) 10: app(app^1_curry(_1),_2) ->= app^2_curry(_1,_2) 11: app(app^2_curry(_1,_2),_3) ->= app^3_curry(_1,_2,_3) 12: app(cons(),_1) ->= app^1_cons(_1) 13: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 14: app(s(),_1) ->= app^1_s(_1) 15: app(map(),_1) ->= app^1_map(_1) 16: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) Number of strict rules: 6 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^2_plus(app^1_s(x),y) -> #app^2_plus(x,y) #2: #app(app^2_curry(_1,_2),_3) ->? #app^3_curry(_1,_2,_3) #3: #app^3_curry(g,x,y) -> #app(app(g,x),y) #4: #app^3_curry(g,x,y) -> #app(g,x) #5: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #6: #app(app^1_plus(_1),_2) ->? #app^2_plus(_1,_2) #7: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #8: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) Number of SCCs: 2, DPs: 7 SCC { #1 } POLO(Sum)... succeeded. s w: 0 app^1_cons w: 0 app^1_plus w: 0 #app^2_map w: 0 curry w: 0 #inc w: 0 inc w: 0 #app^2_plus w: x1 #app^3_curry w: 0 app^2_plus w: 0 0 w: 0 app^1_curry w: 0 nil w: 0 #app w: 0 app^2_curry w: 0 map w: 0 plus w: 0 cons w: 0 app^3_curry w: 0 app^1_map w: 0 app^2_cons w: 0 app^1_s w: x1 + 1 app^2_map w: 0 app w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 6 SCC { #2..5 #7 #8 } POLO(Sum)... succeeded. s w: 1 app^1_cons w: x1 + 25907 app^1_plus w: x1 + 14681 #app^2_map w: x1 + 1 curry w: 1982 #inc w: 0 inc w: 0 #app^2_plus w: 0 #app^3_curry w: x1 + x2 + 28633 app^2_plus w: x1 + x2 + 43313 0 w: 1 app^1_curry w: x1 + 30614 nil w: 1 #app w: x1 app^2_curry w: x1 + x2 + 28634 map w: 8851 plus w: 49077 cons w: 33034 app^3_curry w: x1 + x2 + x3 + 57264 app^1_map w: x1 + 36186 app^2_cons w: x2 + 20538 app^1_s w: x1 + 18458 app^2_map w: x1 + x2 + 26286 app w: x1 + x2 + 28632 USABLE RULES: { 1..5 7..16 } Removed DPs: #2..5 #7 Number of SCCs: 1, DPs: 1 SCC { #8 } POLO(Sum)... succeeded. s w: 1 popout

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

job log

popout

actions

all output return to TRS Standard