details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.127141952515 seconds
cpu usage	0.089316002
max memory	1.1743232E7

stage attributes

key	value
output-size	5648
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(ack(),0()),y) -> app(succ(),y) 2: app(app(ack(),app(succ(),x)),y) -> app(app(ack(),x),app(succ(),0())) 3: app(app(ack(),app(succ(),x)),app(succ(),y)) -> app(app(ack(),x),app(app(ack(),app(succ(),x)),y)) 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 poly ... failed. Freezing app 1: app❆2_ack(0(),y) -> app❆1_succ(y) 2: app❆2_ack(app❆1_succ(x),y) -> app❆2_ack(x,app❆1_succ(0())) 3: app❆2_ack(app❆1_succ(x),app❆1_succ(y)) -> app❆2_ack(x,app❆2_ack(app❆1_succ(x),y)) 4: app❆2_map(f,nil()) -> nil() 5: app❆2_map(f,app❆2_cons(x,xs)) -> app❆2_cons(app(f,x),app❆2_map(f,xs)) 6: app❆2_filter(f,nil()) -> nil() 7: app❆2_filter(f,app❆2_cons(x,xs)) -> app❆4_filter2(app(f,x),f,x,xs) 8: app❆4_filter2(true(),f,x,xs) -> app❆2_cons(x,app❆2_filter(f,xs)) 9: app❆4_filter2(false(),f,x,xs) -> app❆2_filter(f,xs) 10: app(cons(),_1) ->= app❆1_cons(_1) 11: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2) 12: app(succ(),_1) ->= app❆1_succ(_1) 13: app(filter(),_1) ->= app❆1_filter(_1) 14: app(app❆1_filter(_1),_2) ->= app❆2_filter(_1,_2) 15: app(map(),_1) ->= app❆1_map(_1) 16: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2) 17: app(ack(),_1) ->= app❆1_ack(_1) 18: app(app❆1_ack(_1),_2) ->= app❆2_ack(_1,_2) 19: app(filter2(),_1) ->= app❆1_filter2(_1) 20: app(app❆1_filter2(_1),_2) ->= app❆2_filter2(_1,_2) 21: app(app❆2_filter2(_1,_2),_3) ->= app❆3_filter2(_1,_2,_3) 22: app(app❆3_filter2(_1,_2,_3),_4) ->= app❆4_filter2(_1,_2,_3,_4) Number of strict rules: 9 Direct poly ... failed. Dependency Pairs: #1: #app❆2_ack(app❆1_succ(x),y) -> #app❆2_ack(x,app❆1_succ(0())) #2: #app❆4_filter2(false(),f,x,xs) -> #app❆2_filter(f,xs) #3: #app(app❆1_filter(_1),_2) ->? #app❆2_filter(_1,_2) #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❆2_map(f,app❆2_cons(x,xs)) -> #app(f,x) #7: #app❆2_map(f,app❆2_cons(x,xs)) -> #app❆2_map(f,xs) #8: #app(app❆3_filter2(_1,_2,_3),_4) ->? #app❆4_filter2(_1,_2,_3,_4) #9: #app(app❆1_map(_1),_2) ->? #app❆2_map(_1,_2) #10: #app❆2_ack(app❆1_succ(x),app❆1_succ(y)) -> #app❆2_ack(x,app❆2_ack(app❆1_succ(x),y)) #11: #app❆2_ack(app❆1_succ(x),app❆1_succ(y)) -> #app❆2_ack(app❆1_succ(x),y) #12: #app❆4_filter2(true(),f,x,xs) -> #app❆2_filter(f,xs) #13: #app(app❆1_ack(_1),_2) ->? #app❆2_ack(_1,_2) Number of SCCs: 2, DPs: 11 SCC { #1 #10 #11 } Sum... succeeded. app❆2_ack(x1,x2) w: (8857 + x2) #app❆2_map(x1,x2) w: (0) app❆1_succ(x1) w: (8856 + x1) app❆1_map(x1) w: (0) ack() w: (0) app❆4_filter2(x1,x2,x3,x4) w: (0) app❆2_map(x1,x2) w: (0) false() w: (0) true() w: (0) app❆1_ack(x1) w: (0) filter2() w: (0) app❆2_filter(x1,x2) w: (0) 0() w: (1) succ() w: (0) nil() w: (0) app❆1_filter(x1) w: (0) #app❆2_ack(x1,x2) w: (x1) #app(x1,x2) w: (0) map() w: (0) #app❆4_filter2(x1,x2,x3,x4) w: (0) app❆2_filter2(x1,x2) w: (0) #app❆2_filter(x1,x2) w: (0) cons() w: (0) app❆2_cons(x1,x2) w: (0) filter() w: (0) app❆1_filter2(x1) w: (0) app❆1_cons(x1) w: (0) app❆3_filter2(x1,x2,x3) w: (0) app(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 #10 Number of SCCs: 2, DPs: 9 SCC { #11 } Sum... Max... succeeded. app❆2_ack(x1,x2) w: (0) #app❆2_map(x1,x2) w: (0) app❆1_succ(x1) w: (1 + x1) app❆1_map(x1) w: (0) ack() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard