details

property	value
status	complete
benchmark	emmes-nonloop-ex7_9.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n180.star.cs.uiowa.edu
space	EEG_IJCAR_12

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.563682 seconds
cpu usage	0.075883
user time	0.040095
system time	0.035788
max virtual memory	113188.0
max residence set size	6576.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: f(true(),xs) -> f(eq(s(length(xs)),length(cons(a(),xs))),append(cons(b(),nil()),xs)) 2: length(nil()) -> 0() 3: length(cons(x,xs)) -> s(length(xs)) 4: eq(0(),0()) -> true() 5: eq(s(x),0()) -> false() 6: eq(0(),s(y)) -> false() 7: eq(s(x),s(y)) -> eq(x,y) 8: append(xs,ys) -> appendAkk(reverse(xs),ys) 9: appendAkk(nil(),ys) -> ys 10: appendAkk(cons(x,xs),ys) -> appendAkk(xs,cons(x,ys)) 11: reverse(nil()) -> nil() 12: reverse(cons(x,xs)) -> append(reverse(xs),cons(x,nil())) Number of strict rules: 12 Direct POLO(bPol) ... failed. Uncurrying length eq 1: f(true(),xs) -> f(eq^1_s(length(xs),length^1_cons(a(),xs)),append(cons(b(),nil()),xs)) 2: length^1_nil() -> 0() 3: length^1_cons(x,xs) -> s(length(xs)) 4: eq^1_0(0()) -> true() 5: eq^1_s(x,0()) -> false() 6: eq^1_0(s(y)) -> false() 7: eq^1_s(x,s(y)) -> eq(x,y) 8: append(xs,ys) -> appendAkk(reverse(xs),ys) 9: appendAkk(nil(),ys) -> ys 10: appendAkk(cons(x,xs),ys) -> appendAkk(xs,cons(x,ys)) 11: reverse(nil()) -> nil() 12: reverse(cons(x,xs)) -> append(reverse(xs),cons(x,nil())) 13: eq(0(),_1) ->= eq^1_0(_1) 14: eq(s(_1),_2) ->= eq^1_s(_1,_2) 15: length(cons(_1,_2)) ->= length^1_cons(_1,_2) 16: length(nil()) ->= length^1_nil() Number of strict rules: 12 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #eq(0(),_1) ->? #eq^1_0(_1) #2: #reverse(cons(x,xs)) -> #append(reverse(xs),cons(x,nil())) #3: #reverse(cons(x,xs)) -> #reverse(xs) #4: #eq(s(_1),_2) ->? #eq^1_s(_1,_2) #5: #eq^1_s(x,s(y)) -> #eq(x,y) #6: #appendAkk(cons(x,xs),ys) -> #appendAkk(xs,cons(x,ys)) #7: #length(nil()) ->? #length^1_nil() #8: #length^1_cons(x,xs) -> #length(xs) #9: #f(true(),xs) -> #f(eq^1_s(length(xs),length^1_cons(a(),xs)),append(cons(b(),nil()),xs)) #10: #f(true(),xs) -> #eq^1_s(length(xs),length^1_cons(a(),xs)) #11: #f(true(),xs) -> #length(xs) #12: #f(true(),xs) -> #length^1_cons(a(),xs) #13: #f(true(),xs) -> #append(cons(b(),nil()),xs) #14: #append(xs,ys) -> #appendAkk(reverse(xs),ys) #15: #append(xs,ys) -> #reverse(xs) #16: #length(cons(_1,_2)) ->? #length^1_cons(_1,_2) Number of SCCs: 5, DPs: 9 SCC { #6 } POLO(Sum)... succeeded. a w: 0 #eq^1_s w: 0 s w: 0 eq^1_s w: 0 length^1_nil w: 0 #append w: 0 #reverse w: 0 b w: 0 #eq^1_0 w: 0 eq w: 0 false w: 0 appendAkk w: 0 reverse w: 0 #length^1_cons w: 0 true w: 0 f w: 0 #eq w: 0 append w: 0 0 w: 0 eq^1_0 w: 0 length^1_cons w: 0 nil w: 0 #f w: 0 #length^1_nil w: 0 cons w: x2 + 1 length w: 0 #length w: 0 #appendAkk w: x1 USABLE RULES: { } Removed DPs: #6 Number of SCCs: 4, DPs: 8 SCC { #8 #16 } POLO(Sum)... succeeded. a w: 0 #eq^1_s w: 0 s w: 0 eq^1_s w: 0 length^1_nil w: 0 #append w: 0 #reverse w: 0 b w: 0 #eq^1_0 w: 0 eq w: 0 false w: 0 appendAkk w: 0 popout

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

job log

popout

actions

all output return to TRS Standard