details

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

run statistics

property	value
solver	NaTT
configuration	Default
runtime (wallclock)	1.69045901299 seconds
cpu usage	1.872575953
max memory	4.2233856E7

stage attributes

key	value
output-size	9953
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: and(tt(),T) -> T 2: isNatIList(IL) -> isNatList(activate(IL)) 3: isNat(n__0()) -> tt() 4: isNat(n__s(N)) -> isNat(activate(N)) 5: isNat(n__length(L)) -> isNatList(activate(L)) 6: isNatIList(n__zeros()) -> tt() 7: isNatIList(n__cons(N,IL)) -> and(isNat(activate(N)),isNatIList(activate(IL))) 8: isNatList(n__nil()) -> tt() 9: isNatList(n__cons(N,L)) -> and(isNat(activate(N)),isNatList(activate(L))) 10: isNatList(n__take(N,IL)) -> and(isNat(activate(N)),isNatIList(activate(IL))) 11: zeros() -> cons(0(),n__zeros()) 12: take(0(),IL) -> uTake1(isNatIList(IL)) 13: uTake1(tt()) -> nil() 14: take(s(M),cons(N,IL)) -> uTake2(and(isNat(M),and(isNat(N),isNatIList(activate(IL)))),M,N,activate(IL)) 15: uTake2(tt(),M,N,IL) -> cons(activate(N),n__take(activate(M),activate(IL))) 16: length(cons(N,L)) -> uLength(and(isNat(N),isNatList(activate(L))),activate(L)) 17: uLength(tt(),L) -> s(length(activate(L))) 18: 0() -> n__0() 19: s(X) -> n__s(X) 20: length(X) -> n__length(X) 21: zeros() -> n__zeros() 22: cons(X1,X2) -> n__cons(X1,X2) 23: nil() -> n__nil() 24: take(X1,X2) -> n__take(X1,X2) 25: activate(n__0()) -> 0() 26: activate(n__s(X)) -> s(activate(X)) 27: activate(n__length(X)) -> length(activate(X)) 28: activate(n__zeros()) -> zeros() 29: activate(n__cons(X1,X2)) -> cons(activate(X1),X2) 30: activate(n__nil()) -> nil() 31: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) 32: activate(X) -> X Number of strict rules: 32 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #isNatIList(IL) -> #isNatList(activate(IL)) #2: #isNatIList(IL) -> #activate(IL) #3: #activate(n__cons(X1,X2)) -> #cons(activate(X1),X2) #4: #activate(n__cons(X1,X2)) -> #activate(X1) #5: #uTake1(tt()) -> #nil() #6: #isNatList(n__cons(N,L)) -> #and(isNat(activate(N)),isNatList(activate(L))) #7: #isNatList(n__cons(N,L)) -> #isNat(activate(N)) #8: #isNatList(n__cons(N,L)) -> #activate(N) #9: #isNatList(n__cons(N,L)) -> #isNatList(activate(L)) #10: #isNatList(n__cons(N,L)) -> #activate(L) #11: #zeros() -> #cons(0(),n__zeros()) #12: #zeros() -> #0() #13: #take(0(),IL) -> #uTake1(isNatIList(IL)) #14: #take(0(),IL) -> #isNatIList(IL) #15: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2)) #16: #activate(n__take(X1,X2)) -> #activate(X1) #17: #activate(n__take(X1,X2)) -> #activate(X2) #18: #take(s(M),cons(N,IL)) -> #uTake2(and(isNat(M),and(isNat(N),isNatIList(activate(IL)))),M,N,activate(IL)) #19: #take(s(M),cons(N,IL)) -> #and(isNat(M),and(isNat(N),isNatIList(activate(IL)))) #20: #take(s(M),cons(N,IL)) -> #isNat(M) #21: #take(s(M),cons(N,IL)) -> #and(isNat(N),isNatIList(activate(IL))) #22: #take(s(M),cons(N,IL)) -> #isNat(N) #23: #take(s(M),cons(N,IL)) -> #isNatIList(activate(IL)) #24: #take(s(M),cons(N,IL)) -> #activate(IL) #25: #take(s(M),cons(N,IL)) -> #activate(IL) #26: #activate(n__nil()) -> #nil() #27: #activate(n__0()) -> #0() #28: #isNatIList(n__cons(N,IL)) -> #and(isNat(activate(N)),isNatIList(activate(IL))) #29: #isNatIList(n__cons(N,IL)) -> #isNat(activate(N)) #30: #isNatIList(n__cons(N,IL)) -> #activate(N) #31: #isNatIList(n__cons(N,IL)) -> #isNatIList(activate(IL)) #32: #isNatIList(n__cons(N,IL)) -> #activate(IL) #33: #isNatList(n__take(N,IL)) -> #and(isNat(activate(N)),isNatIList(activate(IL))) #34: #isNatList(n__take(N,IL)) -> #isNat(activate(N)) #35: #isNatList(n__take(N,IL)) -> #activate(N) #36: #isNatList(n__take(N,IL)) -> #isNatIList(activate(IL)) #37: #isNatList(n__take(N,IL)) -> #activate(IL) #38: #isNat(n__length(L)) -> #isNatList(activate(L)) #39: #isNat(n__length(L)) -> #activate(L) #40: #activate(n__zeros()) -> #zeros() #41: #activate(n__length(X)) -> #length(activate(X)) #42: #activate(n__length(X)) -> #activate(X) #43: #uLength(tt(),L) -> #s(length(activate(L))) #44: #uLength(tt(),L) -> #length(activate(L)) #45: #uLength(tt(),L) -> #activate(L) #46: #activate(n__s(X)) -> #s(activate(X)) #47: #activate(n__s(X)) -> #activate(X) #48: #length(cons(N,L)) -> #uLength(and(isNat(N),isNatList(activate(L))),activate(L)) #49: #length(cons(N,L)) -> #and(isNat(N),isNatList(activate(L))) #50: #length(cons(N,L)) -> #isNat(N) #51: #length(cons(N,L)) -> #isNatList(activate(L)) #52: #length(cons(N,L)) -> #activate(L) #53: #length(cons(N,L)) -> #activate(L) #54: #uTake2(tt(),M,N,IL) -> #cons(activate(N),n__take(activate(M),activate(IL))) #55: #uTake2(tt(),M,N,IL) -> #activate(N) #56: #uTake2(tt(),M,N,IL) -> #activate(M) popout

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

job log

popout

actions

all output return to TRS Stand 20472