details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.18805 seconds
cpu usage	0.043481
user time	0.029366
system time	0.014115
max virtual memory	113188.0
max residence set size	6296.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: sub(0(),0()) -> 0() 2: sub(s(x),0()) -> s(x) 3: sub(0(),s(x)) -> 0() 4: sub(s(x),s(y)) -> sub(x,y) 5: zero(nil()) -> zero2(0(),nil()) 6: zero(cons(x,xs)) -> zero2(sub(x,x),cons(x,xs)) 7: zero2(0(),nil()) -> nil() 8: zero2(0(),cons(x,xs)) -> cons(sub(x,x),zero(xs)) 9: zero2(s(y),nil()) -> zero(nil()) 10: zero2(s(y),cons(x,xs)) -> zero(cons(x,xs)) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying zero2 zero 1: sub(0(),0()) -> 0() 2: sub(s(x),0()) -> s(x) 3: sub(0(),s(x)) -> 0() 4: sub(s(x),s(y)) -> sub(x,y) 5: zero^1_nil() -> zero2^1_0(nil()) 6: zero^1_cons(x,xs) -> zero2(sub(x,x),cons(x,xs)) 7: zero2^1_0(nil()) -> nil() 8: zero2^1_0(cons(x,xs)) -> cons(sub(x,x),zero(xs)) 9: zero2^1_s(y,nil()) -> zero^1_nil() 10: zero2^1_s(y,cons(x,xs)) -> zero^1_cons(x,xs) 11: zero(cons(_1,_2)) ->= zero^1_cons(_1,_2) 12: zero(nil()) ->= zero^1_nil() 13: zero2(0(),_1) ->= zero2^1_0(_1) 14: zero2(s(_1),_2) ->= zero2^1_s(_1,_2) Number of strict rules: 10 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #zero^1_cons(x,xs) -> #zero2(sub(x,x),cons(x,xs)) #2: #zero^1_cons(x,xs) -> #sub(x,x) #3: #zero2(0(),_1) ->? #zero2^1_0(_1) #4: #zero2^1_s(y,nil()) -> #zero^1_nil() #5: #zero(cons(_1,_2)) ->? #zero^1_cons(_1,_2) #6: #zero(nil()) ->? #zero^1_nil() #7: #zero2(s(_1),_2) ->? #zero2^1_s(_1,_2) #8: #zero2^1_s(y,cons(x,xs)) -> #zero^1_cons(x,xs) #9: #zero^1_nil() -> #zero2^1_0(nil()) #10: #zero2^1_0(cons(x,xs)) -> #sub(x,x) #11: #zero2^1_0(cons(x,xs)) -> #zero(xs) #12: #sub(s(x),s(y)) -> #sub(x,y) Number of SCCs: 2, DPs: 7 SCC { #12 } POLO(Sum)... succeeded. zero w: 0 zero2^1_s w: 0 s w: x1 + 1 #zero2^1_0 w: 0 zero^1_cons w: 0 zero^1_nil w: 0 #zero2^1_s w: 0 sub w: 0 #sub w: x2 zero2 w: 0 0 w: 0 zero2^1_0 w: 0 nil w: 0 #zero^1_cons w: 0 #zero^1_nil w: 0 cons w: 0 #zero w: 0 #zero2 w: 0 USABLE RULES: { } Removed DPs: #12 Number of SCCs: 1, DPs: 6 SCC { #1 #3 #5 #7 #8 #11 } POLO(Sum)... succeeded. zero w: 0 zero2^1_s w: 0 s w: x1 + 2 #zero2^1_0 w: x1 zero^1_cons w: 0 zero^1_nil w: 0 #zero2^1_s w: x2 + 1 sub w: 1 #sub w: 0 zero2 w: 0 0 w: 2 zero2^1_0 w: 0 nil w: 0 #zero^1_cons w: x1 + x2 + 4 #zero^1_nil w: 0 cons w: x1 + x2 + 3 #zero w: x1 + 2 #zero2 w: x2 + 1 USABLE RULES: { } Removed DPs: #3 #5 #11 Number of SCCs: 1, DPs: 3 SCC { #1 #7 #8 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... 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