details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	0.0460269451141 seconds
cpu usage	0.051600006
max memory	7966720.0

stage attributes

key	value
output-size	2539
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(map(),f),nil()) -> nil() 2: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 3: app(app(treemap(),f),app(app(node(),x),xs)) -> app(app(node(),app(f,x)),app(app(map(),app(treemap(),f)),xs)) Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying app 1: app^2_map(f,nil()) -> nil() 2: app^2_map(f,app^2_cons(x,xs)) -> app^2_cons(app(f,x),app^2_map(f,xs)) 3: app^2_treemap(f,app^2_node(x,xs)) -> app^2_node(app(f,x),app^2_map(app^1_treemap(f),xs)) 4: app(treemap(),_1) ->= app^1_treemap(_1) 5: app(app^1_treemap(_1),_2) ->= app^2_treemap(_1,_2) 6: app(cons(),_1) ->= app^1_cons(_1) 7: app(app^1_cons(_1),_2) ->= app^2_cons(_1,_2) 8: app(map(),_1) ->= app^1_map(_1) 9: app(app^1_map(_1),_2) ->= app^2_map(_1,_2) 10: app(node(),_1) ->= app^1_node(_1) 11: app(app^1_node(_1),_2) ->= app^2_node(_1,_2) Number of strict rules: 3 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #app^2_map(f,app^2_cons(x,xs)) -> #app(f,x) #2: #app^2_map(f,app^2_cons(x,xs)) -> #app^2_map(f,xs) #3: #app(app^1_map(_1),_2) ->? #app^2_map(_1,_2) #4: #app(app^1_treemap(_1),_2) ->? #app^2_treemap(_1,_2) #5: #app^2_treemap(f,app^2_node(x,xs)) -> #app(f,x) #6: #app^2_treemap(f,app^2_node(x,xs)) -> #app^2_map(app^1_treemap(f),xs) Number of SCCs: 1, DPs: 6 SCC { #1..6 } POLO(Sum)... succeeded. app^1_cons w: 0 #app^2_map w: x1 app^2_node w: 1 nil w: 0 app^1_treemap w: x1 + 1 app^2_treemap w: 0 #app w: x1 map w: 0 treemap w: 0 cons w: 0 #app^2_treemap w: x1 + 1 app^1_map w: x1 + 1 app^2_cons w: 1 node w: 0 app^2_map w: 0 app w: 0 app^1_node w: 0 USABLE RULES: { } Removed DPs: #3 #5 Number of SCCs: 1, DPs: 4 SCC { #1 #2 #4 #6 } POLO(Sum)... succeeded. app^1_cons w: 0 #app^2_map w: x1 + x2 + 1 app^2_node w: x2 + 3 nil w: 0 app^1_treemap w: 1 app^2_treemap w: 0 #app w: x2 + 1 map w: 0 treemap w: 0 cons w: 0 #app^2_treemap w: x2 app^1_map w: 1 app^2_cons w: x1 + x2 + 1 node w: 0 app^2_map w: 0 app w: 0 app^1_node w: 0 USABLE RULES: { } Removed DPs: #1 #2 #4 #6 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 Stand 20472