details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.1612200737 seconds
cpu usage	0.100874724
max memory	1.1776E7

stage attributes

key	value
output-size	6617
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(pred(),app(s(),x)) -> x 2: app(app(minus(),x),0()) -> x 3: app(app(minus(),x),app(s(),y)) -> app(pred(),app(app(minus(),x),y)) 4: app(app(quot(),0()),app(s(),y)) -> 0() 5: app(app(quot(),app(s(),x)),app(s(),y)) -> app(s(),app(app(quot(),app(app(minus(),x),y)),app(s(),y))) 6: app(app(map(),f),nil()) -> nil() 7: app(app(map(),f),app(app(cons(),x),xs)) -> app(app(cons(),app(f,x)),app(app(map(),f),xs)) 8: app(app(filter(),f),nil()) -> nil() 9: app(app(filter(),f),app(app(cons(),x),xs)) -> app(app(app(app(filter2(),app(f,x)),f),x),xs) 10: app(app(app(app(filter2(),true()),f),x),xs) -> app(app(cons(),x),app(app(filter(),f),xs)) 11: app(app(app(app(filter2(),false()),f),x),xs) -> app(app(filter(),f),xs) Number of strict rules: 11 Direct poly ... failed. Freezing app 1: app❆1_pred(app❆1_s(x)) -> x 2: app❆2_minus(x,0()) -> x 3: app❆2_minus(x,app❆1_s(y)) -> app❆1_pred(app❆2_minus(x,y)) 4: app❆2_quot(0(),app❆1_s(y)) -> 0() 5: app❆2_quot(app❆1_s(x),app❆1_s(y)) -> app❆1_s(app❆2_quot(app❆2_minus(x,y),app❆1_s(y))) 6: app❆2_map(f,nil()) -> nil() 7: app❆2_map(f,app❆2_cons(x,xs)) -> app❆2_cons(app(f,x),app❆2_map(f,xs)) 8: app❆2_filter(f,nil()) -> nil() 9: app❆2_filter(f,app❆2_cons(x,xs)) -> app❆4_filter2(app(f,x),f,x,xs) 10: app❆4_filter2(true(),f,x,xs) -> app❆2_cons(x,app❆2_filter(f,xs)) 11: app❆4_filter2(false(),f,x,xs) -> app❆2_filter(f,xs) 12: app(cons(),_1) ->= app❆1_cons(_1) 13: app(app❆1_cons(_1),_2) ->= app❆2_cons(_1,_2) 14: app(quot(),_1) ->= app❆1_quot(_1) 15: app(app❆1_quot(_1),_2) ->= app❆2_quot(_1,_2) 16: app(s(),_1) ->= app❆1_s(_1) 17: app(filter(),_1) ->= app❆1_filter(_1) 18: app(app❆1_filter(_1),_2) ->= app❆2_filter(_1,_2) 19: app(map(),_1) ->= app❆1_map(_1) 20: app(app❆1_map(_1),_2) ->= app❆2_map(_1,_2) 21: app(minus(),_1) ->= app❆1_minus(_1) 22: app(app❆1_minus(_1),_2) ->= app❆2_minus(_1,_2) 23: app(pred(),_1) ->= app❆1_pred(_1) 24: app(filter2(),_1) ->= app❆1_filter2(_1) 25: app(app❆1_filter2(_1),_2) ->= app❆2_filter2(_1,_2) 26: app(app❆2_filter2(_1,_2),_3) ->= app❆3_filter2(_1,_2,_3) 27: app(app❆3_filter2(_1,_2,_3),_4) ->= app❆4_filter2(_1,_2,_3,_4) Number of strict rules: 11 Direct poly ... failed. Dependency Pairs: #1: #app❆2_filter(f,app❆2_cons(x,xs)) -> #app❆4_filter2(app(f,x),f,x,xs) #2: #app❆2_filter(f,app❆2_cons(x,xs)) -> #app(f,x) #3: #app❆4_filter2(false(),f,x,xs) -> #app❆2_filter(f,xs) #4: #app(pred(),_1) ->? #app❆1_pred(_1) #5: #app(app❆1_map(_1),_2) ->? #app❆2_map(_1,_2) #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❆4_filter2(true(),f,x,xs) -> #app❆2_filter(f,xs) #9: #app❆2_quot(app❆1_s(x),app❆1_s(y)) -> #app❆2_quot(app❆2_minus(x,y),app❆1_s(y)) #10: #app❆2_quot(app❆1_s(x),app❆1_s(y)) -> #app❆2_minus(x,y) #11: #app(app❆1_minus(_1),_2) ->? #app❆2_minus(_1,_2) #12: #app(app❆3_filter2(_1,_2,_3),_4) ->? #app❆4_filter2(_1,_2,_3,_4) #13: #app❆2_minus(x,app❆1_s(y)) -> #app❆1_pred(app❆2_minus(x,y)) #14: #app❆2_minus(x,app❆1_s(y)) -> #app❆2_minus(x,y) #15: #app(app❆1_quot(_1),_2) ->? #app❆2_quot(_1,_2) #16: #app(app❆1_filter(_1),_2) ->? #app❆2_filter(_1,_2) Number of SCCs: 3, DPs: 11 SCC { #14 } Sum... succeeded. app❆2_minus(x1,x2) w: (0) app❆1_pred(x1) w: (0) #app❆2_map(x1,x2) w: (0) s() w: (0) app❆1_map(x1) w: (0) app❆1_minus(x1) w: (0) #app❆2_quot(x1,x2) w: (0) minus() w: (0) app❆4_filter2(x1,x2,x3,x4) w: (0) app❆2_map(x1,x2) w: (0) #app❆2_minus(x1,x2) w: (x2) false() w: (0) app❆1_quot(x1) w: (0) true() w: (0) #app❆1_pred(x1) w: (0) pred() w: (0) filter2() w: (0) app❆2_filter(x1,x2) w: (0) 0() w: (0) quot() w: (0) nil() w: (0) app❆1_filter(x1) w: (0) #app(x1,x2) w: (0) map() w: (0) #app❆4_filter2(x1,x2,x3,x4) w: (0) app❆2_quot(x1,x2) w: (0) app❆2_filter2(x1,x2) w: (0) #app❆2_filter(x1,x2) w: (0) cons() w: (0) popout

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

job log

popout

actions

all output return to TRS Standard