TRS Standard pair #487070266

details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.527802 seconds
cpu usage	0.147407
user time	0.110582
system time	0.036825
max virtual memory	113188.0
max residence set size	6796.0

stage attributes

key	value
starexec-result	YES

output

YES
Input TRS:
      1: active(U11(tt(),V1,V2)) -> mark(U12(isNat(V1),V2))
      2: active(U12(tt(),V2)) -> mark(U13(isNat(V2)))
      3: active(U13(tt())) -> mark(tt())
      4: active(U21(tt(),V1)) -> mark(U22(isNat(V1)))
      5: active(U22(tt())) -> mark(tt())
      6: active(U31(tt(),N)) -> mark(N)
      7: active(U41(tt(),M,N)) -> mark(s(plus(N,M)))
      8: active(and(tt(),X)) -> mark(X)
      9: active(isNat(0())) -> mark(tt())
      10: active(isNat(plus(V1,V2))) -> mark(U11(and(isNatKind(V1),isNatKind(V2)),V1,V2))
      11: active(isNat(s(V1))) -> mark(U21(isNatKind(V1),V1))
      12: active(isNatKind(0())) -> mark(tt())
      13: active(isNatKind(plus(V1,V2))) -> mark(and(isNatKind(V1),isNatKind(V2)))
      14: active(isNatKind(s(V1))) -> mark(isNatKind(V1))
      15: active(plus(N,0())) -> mark(U31(and(isNat(N),isNatKind(N)),N))
      16: active(plus(N,s(M))) -> mark(U41(and(and(isNat(M),isNatKind(M)),and(isNat(N),isNatKind(N))),M,N))
      17: mark(U11(X1,X2,X3)) -> active(U11(mark(X1),X2,X3))
      18: mark(tt()) -> active(tt())
      19: mark(U12(X1,X2)) -> active(U12(mark(X1),X2))
      20: mark(isNat(X)) -> active(isNat(X))
      21: mark(U13(X)) -> active(U13(mark(X)))
      22: mark(U21(X1,X2)) -> active(U21(mark(X1),X2))
      23: mark(U22(X)) -> active(U22(mark(X)))
      24: mark(U31(X1,X2)) -> active(U31(mark(X1),X2))
      25: mark(U41(X1,X2,X3)) -> active(U41(mark(X1),X2,X3))
      26: mark(s(X)) -> active(s(mark(X)))
      27: mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2)))
      28: mark(and(X1,X2)) -> active(and(mark(X1),X2))
      29: mark(0()) -> active(0())
      30: mark(isNatKind(X)) -> active(isNatKind(X))
      31: U11(mark(X1),X2,X3) -> U11(X1,X2,X3)
      32: U11(X1,mark(X2),X3) -> U11(X1,X2,X3)
      33: U11(X1,X2,mark(X3)) -> U11(X1,X2,X3)
      34: U11(active(X1),X2,X3) -> U11(X1,X2,X3)
      35: U11(X1,active(X2),X3) -> U11(X1,X2,X3)
      36: U11(X1,X2,active(X3)) -> U11(X1,X2,X3)
      37: U12(mark(X1),X2) -> U12(X1,X2)
      38: U12(X1,mark(X2)) -> U12(X1,X2)
      39: U12(active(X1),X2) -> U12(X1,X2)
      40: U12(X1,active(X2)) -> U12(X1,X2)
      41: isNat(mark(X)) -> isNat(X)
      42: isNat(active(X)) -> isNat(X)
      43: U13(mark(X)) -> U13(X)
      44: U13(active(X)) -> U13(X)
      45: U21(mark(X1),X2) -> U21(X1,X2)
      46: U21(X1,mark(X2)) -> U21(X1,X2)
      47: U21(active(X1),X2) -> U21(X1,X2)
      48: U21(X1,active(X2)) -> U21(X1,X2)
      49: U22(mark(X)) -> U22(X)
      50: U22(active(X)) -> U22(X)
      51: U31(mark(X1),X2) -> U31(X1,X2)
      52: U31(X1,mark(X2)) -> U31(X1,X2)
      53: U31(active(X1),X2) -> U31(X1,X2)
      54: U31(X1,active(X2)) -> U31(X1,X2)
      55: U41(mark(X1),X2,X3) -> U41(X1,X2,X3)
      56: U41(X1,mark(X2),X3) -> U41(X1,X2,X3)
      57: U41(X1,X2,mark(X3)) -> U41(X1,X2,X3)
      58: U41(active(X1),X2,X3) -> U41(X1,X2,X3)
      59: U41(X1,active(X2),X3) -> U41(X1,X2,X3)
      60: U41(X1,X2,active(X3)) -> U41(X1,X2,X3)
      61: s(mark(X)) -> s(X)
      62: s(active(X)) -> s(X)
      63: plus(mark(X1),X2) -> plus(X1,X2)
      64: plus(X1,mark(X2)) -> plus(X1,X2)
      65: plus(active(X1),X2) -> plus(X1,X2)
      66: plus(X1,active(X2)) -> plus(X1,X2)
      67: and(mark(X1),X2) -> and(X1,X2)
      68: and(X1,mark(X2)) -> and(X1,X2)
      69: and(active(X1),X2) -> and(X1,X2)
      70: and(X1,active(X2)) -> and(X1,X2)
      71: isNatKind(mark(X)) -> isNatKind(X)
      72: isNatKind(active(X)) -> isNatKind(X)
Number of strict rules: 72
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #active(U12(tt(),V2)) -> #mark(U13(isNat(V2)))
     #2: #active(U12(tt(),V2)) -> #U13(isNat(V2))
     #3: #active(U12(tt(),V2)) -> #isNat(V2)
     #4: #U13(mark(X)) -> #U13(X)
     #5: #mark(0()) -> #active(0())
     #6: #U11(X1,active(X2),X3) -> #U11(X1,X2,X3)
     #7: #plus(X1,active(X2)) -> #plus(X1,X2)
     #8: #U21(X1,mark(X2)) -> #U21(X1,X2)
     #9: #isNat(active(X)) -> #isNat(X)
     #10: #isNat(mark(X)) -> #isNat(X)
     #11: #U12(mark(X1),X2) -> #U12(X1,X2)
     #12: #U21(active(X1),X2) -> #U21(X1,X2)
     #13: #U31(active(X1),X2) -> #U31(X1,X2)
     #14: #isNatKind(mark(X)) -> #isNatKind(X)
     #15: #U21(X1,active(X2)) -> #U21(X1,X2)
     #16: #U41(active(X1),X2,X3) -> #U41(X1,X2,X3)
     #17: #s(mark(X)) -> #s(X)
     #18: #U12(X1,mark(X2)) -> #U12(X1,X2)
     #19: #active(U31(tt(),N)) -> #mark(N)
     #20: #U41(X1,active(X2),X3) -> #U41(X1,X2,X3)
     #21: #U41(mark(X1),X2,X3) -> #U41(X1,X2,X3)
     #22: #and(mark(X1),X2) -> #and(X1,X2)

popout

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

job log

popout

actions all output return to TRS Standard