details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0541570186615 seconds
cpu usage	0.063794692
max memory	1.0653696E7

stage attributes

key	value
output-size	4152
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: app(app(*(),x),app(app(+(),y),z)) -> app(app(+(),app(app(*(),x),y)),app(app(*(),x),z)) 2: app(app(map(),f),nil()) -> nil() 3: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 4: app(app(filter(),f),nil()) -> nil() 5: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 6: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 7: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_*(x,app^2_+(y,z)) -> app^2_+(app^2_*(x,y),app^2_*(x,z)) 2: app^2_map(f,nil()) -> nil() 3: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 4: app^2_filter(f,nil()) -> nil() 5: app^2_filter(f,app^2_cons(x,xs)) -> app^4_filter2(app(f,x),f,x,xs) 6: app^4_filter2(true(),f,x,xs) -> app^2_cons(x,app^2_filter(f,xs)) 7: app^4_filter2(false(),f,x,xs) -> app^2_filter(f,xs) 8: app(cons(),_1) ->= app^1_cons(_1) 9: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 10: app(filter(),_1) ->= app^1_filter(_1) 11: app(app^1_filter(_1),_2) ->= app^2_filter(_1,_2) 12: app(+(),_1) ->= app^1_+(_1) 13: app(app^1_+(_1),_2) ->= app^2_+(_1,_2) 14: app(map(),_1) ->= app^1_map(_1) 15: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 16: app(filter2(),_1) ->= app^1_filter2(_1) 17: app(app^1_filter2(_1),_2) ->= app^2_filter2(_1,_2) 18: app(app^2_filter2(_1,_2),_3) ->= app^3_filter2(_1,_2,_3) 19: app(app^3_filter2(_1,_2,_3),_4) ->= app^4_filter2(_1,_2,_3,_4) 20: app(*(),_1) ->= app^1_*(_1) 21: app(app^1_*(_1),_2) ->= app^2_*(_1,_2) Number of strict rules: 7 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^4_filter2(true(),f,x,xs) -> #app^2_filter(f,xs) #2: #app(app^1_filter(_1),_2) ->? #app^2_filter(_1,_2) #3: #app^4_filter2(false(),f,x,xs) -> #app^2_filter(f,xs) #4: #app^2_filter(f,app^2_cons(x,xs)) -> #app^4_filter2(app(f,x),f,x,xs) #5: #app^2_filter(f,app^2_cons(x,xs)) -> #app(f,x) #6: #app(app^3_filter2(_1,_2,_3),_4) ->? #app^4_filter2(_1,_2,_3,_4) #7: #app(app^1_*(_1),_2) ->? #app^2_*(_1,_2) #8: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #9: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) #10: #app^2_*(x,app^2_+(y,z)) -> #app^2_*(x,y) #11: #app^2_*(x,app^2_+(y,z)) -> #app^2_*(x,z) #12: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) Number of SCCs: 2, DPs: 10 SCC { #10 #11 } POLO(Sum)... succeeded. app^1_cons w: 0 app^1_+ w: 0 #app^2_map w: 0 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 0 app^1_* w: 0 app^2_* w: 0 app^1_filter2 w: 0 true w: 0 filter2 w: 0 #app^4_filter2 w: 0 nil w: 0 #app w: 0 map w: 0 app^1_filter w: 0 app^2_+ w: x1 + x2 + 1 cons w: 0 filter w: 0 + w: 0 app^3_filter2 w: 0 app^2_filter w: 0 app^1_map w: 0 app^2_cons w: 0 #app^2_* w: x2 app^2_map w: 0 #app^2_filter w: 0 * w: 0 app w: 0 USABLE RULES: { } Removed DPs: #10 #11 Number of SCCs: 1, DPs: 8 SCC { #1..3 #5 #6 #8 #9 #12 } POLO(Sum)... succeeded. app^1_cons w: 0 app^1_+ w: 0 #app^2_map w: x2 app^2_filter2 w: 0 app^4_filter2 w: 0 false w: 1 app^1_* w: 0 app^2_* w: 0 app^1_filter2 w: 0 popout

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

job log

popout

actions

all output return to TRS Stand 20472