TRS Standard pair #615299800

details

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

run statistics

property	value
solver	NaTT 2.3.3
configuration	default
runtime (wallclock)	2.8819899559 seconds
cpu usage	4.060378002
max memory	3.14159104E8

stage attributes

key	value
output-size	6559
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(X)
    27: activate(n__length(X)) -> length(X)
    28: activate(n__zeros()) -> zeros()
    29: activate(n__cons(X1,X2)) -> cons(X1,X2)
    30: activate(n__nil()) -> nil()
    31: activate(n__take(X1,X2)) -> take(X1,X2)
    32: activate(X) -> X
Number of strict rules: 32
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #isNatIList(IL) -> #isNatList(activate(IL))
   #2: #isNatIList(IL) -> #activate(IL)
   #3: #activate(n__cons(X1,X2)) -> #cons(X1,X2)
   #4: #uTake1(tt()) -> #nil()
   #5: #isNatList(n__cons(N,L)) -> #and(isNat(activate(N)),isNatList(activate(L)))
   #6: #isNatList(n__cons(N,L)) -> #isNat(activate(N))
   #7: #isNatList(n__cons(N,L)) -> #activate(N)
   #8: #isNatList(n__cons(N,L)) -> #isNatList(activate(L))
   #9: #isNatList(n__cons(N,L)) -> #activate(L)
   #10: #zeros() -> #cons(0(),n__zeros())
   #11: #zeros() -> #0()
   #12: #take(0(),IL) -> #uTake1(isNatIList(IL))
   #13: #take(0(),IL) -> #isNatIList(IL)
   #14: #activate(n__take(X1,X2)) -> #take(X1,X2)
   #15: #take(s(M),cons(N,IL)) -> #uTake2(and(isNat(M),and(isNat(N),isNatIList(activate(IL)))),M,N,activate(IL))
   #16: #take(s(M),cons(N,IL)) -> #and(isNat(M),and(isNat(N),isNatIList(activate(IL))))
   #17: #take(s(M),cons(N,IL)) -> #isNat(M)
   #18: #take(s(M),cons(N,IL)) -> #and(isNat(N),isNatIList(activate(IL)))
   #19: #take(s(M),cons(N,IL)) -> #isNat(N)
   #20: #take(s(M),cons(N,IL)) -> #isNatIList(activate(IL))
   #21: #take(s(M),cons(N,IL)) -> #activate(IL)
   #22: #take(s(M),cons(N,IL)) -> #activate(IL)
   #23: #activate(n__nil()) -> #nil()
   #24: #activate(n__0()) -> #0()
   #25: #isNatIList(n__cons(N,IL)) -> #and(isNat(activate(N)),isNatIList(activate(IL)))
   #26: #isNatIList(n__cons(N,IL)) -> #isNat(activate(N))
   #27: #isNatIList(n__cons(N,IL)) -> #activate(N)
   #28: #isNatIList(n__cons(N,IL)) -> #isNatIList(activate(IL))
   #29: #isNatIList(n__cons(N,IL)) -> #activate(IL)
   #30: #isNatList(n__take(N,IL)) -> #and(isNat(activate(N)),isNatIList(activate(IL)))
   #31: #isNatList(n__take(N,IL)) -> #isNat(activate(N))
   #32: #isNatList(n__take(N,IL)) -> #activate(N)
   #33: #isNatList(n__take(N,IL)) -> #isNatIList(activate(IL))
   #34: #isNatList(n__take(N,IL)) -> #activate(IL)
   #35: #isNat(n__length(L)) -> #isNatList(activate(L))
   #36: #isNat(n__length(L)) -> #activate(L)
   #37: #activate(n__zeros()) -> #zeros()
   #38: #activate(n__length(X)) -> #length(X)
   #39: #uLength(tt(),L) -> #s(length(activate(L)))
   #40: #uLength(tt(),L) -> #length(activate(L))
   #41: #uLength(tt(),L) -> #activate(L)
   #42: #activate(n__s(X)) -> #s(X)
   #43: #length(cons(N,L)) -> #uLength(and(isNat(N),isNatList(activate(L))),activate(L))
   #44: #length(cons(N,L)) -> #and(isNat(N),isNatList(activate(L)))
   #45: #length(cons(N,L)) -> #isNat(N)
   #46: #length(cons(N,L)) -> #isNatList(activate(L))
   #47: #length(cons(N,L)) -> #activate(L)
   #48: #length(cons(N,L)) -> #activate(L)
   #49: #uTake2(tt(),M,N,IL) -> #cons(activate(N),n__take(activate(M),activate(IL)))
   #50: #uTake2(tt(),M,N,IL) -> #activate(N)
   #51: #uTake2(tt(),M,N,IL) -> #activate(M)
   #52: #uTake2(tt(),M,N,IL) -> #activate(IL)
   #53: #isNat(n__s(N)) -> #isNat(activate(N))
   #54: #isNat(n__s(N)) -> #activate(N)
Number of SCCs: 1, DPs: 37, edges: 140
	SCC { #1 #2 #6..9 #13..15 #17 #19..22 #26..29 #31..36 #38 #40 #41 #43 #45..48 #50..54 }

popout

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

job log

popout

actions all output return to TRS Standard