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	n029.star.cs.uiowa.edu
space	Applicative_first_order_05

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0776121616364 seconds
cpu usage	0.085474958
max memory	8675328.0

stage attributes

key	value
output-size	4367
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- 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: 1 false w: 1 true w: 1 filter2 w: 1 : w: 1 nil w: 1 #app w: x1 map w: 1 cons w: 1 filter w: 5 + w: 1 g w: 1 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: 1 true w: 2 filter2 w: 1 : w: 1 nil w: 1 #app w: x1 map w: 1 cons w: 3 filter w: 1 + w: 1 g w: 1 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 + 1) map w: 0 cons w: 0 filter w: 0 + w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472