details

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

run statistics

property	value
solver	NaTT 2.1
configuration	default
runtime (wallclock)	1.83879995346 seconds
cpu usage	1.918442717
max memory	4.6727168E7

stage attributes

key	value
output-size	9367
starexec-result	MAYBE

output

/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: eq(0(),0()) -> true() 2: eq(0(),s(y)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: lt(0(),s(y)) -> true() 6: lt(x,0()) -> false() 7: lt(s(x),s(y)) -> lt(x,y) 8: bin2s(nil()) -> 0() 9: bin2s(cons(x,xs)) -> bin2ss(x,xs) 10: bin2ss(x,nil()) -> x 11: bin2ss(x,cons(0(),xs)) -> bin2ss(double(x),xs) 12: bin2ss(x,cons(1(),xs)) -> bin2ss(s(double(x)),xs) 13: half(0()) -> 0() 14: half(s(0())) -> 0() 15: half(s(s(x))) -> s(half(x)) 16: log(0()) -> 0() 17: log(s(0())) -> 0() 18: log(s(s(x))) -> s(log(half(s(s(x))))) 19: more(nil()) -> nil() 20: more(cons(xs,ys)) -> cons(cons(0(),xs),cons(cons(1(),xs),cons(xs,ys))) 21: s2bin(x) -> s2bin1(x,0(),cons(nil(),nil())) 22: s2bin1(x,y,lists) -> if1(lt(y,log(x)),x,y,lists) 23: if1(true(),x,y,lists) -> s2bin1(x,s(y),more(lists)) 24: if1(false(),x,y,lists) -> s2bin2(x,lists) 25: s2bin2(x,nil()) -> bug_list_not() 26: s2bin2(x,cons(xs,ys)) -> if2(eq(x,bin2s(xs)),x,xs,ys) 27: if2(true(),x,xs,ys) -> xs 28: if2(false(),x,xs,ys) -> s2bin2(x,ys) Number of strict rules: 28 Direct poly ... failed. Freezing half 1: eq(0(),0()) -> true() 2: eq(0(),s(y)) -> false() 3: eq(s(x),0()) -> false() 4: eq(s(x),s(y)) -> eq(x,y) 5: lt(0(),s(y)) -> true() 6: lt(x,0()) -> false() 7: lt(s(x),s(y)) -> lt(x,y) 8: bin2s(nil()) -> 0() 9: bin2s(cons(x,xs)) -> bin2ss(x,xs) 10: bin2ss(x,nil()) -> x 11: bin2ss(x,cons(0(),xs)) -> bin2ss(double(x),xs) 12: bin2ss(x,cons(1(),xs)) -> bin2ss(s(double(x)),xs) 13: half❆1_0() -> 0() 14: half❆1_s(0()) -> 0() 15: half❆1_s(s(x)) -> s(half(x)) 16: log(0()) -> 0() 17: log(s(0())) -> 0() 18: log(s(s(x))) -> s(log(half❆1_s(s(x)))) 19: more(nil()) -> nil() 20: more(cons(xs,ys)) -> cons(cons(0(),xs),cons(cons(1(),xs),cons(xs,ys))) 21: s2bin(x) -> s2bin1(x,0(),cons(nil(),nil())) 22: s2bin1(x,y,lists) -> if1(lt(y,log(x)),x,y,lists) 23: if1(true(),x,y,lists) -> s2bin1(x,s(y),more(lists)) 24: if1(false(),x,y,lists) -> s2bin2(x,lists) 25: s2bin2(x,nil()) -> bug_list_not() 26: s2bin2(x,cons(xs,ys)) -> if2(eq(x,bin2s(xs)),x,xs,ys) 27: if2(true(),x,xs,ys) -> xs 28: if2(false(),x,xs,ys) -> s2bin2(x,ys) 29: half(0()) ->= half❆1_0() 30: half(s(_1)) ->= half❆1_s(_1) Number of strict rules: 28 Direct poly ... failed. Dependency Pairs: #1: #half(0()) ->? #half❆1_0() #2: #bin2s(cons(x,xs)) -> #bin2ss(x,xs) #3: #bin2ss(x,cons(0(),xs)) -> #bin2ss(double(x),xs) #4: #if1(false(),x,y,lists) -> #s2bin2(x,lists) #5: #if1(true(),x,y,lists) -> #s2bin1(x,s(y),more(lists)) #6: #if1(true(),x,y,lists) -> #more(lists) #7: #bin2ss(x,cons(1(),xs)) -> #bin2ss(s(double(x)),xs) #8: #half(s(_1)) ->? #half❆1_s(_1) #9: #lt(s(x),s(y)) -> #lt(x,y) #10: #if2(false(),x,xs,ys) -> #s2bin2(x,ys) #11: #s2bin1(x,y,lists) -> #if1(lt(y,log(x)),x,y,lists) #12: #s2bin1(x,y,lists) -> #lt(y,log(x)) #13: #s2bin1(x,y,lists) -> #log(x) #14: #s2bin2(x,cons(xs,ys)) -> #if2(eq(x,bin2s(xs)),x,xs,ys) #15: #s2bin2(x,cons(xs,ys)) -> #eq(x,bin2s(xs)) #16: #s2bin2(x,cons(xs,ys)) -> #bin2s(xs) #17: #s2bin(x) -> #s2bin1(x,0(),cons(nil(),nil())) #18: #half❆1_s(s(x)) -> #half(x) #19: #eq(s(x),s(y)) -> #eq(x,y) #20: #log(s(s(x))) -> #log(half❆1_s(s(x))) #21: #log(s(s(x))) -> #half❆1_s(s(x)) Number of SCCs: 7, DPs: 11 SCC { #9 } Sum... succeeded. bin2ss(x1,x2) w: (0) 1() w: (0) #s2bin1(x1,x2,x3) w: (0) s(x1) w: (1 + x1) popout

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

job log

popout

actions

all output return to TRS Standard