TRS Standard pair #487069586

details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	25.1745 seconds
cpu usage	25.51
user time	25.27
system time	0.24
max virtual memory	452232.0
max residence set size	9352.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE
Input TRS:
      1: U101(tt(),V2) -> U102(isLNat(activate(V2)))
      2: U102(tt()) -> tt()
      3: U11(tt(),N,XS) -> U12(isLNat(activate(XS)),activate(N),activate(XS))
      4: U111(tt()) -> tt()
      5: U12(tt(),N,XS) -> snd(splitAt(activate(N),activate(XS)))
      6: U121(tt()) -> tt()
      7: U131(tt(),V2) -> U132(isLNat(activate(V2)))
      8: U132(tt()) -> tt()
      9: U141(tt(),V2) -> U142(isLNat(activate(V2)))
      10: U142(tt()) -> tt()
      11: U151(tt(),V2) -> U152(isLNat(activate(V2)))
      12: U152(tt()) -> tt()
      13: U161(tt(),N) -> cons(activate(N),n__natsFrom(s(activate(N))))
      14: U171(tt(),N,XS) -> U172(isLNat(activate(XS)),activate(N),activate(XS))
      15: U172(tt(),N,XS) -> head(afterNth(activate(N),activate(XS)))
      16: U181(tt(),Y) -> U182(isLNat(activate(Y)),activate(Y))
      17: U182(tt(),Y) -> activate(Y)
      18: U191(tt(),XS) -> pair(nil(),activate(XS))
      19: U201(tt(),N,X,XS) -> U202(isNatural(activate(X)),activate(N),activate(X),activate(XS))
      20: U202(tt(),N,X,XS) -> U203(isLNat(activate(XS)),activate(N),activate(X),activate(XS))
      21: U203(tt(),N,X,XS) -> U204(splitAt(activate(N),activate(XS)),activate(X))
      22: U204(pair(YS,ZS),X) -> pair(cons(activate(X),YS),ZS)
      23: U21(tt(),X,Y) -> U22(isLNat(activate(Y)),activate(X))
      24: U211(tt(),XS) -> U212(isLNat(activate(XS)),activate(XS))
      25: U212(tt(),XS) -> activate(XS)
      26: U22(tt(),X) -> activate(X)
      27: U221(tt(),N,XS) -> U222(isLNat(activate(XS)),activate(N),activate(XS))
      28: U222(tt(),N,XS) -> fst(splitAt(activate(N),activate(XS)))
      29: U31(tt(),N,XS) -> U32(isLNat(activate(XS)),activate(N))
      30: U32(tt(),N) -> activate(N)
      31: U41(tt(),V2) -> U42(isLNat(activate(V2)))
      32: U42(tt()) -> tt()
      33: U51(tt(),V2) -> U52(isLNat(activate(V2)))
      34: U52(tt()) -> tt()
      35: U61(tt()) -> tt()
      36: U71(tt()) -> tt()
      37: U81(tt()) -> tt()
      38: U91(tt()) -> tt()
      39: afterNth(N,XS) -> U11(isNatural(N),N,XS)
      40: fst(pair(X,Y)) -> U21(isLNat(X),X,Y)
      41: head(cons(N,XS)) -> U31(isNatural(N),N,activate(XS))
      42: isLNat(n__nil()) -> tt()
      43: isLNat(n__afterNth(V1,V2)) -> U41(isNatural(activate(V1)),activate(V2))
      44: isLNat(n__cons(V1,V2)) -> U51(isNatural(activate(V1)),activate(V2))
      45: isLNat(n__fst(V1)) -> U61(isPLNat(activate(V1)))
      46: isLNat(n__natsFrom(V1)) -> U71(isNatural(activate(V1)))
      47: isLNat(n__snd(V1)) -> U81(isPLNat(activate(V1)))
      48: isLNat(n__tail(V1)) -> U91(isLNat(activate(V1)))
      49: isLNat(n__take(V1,V2)) -> U101(isNatural(activate(V1)),activate(V2))
      50: isNatural(n__0()) -> tt()
      51: isNatural(n__head(V1)) -> U111(isLNat(activate(V1)))
      52: isNatural(n__s(V1)) -> U121(isNatural(activate(V1)))
      53: isNatural(n__sel(V1,V2)) -> U131(isNatural(activate(V1)),activate(V2))
      54: isPLNat(n__pair(V1,V2)) -> U141(isLNat(activate(V1)),activate(V2))
      55: isPLNat(n__splitAt(V1,V2)) -> U151(isNatural(activate(V1)),activate(V2))
      56: natsFrom(N) -> U161(isNatural(N),N)
      57: sel(N,XS) -> U171(isNatural(N),N,XS)
      58: snd(pair(X,Y)) -> U181(isLNat(X),Y)
      59: splitAt(0(),XS) -> U191(isLNat(XS),XS)
      60: splitAt(s(N),cons(X,XS)) -> U201(isNatural(N),N,X,activate(XS))
      61: tail(cons(N,XS)) -> U211(isNatural(N),activate(XS))
      62: take(N,XS) -> U221(isNatural(N),N,XS)
      63: natsFrom(X) -> n__natsFrom(X)
      64: nil() -> n__nil()
      65: afterNth(X1,X2) -> n__afterNth(X1,X2)
      66: cons(X1,X2) -> n__cons(X1,X2)
      67: fst(X) -> n__fst(X)
      68: snd(X) -> n__snd(X)
      69: tail(X) -> n__tail(X)
      70: take(X1,X2) -> n__take(X1,X2)
      71: 0() -> n__0()
      72: head(X) -> n__head(X)
      73: s(X) -> n__s(X)
      74: sel(X1,X2) -> n__sel(X1,X2)
      75: pair(X1,X2) -> n__pair(X1,X2)
      76: splitAt(X1,X2) -> n__splitAt(X1,X2)
      77: activate(n__natsFrom(X)) -> natsFrom(X)
      78: activate(n__nil()) -> nil()
      79: activate(n__afterNth(X1,X2)) -> afterNth(X1,X2)
      80: activate(n__cons(X1,X2)) -> cons(X1,X2)
      81: activate(n__fst(X)) -> fst(X)
      82: activate(n__snd(X)) -> snd(X)
      83: activate(n__tail(X)) -> tail(X)
      84: activate(n__take(X1,X2)) -> take(X1,X2)
      85: activate(n__0()) -> 0()
      86: activate(n__head(X)) -> head(X)
      87: activate(n__s(X)) -> s(X)
      88: activate(n__sel(X1,X2)) -> sel(X1,X2)
      89: activate(n__pair(X1,X2)) -> pair(X1,X2)
      90: activate(n__splitAt(X1,X2)) -> splitAt(X1,X2)
      91: activate(X) -> X
Number of strict rules: 91
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #activate(n__head(X)) -> #head(X)
     #2: #isLNat(n__afterNth(V1,V2)) -> #U41(isNatural(activate(V1)),activate(V2))
     #3: #isLNat(n__afterNth(V1,V2)) -> #isNatural(activate(V1))

popout

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

job log

popout

actions all output return to TRS Standard