TRS Standard pair #487071176

details

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

run statistics

property	value
solver	NaTT v.1.6c
configuration	Default
runtime (wallclock)	0.315634 seconds
cpu usage	0.091416
user time	0.052229
system time	0.039187
max virtual memory	113188.0
max residence set size	6356.0

stage attributes

key	value
starexec-result	YES

output

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

popout

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

job log

popout

actions all output return to TRS Standard