/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


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


YES
Input TRS:
    1: U11(tt(),V1,V2) -> U12(isNat(activate(V1)),activate(V2))
    2: U12(tt(),V2) -> U13(isNat(activate(V2)))
    3: U13(tt()) -> tt()
    4: U21(tt(),V1) -> U22(isNat(activate(V1)))
    5: U22(tt()) -> tt()
    6: U31(tt(),V1,V2) -> U32(isNat(activate(V1)),activate(V2))
    7: U32(tt(),V2) -> U33(isNat(activate(V2)))
    8: U33(tt()) -> tt()
    9: U41(tt(),N) -> activate(N)
    10: U51(tt(),M,N) -> s(plus(activate(N),activate(M)))
    11: U61(tt()) -> 0()
    12: U71(tt(),M,N) -> plus(x(activate(N),activate(M)),activate(N))
    13: and(tt(),X) -> activate(X)
    14: isNat(n__0()) -> tt()
    15: isNat(n__plus(V1,V2)) -> U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
    16: isNat(n__s(V1)) -> U21(isNatKind(activate(V1)),activate(V1))
    17: isNat(n__x(V1,V2)) -> U31(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
    18: isNatKind(n__0()) -> tt()
    19: isNatKind(n__plus(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
    20: isNatKind(n__s(V1)) -> isNatKind(activate(V1))
    21: isNatKind(n__x(V1,V2)) -> and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
    22: plus(N,0()) -> U41(and(isNat(N),n__isNatKind(N)),N)
    23: plus(N,s(M)) -> U51(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
    24: x(N,0()) -> U61(and(isNat(N),n__isNatKind(N)))
    25: x(N,s(M)) -> U71(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
    26: 0() -> n__0()
    27: plus(X1,X2) -> n__plus(X1,X2)
    28: isNatKind(X) -> n__isNatKind(X)
    29: s(X) -> n__s(X)
    30: x(X1,X2) -> n__x(X1,X2)
    31: and(X1,X2) -> n__and(X1,X2)
    32: activate(n__0()) -> 0()
    33: activate(n__plus(X1,X2)) -> plus(X1,X2)
    34: activate(n__isNatKind(X)) -> isNatKind(X)
    35: activate(n__s(X)) -> s(X)
    36: activate(n__x(X1,X2)) -> x(X1,X2)
    37: activate(n__and(X1,X2)) -> and(X1,X2)
    38: activate(X) -> X
Number of strict rules: 38
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #U12(tt(),V2) -> #U13(isNat(activate(V2)))
   #2: #U12(tt(),V2) -> #isNat(activate(V2))
   #3: #U12(tt(),V2) -> #activate(V2)
   #4: #activate(n__s(X)) -> #s(X)
   #5: #activate(n__and(X1,X2)) -> #and(X1,X2)
   #6: #U31(tt(),V1,V2) -> #U32(isNat(activate(V1)),activate(V2))
   #7: #U31(tt(),V1,V2) -> #isNat(activate(V1))
   #8: #U31(tt(),V1,V2) -> #activate(V1)
   #9: #U31(tt(),V1,V2) -> #activate(V2)
   #10: #and(tt(),X) -> #activate(X)
   #11: #U41(tt(),N) -> #activate(N)
   #12: #U61(tt()) -> #0()
   #13: #x(N,0()) -> #U61(and(isNat(N),n__isNatKind(N)))
   #14: #x(N,0()) -> #and(isNat(N),n__isNatKind(N))
   #15: #x(N,0()) -> #isNat(N)
   #16: #plus(N,s(M)) -> #U51(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
   #17: #plus(N,s(M)) -> #and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N)))
   #18: #plus(N,s(M)) -> #and(isNat(M),n__isNatKind(M))
   #19: #plus(N,s(M)) -> #isNat(M)
   #20: #plus(N,s(M)) -> #isNat(N)
   #21: #U71(tt(),M,N) -> #plus(x(activate(N),activate(M)),activate(N))
   #22: #U71(tt(),M,N) -> #x(activate(N),activate(M))
   #23: #U71(tt(),M,N) -> #activate(N)
   #24: #U71(tt(),M,N) -> #activate(M)
   #25: #U71(tt(),M,N) -> #activate(N)
   #26: #x(N,s(M)) -> #U71(and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N))),M,N)
   #27: #x(N,s(M)) -> #and(and(isNat(M),n__isNatKind(M)),n__and(isNat(N),n__isNatKind(N)))
   #28: #x(N,s(M)) -> #and(isNat(M),n__isNatKind(M))
   #29: #x(N,s(M)) -> #isNat(M)
   #30: #x(N,s(M)) -> #isNat(N)
   #31: #isNatKind(n__s(V1)) -> #isNatKind(activate(V1))
   #32: #isNatKind(n__s(V1)) -> #activate(V1)
   #33: #U32(tt(),V2) -> #U33(isNat(activate(V2)))
   #34: #U32(tt(),V2) -> #isNat(activate(V2))
   #35: #U32(tt(),V2) -> #activate(V2)
   #36: #U51(tt(),M,N) -> #s(plus(activate(N),activate(M)))
   #37: #U51(tt(),M,N) -> #plus(activate(N),activate(M))
   #38: #U51(tt(),M,N) -> #activate(N)
   #39: #U51(tt(),M,N) -> #activate(M)
   #40: #activate(n__plus(X1,X2)) -> #plus(X1,X2)
   #41: #plus(N,0()) -> #U41(and(isNat(N),n__isNatKind(N)),N)
   #42: #plus(N,0()) -> #and(isNat(N),n__isNatKind(N))
   #43: #plus(N,0()) -> #isNat(N)
   #44: #activate(n__isNatKind(X)) -> #isNatKind(X)
   #45: #isNat(n__x(V1,V2)) -> #U31(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
   #46: #isNat(n__x(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   #47: #isNat(n__x(V1,V2)) -> #isNatKind(activate(V1))
   #48: #isNat(n__x(V1,V2)) -> #activate(V1)
   #49: #isNat(n__x(V1,V2)) -> #activate(V2)
   #50: #isNat(n__x(V1,V2)) -> #activate(V1)
   #51: #isNat(n__x(V1,V2)) -> #activate(V2)
   #52: #activate(n__0()) -> #0()
   #53: #isNatKind(n__plus(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   #54: #isNatKind(n__plus(V1,V2)) -> #isNatKind(activate(V1))
   #55: #isNatKind(n__plus(V1,V2)) -> #activate(V1)
   #56: #isNatKind(n__plus(V1,V2)) -> #activate(V2)
   #57: #activate(n__x(X1,X2)) -> #x(X1,X2)
   #58: #isNatKind(n__x(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   #59: #isNatKind(n__x(V1,V2)) -> #isNatKind(activate(V1))
   #60: #isNatKind(n__x(V1,V2)) -> #activate(V1)
   #61: #isNatKind(n__x(V1,V2)) -> #activate(V2)
   #62: #isNat(n__s(V1)) -> #U21(isNatKind(activate(V1)),activate(V1))
   #63: #isNat(n__s(V1)) -> #isNatKind(activate(V1))
   #64: #isNat(n__s(V1)) -> #activate(V1)
   #65: #isNat(n__s(V1)) -> #activate(V1)
   #66: #U11(tt(),V1,V2) -> #U12(isNat(activate(V1)),activate(V2))
   #67: #U11(tt(),V1,V2) -> #isNat(activate(V1))
   #68: #U11(tt(),V1,V2) -> #activate(V1)
   #69: #U11(tt(),V1,V2) -> #activate(V2)
   #70: #isNat(n__plus(V1,V2)) -> #U11(and(isNatKind(activate(V1)),n__isNatKind(activate(V2))),activate(V1),activate(V2))
   #71: #isNat(n__plus(V1,V2)) -> #and(isNatKind(activate(V1)),n__isNatKind(activate(V2)))
   #72: #isNat(n__plus(V1,V2)) -> #isNatKind(activate(V1))
   #73: #isNat(n__plus(V1,V2)) -> #activate(V1)
   #74: #isNat(n__plus(V1,V2)) -> #activate(V2)
   #75: #isNat(n__plus(V1,V2)) -> #activate(V1)
   #76: #isNat(n__plus(V1,V2)) -> #activate(V2)
   #77: #U21(tt(),V1) -> #U22(isNat(activate(V1)))
   #78: #U21(tt(),V1) -> #isNat(activate(V1))
   #79: #U21(tt(),V1) -> #activate(V1)
Number of SCCs: 1, DPs: 71
	SCC { #2 #3 #5..11 #14..32 #34 #35 #37..51 #53..76 #78 #79 }
Sum... Max... succeeded.
  #0()		w: (0)
  #U32(x1,x2)		w: (max{1 + x2, 43803 + x1})
  isNatKind(x1)		w: (x1)
  U21(x1,x2)		w: (max{0, x1})
  U11(x1,x2,x3)		w: (max{24776 + x3, x2, 0})
  s(x1)		w: (x1)
  #isNat(x1)		w: (x1)
  activate(x1)		w: (x1)
  U71(x1,x2,x3)		w: (max{43805 + x3, 43806 + x2, 0})
  n__isNatKind(x1)		w: (x1)
  and(x1,x2)		w: (max{x2, x1})
  #plus(x1,x2)		w: (max{1 + x2, x1})
  #activate(x1)		w: (x1)
  #U13(x1)		w: (0)
  U12(x1,x2)		w: (max{24775 + x2, x1})
  #U33(x1)		w: (0)
  x(x1,x2)		w: (max{43806 + x2, 43805 + x1})
  n__s(x1)		w: (x1)
  #U12(x1,x2)		w: (max{1 + x2, 0})
  0()		w: (3)
  #x(x1,x2)		w: (max{43806 + x2, 43805 + x1})
  #s(x1)		w: (0)
  n__plus(x1,x2)		w: (max{24777 + x2, x1})
  U32(x1,x2)		w: (max{14100 + x2, 0})
  U33(x1)		w: (3)
  n__0()		w: (3)
  isNat(x1)		w: (x1)
  n__x(x1,x2)		w: (max{43806 + x2, 43805 + x1})
  plus(x1,x2)		w: (max{24777 + x2, x1})
  U61(x1)		w: (43805)
  #U51(x1,x2,x3)		w: (max{x3, 1 + x2, x1})
  #U11(x1,x2,x3)		w: (max{24777 + x3, x2, x1})
  U31(x1,x2,x3)		w: (max{43806 + x3, 1 + x2, 0})
  #U41(x1,x2)		w: (max{x2, 0})
  #U21(x1,x2)		w: (max{x2, x1})
  #U22(x1)		w: (0)
  tt()		w: (3)
  n__and(x1,x2)		w: (max{x2, x1})
  #U71(x1,x2,x3)		w: (max{43805 + x3, 43806 + x2, 43804 + x1})
  U13(x1)		w: (3)
  U22(x1)		w: (3)
  U51(x1,x2,x3)		w: (max{x3, 24777 + x2, 0})
  #isNatKind(x1)		w: (x1)
  U41(x1,x2)		w: (max{x2, 0})
  #U31(x1,x2,x3)		w: (max{2 + x3, 43804 + x2, 43799 + x1})
  #and(x1,x2)		w: (max{x2, 0})
  #U61(x1)		w: (0)
    USABLE RULES: { 1..38 }
    Removed DPs: #2 #3 #6..9 #14 #15 #18 #19 #23..25 #27..30 #34 #35 #39 #45..51 #53 #56 #58..61 #66 #69 #71 #74 #76
Number of SCCs: 1, DPs: 33
	SCC { #5 #10 #11 #16 #17 #20..22 #26 #31 #32 #37 #38 #40..44 #54 #55 #57 #62..65 #67 #68 #70 #72 #73 #75 #78 #79 }
Sum... Max... QLPOpS... succeeded.
  #0()	0
  #U32(x1,x2)	0[x1]
  isNatKind(x1)	8[x1]
  U21(x1,x2)	6[]
  U11(x1,x2,x3)	6[]
  s(x1)	7[x1]
  #isNat(x1)	1[x1]
  activate(x1)	x1
  U71(x1,x2,x3)	9[x3,x2,x1]
  n__isNatKind(x1)	8[x1]
  and(x1,x2)	2[x2]
  #plus(x1,x2)	8[x1,x2]
  #activate(x1)	3[x1]
  #U13(x1)	0[]
  U12(x1,x2)	5[x1]
  #U33(x1)	0[]
  x(x1,x2)	9[x1,x2]
  n__s(x1)	7[x1]
  #U12(x1,x2)	0[x2,x1]
  0()	9
  #x(x1,x2)	9[x1,x2]
  #s(x1)	0[]
  n__plus(x1,x2)	8[x1,x2]
  U32(x1,x2)	5[x1,x2]
  U33(x1)	4[x1]
  n__0()	9
  isNat(x1)	6[x1]
  n__x(x1,x2)	9[x1,x2]
  plus(x1,x2)	8[x1,x2]
  U61(x1)	9[]
  #U51(x1,x2,x3)	8[x3,x2,x1]
  #U11(x1,x2,x3)	4[x3,x2]
  U31(x1,x2,x3)	10[x2]
  #U41(x1,x2)	8[x2]
  #U21(x1,x2)	3[x2]
  #U22(x1)	0[]
  tt()	4
  n__and(x1,x2)	2[x2]
  #U71(x1,x2,x3)	9[x3,x2,x1]
  U13(x1)	x1
  U22(x1)	6[]
  U51(x1,x2,x3)	8[x3,x2,x1]
  #isNatKind(x1)	0[x1]
  U41(x1,x2)	x2
  #U31(x1,x2,x3)	0[x2,x3,x1]
  #and(x1,x2)	3[x2]
  #U61(x1)	0[]
    USABLE RULES: { 3..5 8..14 16 18..38 }
    Removed DPs: #5 #11 #16 #17 #20..22 #26 #31 #32 #37 #38 #40..44 #54 #55 #57 #62..65 #67 #68 #70 #72 #73 #75 #78
Number of SCCs: 0, DPs: 0