details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	0.16833114624 seconds
cpu usage	0.11486727
max memory	1.2824576E7

stage attributes

key	value
output-size	6522
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: a(a(append(),nil()),ys) -> ys 2: a(a(append(),a(a(cons(),x),xs)),ys) -> a(a(cons(),x),a(a(append(),xs),ys)) 3: a(a(filter(),f),nil()) -> nil() 4: a(a(filter(),f),a(a(cons(),x),xs)) -> a(a(a(if(),a(f,x)),x),a(a(filter(),f),xs)) 5: a(a(le(),0()),y) -> true() 6: a(a(le(),a(s(),x)),0()) -> false() 7: a(a(le(),a(s(),x)),a(s(),y)) -> a(a(le(),x),y) 8: a(a(a(if(),true()),x),xs) -> a(a(cons(),x),xs) 9: a(a(a(if(),false()),x),xs) -> xs 10: a(a(not(),f),b) -> a(not2(),a(f,b)) 11: a(not2(),true()) -> false() 12: a(not2(),false()) -> true() 13: a(qs(),nil()) -> nil() 14: a(qs(),a(a(cons(),x),xs)) -> a(a(append(),a(qs(),a(a(filter(),a(le(),x)),xs))),a(a(cons(),x),a(qs(),a(a(filter(),a(not(),a(le(),x))),xs)))) Number of strict rules: 14 Direct poly ... failed. Freezing a 1: a❆2_append(nil(),ys) -> ys 2: a❆2_append(a❆2_cons(x,xs),ys) -> a❆2_cons(x,a❆2_append(xs,ys)) 3: a❆2_filter(f,nil()) -> nil() 4: a❆2_filter(f,a❆2_cons(x,xs)) -> a❆3_if(a(f,x),x,a❆2_filter(f,xs)) 5: a❆2_le(0(),y) -> true() 6: a❆2_le(a❆1_s(x),0()) -> false() 7: a❆2_le(a❆1_s(x),a❆1_s(y)) -> a❆2_le(x,y) 8: a❆3_if(true(),x,xs) -> a❆2_cons(x,xs) 9: a❆3_if(false(),x,xs) -> xs 10: a❆2_not(f,b) -> a❆1_not2(a(f,b)) 11: a❆1_not2(true()) -> false() 12: a❆1_not2(false()) -> true() 13: a❆1_qs(nil()) -> nil() 14: a❆1_qs(a❆2_cons(x,xs)) -> a❆2_append(a❆1_qs(a❆2_filter(a❆1_le(x),xs)),a❆2_cons(x,a❆1_qs(a❆2_filter(a❆1_not(a❆1_le(x)),xs)))) 15: a(qs(),_1) ->= a❆1_qs(_1) 16: a(le(),_1) ->= a❆1_le(_1) 17: a(a❆1_le(_1),_2) ->= a❆2_le(_1,_2) 18: a(append(),_1) ->= a❆1_append(_1) 19: a(a❆1_append(_1),_2) ->= a❆2_append(_1,_2) 20: a(if(),_1) ->= a❆1_if(_1) 21: a(a❆1_if(_1),_2) ->= a❆2_if(_1,_2) 22: a(a❆2_if(_1,_2),_3) ->= a❆3_if(_1,_2,_3) 23: a(cons(),_1) ->= a❆1_cons(_1) 24: a(a❆1_cons(_1),_2) ->= a❆2_cons(_1,_2) 25: a(s(),_1) ->= a❆1_s(_1) 26: a(filter(),_1) ->= a❆1_filter(_1) 27: a(a❆1_filter(_1),_2) ->= a❆2_filter(_1,_2) 28: a(not2(),_1) ->= a❆1_not2(_1) 29: a(not(),_1) ->= a❆1_not(_1) 30: a(a❆1_not(_1),_2) ->= a❆2_not(_1,_2) Number of strict rules: 14 Direct poly ... failed. Dependency Pairs: #1: #a❆2_append(a❆2_cons(x,xs),ys) -> #a❆2_append(xs,ys) #2: #a❆1_qs(a❆2_cons(x,xs)) -> #a❆2_append(a❆1_qs(a❆2_filter(a❆1_le(x),xs)),a❆2_cons(x,a❆1_qs(a❆2_filter(a❆1_not(a❆1_le(x)),xs)))) #3: #a❆1_qs(a❆2_cons(x,xs)) -> #a❆1_qs(a❆2_filter(a❆1_le(x),xs)) #4: #a❆1_qs(a❆2_cons(x,xs)) -> #a❆2_filter(a❆1_le(x),xs) #5: #a❆1_qs(a❆2_cons(x,xs)) -> #a❆1_qs(a❆2_filter(a❆1_not(a❆1_le(x)),xs)) #6: #a❆1_qs(a❆2_cons(x,xs)) -> #a❆2_filter(a❆1_not(a❆1_le(x)),xs) #7: #a(a❆1_not(_1),_2) ->? #a❆2_not(_1,_2) #8: #a❆2_le(a❆1_s(x),a❆1_s(y)) -> #a❆2_le(x,y) #9: #a❆2_not(f,b) -> #a❆1_not2(a(f,b)) #10: #a❆2_not(f,b) -> #a(f,b) #11: #a(not2(),_1) ->? #a❆1_not2(_1) #12: #a(a❆2_if(_1,_2),_3) ->? #a❆3_if(_1,_2,_3) #13: #a(a❆1_filter(_1),_2) ->? #a❆2_filter(_1,_2) #14: #a(a❆1_le(_1),_2) ->? #a❆2_le(_1,_2) #15: #a(a❆1_append(_1),_2) ->? #a❆2_append(_1,_2) #16: #a(qs(),_1) ->? #a❆1_qs(_1) #17: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a❆3_if(a(f,x),x,a❆2_filter(f,xs)) #18: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a(f,x) #19: #a❆2_filter(f,a❆2_cons(x,xs)) -> #a❆2_filter(f,xs) Number of SCCs: 3, DPs: 12 SCC { #8 } Sum... succeeded. a(x1,x2) w: (0) le() w: (0) a❆2_le(x1,x2) w: (0) a❆1_filter(x1) w: (0) a❆2_append(x1,x2) w: (0) #a❆3_if(x1,x2,x3) w: (0) s() w: (0) #a❆2_le(x1,x2) w: (x2 + x1) a❆3_if(x1,x2,x3) w: (0) false() w: (0) a❆1_cons(x1) w: (0) a❆1_qs(x1) w: (0) true() w: (0) a❆1_le(x1) w: (0) #a❆1_not2(x1) w: (0) a❆2_if(x1,x2) w: (0) qs() w: (0) a❆1_s(x1) w: (1 + x1) append() w: (0) a❆2_filter(x1,x2) w: (0) popout

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

job log

popout

actions

all output return to TRS Standard