details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	53.4053 seconds
cpu usage	53.37
user time	53.2
system time	0.17
max virtual memory	394084.0
max residence set size	8080.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE Input TRS: 1: zeros() -> cons(0(),n__zeros()) 2: U11(tt(),L) -> s(length(activate(L))) 3: and(tt(),X) -> activate(X) 4: isNat(n__0()) -> tt() 5: isNat(n__length(V1)) -> isNatList(activate(V1)) 6: isNat(n__s(V1)) -> isNat(activate(V1)) 7: isNatIList(V) -> isNatList(activate(V)) 8: isNatIList(n__zeros()) -> tt() 9: isNatIList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatIList(activate(V2))) 10: isNatList(n__nil()) -> tt() 11: isNatList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatList(activate(V2))) 12: length(nil()) -> 0() 13: length(cons(N,L)) -> U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) 14: zeros() -> n__zeros() 15: 0() -> n__0() 16: length(X) -> n__length(X) 17: s(X) -> n__s(X) 18: cons(X1,X2) -> n__cons(X1,X2) 19: isNatIList(X) -> n__isNatIList(X) 20: nil() -> n__nil() 21: isNatList(X) -> n__isNatList(X) 22: isNat(X) -> n__isNat(X) 23: activate(n__zeros()) -> zeros() 24: activate(n__0()) -> 0() 25: activate(n__length(X)) -> length(X) 26: activate(n__s(X)) -> s(X) 27: activate(n__cons(X1,X2)) -> cons(X1,X2) 28: activate(n__isNatIList(X)) -> isNatIList(X) 29: activate(n__nil()) -> nil() 30: activate(n__isNatList(X)) -> isNatList(X) 31: activate(n__isNat(X)) -> isNat(X) 32: activate(X) -> X Number of strict rules: 32 Direct POLO(bPol) ... removes: 8 10 7 12 isNatList w: x1 U11 w: x1 + x2 s w: x1 activate w: x1 and w: x1 + x2 n__zeros w: 0 isNatIList w: x1 + 2 zeros w: 0 n__nil w: 7579 n__s w: x1 0 w: 0 n__isNatList w: x1 n__cons w: x1 + 2 * x2 nil w: 7579 n__isNat w: x1 n__0 w: 0 n__length w: x1 isNat w: x1 cons w: x1 + 2 * x2 n__isNatIList w: x1 + 2 tt w: 0 length w: x1 Number of strict rules: 28 Direct POLO(bPol) ... removes: 5 isNatList w: x1 U11 w: x1 + x2 + 23641 s w: x1 activate w: x1 and w: x1 + x2 n__zeros w: 0 isNatIList w: x1 + 14264 zeros w: 0 n__nil w: 8641 n__s w: x1 0 w: 0 n__isNatList w: x1 n__cons w: x1 + 2 * x2 nil w: 8641 n__isNat w: x1 n__0 w: 0 n__length w: x1 + 23641 isNat w: x1 cons w: x1 + 2 * x2 n__isNatIList w: x1 + 14264 tt w: 0 length w: x1 + 23641 Number of strict rules: 27 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #U11(tt(),L) -> #s(length(activate(L))) #2: #U11(tt(),L) -> #length(activate(L)) #3: #U11(tt(),L) -> #activate(L) #4: #activate(n__nil()) -> #nil() #5: #isNat(n__s(V1)) -> #isNat(activate(V1)) #6: #isNat(n__s(V1)) -> #activate(V1) #7: #length(cons(N,L)) -> #U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) #8: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNat(N)) #9: #length(cons(N,L)) -> #isNatList(activate(L)) #10: #length(cons(N,L)) -> #activate(L) #11: #length(cons(N,L)) -> #activate(L) #12: #isNatIList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatIList(activate(V2))) #13: #isNatIList(n__cons(V1,V2)) -> #isNat(activate(V1)) #14: #isNatIList(n__cons(V1,V2)) -> #activate(V1) popout

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

job log

popout

actions

all output return to TRS Standard