details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.123026847839 seconds
cpu usage	0.054399996
max memory	9293824.0

stage attributes

key	value
output-size	2739
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(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(app(comp(),f),g),x) -> app(f,app(g,x)) 4: app(twice(),f) -> app(app(comp(),f),f) Number of strict rules: 4 Direct poly ... failed. Freezing 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❆3_comp(f,g,x) -> app(f,app(g,x)) 4: app❆1_twice(f) -> app❆2_comp(f,f) 5: app(cons(),_1) ->= app❆1_cons(_1) 6: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2) 7: app(twice(),_1) ->= app❆1_twice(_1) 8: app(map(),_1) ->= app❆1_map(_1) 9: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2) 10: app(comp(),_1) ->= app❆1_comp(_1) 11: app(app❆1_comp(_1),_2) ->= app❆2_comp(_1,_2) 12: app(app❆2_comp(_1,_2),_3) ->= app❆3_comp(_1,_2,_3) Number of strict rules: 4 Direct poly ... 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❆2_comp(_1,_2),_3) ->? #app❆3_comp(_1,_2,_3) #5: #app(twice(),_1) ->? #app❆1_twice(_1) #6: #app❆3_comp(f,g,x) -> #app(f,app(g,x)) #7: #app❆3_comp(f,g,x) -> #app(g,x) Number of SCCs: 1, DPs: 6 SCC { #1..4 #6 #7 } Sum... succeeded. #app❆2_map(x1,x2) w: (21239 + x1) app❆1_map(x1) w: (2 + x1) twice() w: (1) app❆2_comp(x1,x2) w: (3 + x2 + x1) app❆2_map(x1,x2) w: (2 + x1) app❆1_comp(x1) w: (2 + x1) nil() w: (3) #app(x1,x2) w: (21238 + x1) map() w: (1) #app❆3_comp(x1,x2,x3) w: (21239 + x2 + x1) cons() w: (1) app❆2_cons(x1,x2) w: (3) #app❆1_twice(x1) w: (0) app❆3_comp(x1,x2,x3) w: (2 + x2) app❆1_cons(x1) w: (2 + x1) app❆1_twice(x1) w: (2 + x1) comp() w: (1) app(x1,x2) w: (1) USABLE RULES: { } Removed DPs: #1 #3 #4 #6 #7 Number of SCCs: 1, DPs: 1 SCC { #2 } Sum... succeeded. #app❆2_map(x1,x2) w: (21239 + x2) app❆1_map(x1) w: (2 + x1) twice() w: (1) app❆2_comp(x1,x2) w: (3 + x2 + x1) app❆2_map(x1,x2) w: (2 + x1) app❆1_comp(x1) w: (2 + x1) nil() w: (1) #app(x1,x2) w: (21238) map() w: (1) #app❆3_comp(x1,x2,x3) w: (21239) cons() w: (1) app❆2_cons(x1,x2) w: (3 + x2) #app❆1_twice(x1) w: (0) app❆3_comp(x1,x2,x3) w: (2 + x2) app❆1_cons(x1) w: (2 + x1) app❆1_twice(x1) w: (2 + x1) comp() w: (1) app(x1,x2) w: (1) USABLE RULES: { 1 } Removed DPs: #2 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