/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES
Input TRS:
    1: a__and(tt(),X) -> mark(X)
    2: a__plus(N,0()) -> mark(N)
    3: a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M)))
    4: a__x(N,0()) -> 0()
    5: a__x(N,s(M)) -> a__plus(a__x(mark(N),mark(M)),mark(N))
    6: mark(and(X1,X2)) -> a__and(mark(X1),X2)
    7: mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2))
    8: mark(x(X1,X2)) -> a__x(mark(X1),mark(X2))
    9: mark(tt()) -> tt()
    10: mark(0()) -> 0()
    11: mark(s(X)) -> s(mark(X))
    12: a__and(X1,X2) -> and(X1,X2)
    13: a__plus(X1,X2) -> plus(X1,X2)
    14: a__x(X1,X2) -> x(X1,X2)
Number of strict rules: 14
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #a__plus(N,0()) -> #mark(N)
   #2: #mark(and(X1,X2)) -> #a__and(mark(X1),X2)
   #3: #mark(and(X1,X2)) -> #mark(X1)
   #4: #mark(s(X)) -> #mark(X)
   #5: #mark(plus(X1,X2)) -> #a__plus(mark(X1),mark(X2))
   #6: #mark(plus(X1,X2)) -> #mark(X1)
   #7: #mark(plus(X1,X2)) -> #mark(X2)
   #8: #a__x(N,s(M)) -> #a__plus(a__x(mark(N),mark(M)),mark(N))
   #9: #a__x(N,s(M)) -> #a__x(mark(N),mark(M))
   #10: #a__x(N,s(M)) -> #mark(N)
   #11: #a__x(N,s(M)) -> #mark(M)
   #12: #a__x(N,s(M)) -> #mark(N)
   #13: #a__plus(N,s(M)) -> #a__plus(mark(N),mark(M))
   #14: #a__plus(N,s(M)) -> #mark(N)
   #15: #a__plus(N,s(M)) -> #mark(M)
   #16: #a__and(tt(),X) -> #mark(X)
   #17: #mark(x(X1,X2)) -> #a__x(mark(X1),mark(X2))
   #18: #mark(x(X1,X2)) -> #mark(X1)
   #19: #mark(x(X1,X2)) -> #mark(X2)
Number of SCCs: 1, DPs: 19
  SCC { #1..19 }
POLO(Sum)... POLO(max)... succeeded.
      a__plus	w: max(x1, x2 + 1)
      s 	w: x1
      and	w: max(x1 + 2, x2 + 3)
      #a__x	w: max(x1 + 2, x2 + 3)
      a__x	w: max(x1 + 1, x2 + 2)
      x 	w: max(x1 + 1, x2 + 2)
      #a__plus	w: max(x1 + 1, x2 + 2)
      #mark	w: x1 + 1
      0 	w: 2
      #a__and	w: max(x2 + 2)
      mark	w: x1
      plus	w: max(x1, x2 + 1)
      tt	w: 1
      a__and	w: max(x1 + 2, x2 + 3)
    USABLE RULES: { 1..14 }
    Removed DPs: #2 #3 #7 #10..12 #15 #16 #18 #19
Number of SCCs: 1, DPs: 9
  SCC { #1 #4..6 #8 #9 #13 #14 #17 }
POLO(Sum)... POLO(max)... QLPOS... succeeded.
      a__plus	s: [2,1]	p: 7
      s 	s: [1]	p: 5
      and	s: 2
      #a__x	s: [1,2]	p: 8
      a__x	s: [1,2]	p: 8
      x 	s: [1,2]	p: 8
      #a__plus	s: [2,1]	p: 6
      #mark	s: [1]	p: 4
      0 	s: []	p: 3
      #a__and	s: []	p: 0
      mark	s: 1
      plus	s: [2,1]	p: 7
      tt	s: []	p: 2
      a__and	s: 2
    USABLE RULES: { 1..14 }
    Removed DPs: #1 #4..6 #8 #9 #13 #14 #17
Number of SCCs: 0, DPs: 0