TRS Stand 20472 pair #381715858

details
property	value
status	complete
benchmark	OvConsOS_complete_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n054.star.cs.uiowa.edu
space	Transformed_CSR_04
run statistics
property	value
solver	NaTT
configuration	Default
runtime (wallclock)	13.5728471279 seconds
cpu usage	13.989783589
max memory	8.9837568E7
stage attributes
key	value
output-size	13435
starexec-result	MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


MAYBE
Input TRS:
    1: zeros() -> cons(0(),n__zeros())
    2: U11(tt(),V1) -> U12(isNatList(activate(V1)))
    3: U12(tt()) -> tt()
    4: U21(tt(),V1) -> U22(isNat(activate(V1)))
    5: U22(tt()) -> tt()
    6: U31(tt(),V) -> U32(isNatList(activate(V)))
    7: U32(tt()) -> tt()
    8: U41(tt(),V1,V2) -> U42(isNat(activate(V1)),activate(V2))
    9: U42(tt(),V2) -> U43(isNatIList(activate(V2)))
    10: U43(tt()) -> tt()
    11: U51(tt(),V1,V2) -> U52(isNat(activate(V1)),activate(V2))
    12: U52(tt(),V2) -> U53(isNatList(activate(V2)))
    13: U53(tt()) -> tt()
    14: U61(tt(),V1,V2) -> U62(isNat(activate(V1)),activate(V2))
    15: U62(tt(),V2) -> U63(isNatIList(activate(V2)))
    16: U63(tt()) -> tt()
    17: U71(tt(),L) -> s(length(activate(L)))
    18: U81(tt()) -> nil()
    19: U91(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL)))
    20: and(tt(),X) -> activate(X)
    21: isNat(n__0()) -> tt()
    22: isNat(n__length(V1)) -> U11(isNatIListKind(activate(V1)),activate(V1))
    23: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
    24: isNatIList(V) -> U31(isNatIListKind(activate(V)),activate(V))
    25: isNatIList(n__zeros()) -> tt()
    26: isNatIList(n__cons(V1,V2)) -> U41(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2))
    27: isNatIListKind(n__nil()) -> tt()
    28: isNatIListKind(n__zeros()) -> tt()
    29: isNatIListKind(n__cons(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2)))
    30: isNatIListKind(n__take(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2)))
    31: isNatKind(n__0()) -> tt()
    32: isNatKind(n__length(V1)) -> isNatIListKind(activate(V1))
    33: isNatKind(n__s(V1)) -> isNatKind(activate(V1))
    34: isNatList(n__nil()) -> tt()
    35: isNatList(n__cons(V1,V2)) -> U51(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2))
    36: isNatList(n__take(V1,V2)) -> U61(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2))
    37: length(nil()) -> 0()
    38: length(cons(N,L)) -> U71(and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(n__isNat(N),n__isNatKind(N))),activate(L))
    39: take(0(),IL) -> U81(and(isNatIList(IL),n__isNatIListKind(IL)))
    40: take(s(M),cons(N,IL)) -> U91(and(and(isNatIList(activate(IL)),n__isNatIListKind(activate(IL))),n__and(n__and(n__isNat(M),n__isNatKind(M)),n__and(n__isNat(N),n__isNatKind(N)))),activate(IL),M,N)
    41: zeros() -> n__zeros()
    42: take(X1,X2) -> n__take(X1,X2)
    43: 0() -> n__0()
    44: length(X) -> n__length(X)
    45: s(X) -> n__s(X)
    46: cons(X1,X2) -> n__cons(X1,X2)
    47: isNatIListKind(X) -> n__isNatIListKind(X)
    48: nil() -> n__nil()
    49: and(X1,X2) -> n__and(X1,X2)
    50: isNat(X) -> n__isNat(X)
    51: isNatKind(X) -> n__isNatKind(X)
    52: activate(n__zeros()) -> zeros()
    53: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2))
    54: activate(n__0()) -> 0()
    55: activate(n__length(X)) -> length(activate(X))
    56: activate(n__s(X)) -> s(activate(X))
    57: activate(n__cons(X1,X2)) -> cons(activate(X1),X2)
    58: activate(n__isNatIListKind(X)) -> isNatIListKind(X)
    59: activate(n__nil()) -> nil()
    60: activate(n__and(X1,X2)) -> and(activate(X1),X2)
    61: activate(n__isNat(X)) -> isNat(X)
    62: activate(n__isNatKind(X)) -> isNatKind(X)
    63: activate(X) -> X
Number of strict rules: 63
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #U11(tt(),V1) -> #U12(isNatList(activate(V1)))
   #2: #U11(tt(),V1) -> #isNatList(activate(V1))
   #3: #U11(tt(),V1) -> #activate(V1)
   #4: #isNatIListKind(n__cons(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2)))
   #5: #isNatIListKind(n__cons(V1,V2)) -> #isNatKind(activate(V1))
   #6: #isNatIListKind(n__cons(V1,V2)) -> #activate(V1)
   #7: #isNatIListKind(n__cons(V1,V2)) -> #activate(V2)
   #8: #isNatList(n__cons(V1,V2)) -> #U51(and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2))),activate(V1),activate(V2))
   #9: #isNatList(n__cons(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatIListKind(activate(V2)))
   #10: #isNatList(n__cons(V1,V2)) -> #isNatKind(activate(V1))
   #11: #isNatList(n__cons(V1,V2)) -> #activate(V1)
   #12: #isNatList(n__cons(V1,V2)) -> #activate(V2)
   #13: #isNatList(n__cons(V1,V2)) -> #activate(V1)
   #14: #isNatList(n__cons(V1,V2)) -> #activate(V2)
   #15: #length(nil()) -> #0()
   #16: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2))
   #17: #activate(n__take(X1,X2)) -> #activate(X1)
   #18: #activate(n__take(X1,X2)) -> #activate(X2)
   #19: #activate(n__isNatIListKind(X)) -> #isNatIListKind(X)
   #20: #activate(n__isNat(X)) -> #isNat(X)
   #21: #length(cons(N,L)) -> #U71(and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(n__isNat(N),n__isNatKind(N))),activate(L))
   #22: #length(cons(N,L)) -> #and(and(isNatList(activate(L)),n__isNatIListKind(activate(L))),n__and(n__isNat(N),n__isNatKind(N)))
   #23: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNatIListKind(activate(L)))
   #24: #length(cons(N,L)) -> #isNatList(activate(L))
   #25: #length(cons(N,L)) -> #activate(L)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions all output return to TRS Stand 20472