details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	36.5461699963 seconds
cpu usage	42.919721084
max memory	3.98995456E8

stage attributes

key	value
output-size	2651
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: isEmpty(empty()) -> true() 2: isEmpty(node(l,x,r)) -> false() 3: left(empty()) -> empty() 4: left(node(l,x,r)) -> l 5: right(empty()) -> empty() 6: right(node(l,x,r)) -> r 7: elem(node(l,x,r)) -> x 8: append(nil(),x) -> cons(x,nil()) 9: append(cons(y(),ys),x) -> cons(y(),append(ys,x)) 10: listify(n,xs) -> if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),elem(left(n)),node(right(left(n)),elem(n),right(n))),xs,append(xs,n)) 11: if(true(),b,n,m,xs,ys) -> xs 12: if(false(),false(),n,m,xs,ys) -> listify(m,xs) 13: if(false(),true(),n,m,xs,ys) -> listify(n,ys) 14: toList(n) -> listify(n,nil()) Number of strict rules: 14 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #if(false(),true(),n,m,xs,ys) -> #listify(n,ys) #2: #append(cons(y(),ys),x) -> #append(ys,x) #3: #if(false(),false(),n,m,xs,ys) -> #listify(m,xs) #4: #toList(n) -> #listify(n,nil()) #5: #listify(n,xs) -> #if(isEmpty(n),isEmpty(left(n)),right(n),node(left(left(n)),elem(left(n)),node(right(left(n)),elem(n),right(n))),xs,append(xs,n)) #6: #listify(n,xs) -> #isEmpty(n) #7: #listify(n,xs) -> #isEmpty(left(n)) #8: #listify(n,xs) -> #left(n) #9: #listify(n,xs) -> #right(n) #10: #listify(n,xs) -> #left(left(n)) #11: #listify(n,xs) -> #left(n) #12: #listify(n,xs) -> #elem(left(n)) #13: #listify(n,xs) -> #left(n) #14: #listify(n,xs) -> #right(left(n)) #15: #listify(n,xs) -> #left(n) #16: #listify(n,xs) -> #elem(n) #17: #listify(n,xs) -> #right(n) #18: #listify(n,xs) -> #append(xs,n) Number of SCCs: 2, DPs: 4 SCC { #2 } Sum... succeeded. #left(x1) w: (0) left(x1) w: (0) #append(x1,x2) w: (x1) elem(x1) w: (0) y() w: (1) #isEmpty(x1) w: (0) false() w: (0) isEmpty(x1) w: (0) true() w: (0) #listify(x1,x2) w: (0) toList(x1) w: (0) append(x1,x2) w: (0) if(x1,x2,x3,x4,x5,x6) w: (0) #toList(x1) w: (0) nil() w: (0) #elem(x1) w: (0) right(x1) w: (0) cons(x1,x2) w: (x2 + x1) #if(x1,x2,x3,x4,x5,x6) w: (0) empty() w: (0) #right(x1) w: (0) listify(x1,x2) w: (0) node(x1,x2,x3) w: (0) USABLE RULES: { } Removed DPs: #2 Number of SCCs: 1, DPs: 3 SCC { #1 #3 #5 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed. popout

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

job log

popout

actions

all output return to TRS Standard