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


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


YES
Input TRS:
    1: min(x,0()) -> 0()
    2: min(0(),y) -> 0()
    3: min(s(x),s(y)) -> s(min(x,y))
    4: max(x,0()) -> x
    5: max(0(),y) -> y
    6: max(s(x),s(y)) -> s(max(x,y))
    7: minus(x,0()) -> x
    8: minus(s(x),s(y)) -> s(minus(x,y))
    9: gcd(s(x),s(y)) -> gcd(minus(max(x,y),min(x,transform(y))),s(min(x,y)))
    10: transform(x) -> s(s(x))
    11: transform(cons(x,y)) -> cons(cons(x,x),x)
    12: transform(cons(x,y)) -> y
    13: transform(s(x)) -> s(s(transform(x)))
    14: cons(x,y) -> y
    15: cons(x,cons(y,s(z))) -> cons(y,x)
    16: cons(cons(x,z),s(y)) -> transform(x)
Number of strict rules: 16
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #max(s(x),s(y)) -> #max(x,y)
   #2: #transform(s(x)) -> #transform(x)
   #3: #gcd(s(x),s(y)) -> #gcd(minus(max(x,y),min(x,transform(y))),s(min(x,y)))
   #4: #gcd(s(x),s(y)) -> #minus(max(x,y),min(x,transform(y)))
   #5: #gcd(s(x),s(y)) -> #max(x,y)
   #6: #gcd(s(x),s(y)) -> #min(x,transform(y))
   #7: #gcd(s(x),s(y)) -> #transform(y)
   #8: #gcd(s(x),s(y)) -> #min(x,y)
   #9: #transform(cons(x,y)) -> #cons(cons(x,x),x)
   #10: #transform(cons(x,y)) -> #cons(x,x)
   #11: #cons(cons(x,z),s(y)) -> #transform(x)
   #12: #min(s(x),s(y)) -> #min(x,y)
   #13: #minus(s(x),s(y)) -> #minus(x,y)
   #14: #cons(x,cons(y,s(z))) -> #cons(y,x)
Number of SCCs: 5, DPs: 9
  SCC { #13 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1 + 1
      minus	w: 0
      gcd	w: 0
      #min	w: 0
      #transform	w: 0
      0 	w: 0
      transform	w: 0
      max	w: 0
      #max	w: 0
      #minus	w: x2
      min	w: 0
      cons	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 4, DPs: 8
  SCC { #12 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1 + 1
      minus	w: 0
      gcd	w: 0
      #min	w: x1
      #transform	w: 0
      0 	w: 0
      transform	w: 0
      max	w: 0
      #max	w: 0
      #minus	w: 0
      min	w: 0
      cons	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #12
Number of SCCs: 3, DPs: 7
  SCC { #1 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1 + 1
      minus	w: 0
      gcd	w: 0
      #min	w: 0
      #transform	w: 0
      0 	w: 0
      transform	w: 0
      max	w: 0
      #max	w: x2
      #minus	w: 0
      min	w: 0
      cons	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 2, DPs: 6
  SCC { #3 }
POLO(Sum)... POLO(max)... succeeded.
      #cons	w: 0
      s 	w: x1 + 5
      minus	w: max(x1 + 1)
      gcd	w: 0
      #min	w: 0
      #transform	w: 0
      0 	w: 1
      transform	w: x1 + 10
      max	w: max(x1 + 3, x2 + 1)
      #max	w: 0
      #minus	w: 0
      min	w: max(x1 + 1)
      cons	w: max(x1 + 8, x2 + 1)
      #gcd	w: max(x1 + 2, x2)
    USABLE RULES: { 1..8 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 5
  SCC { #2 #9..11 #14 }
POLO(Sum)... POLO(max)... succeeded.
      #cons	w: max(x1 + 5, x2 + 1)
      s 	w: x1
      minus	w: max(x1 + 6)
      gcd	w: 0
      #min	w: 0
      #transform	w: x1 + 9
      0 	w: 1
      transform	w: x1 + 12
      max	w: max(x1 + 3, x2 + 1)
      #max	w: 0
      #minus	w: 0
      min	w: max(x1 + 1)
      cons	w: max(x1 + 8, x2 + 3)
      #gcd	w: max(x1 + 2, x2)
    USABLE RULES: { 1..8 10..16 }
    Removed DPs: #9..11 #14
Number of SCCs: 1, DPs: 1
  SCC { #2 }
POLO(Sum)... succeeded.
      #cons	w: 0
      s 	w: x1 + 2
      minus	w: 1
      gcd	w: 0
      #min	w: 0
      #transform	w: x1
      0 	w: 2
      transform	w: x1 + 3
      max	w: x1 + x2 + 1
      #max	w: 0
      #minus	w: 0
      min	w: 1
      cons	w: x2
      #gcd	w: 0
    USABLE RULES: { 4..6 }
    Removed DPs: #2
Number of SCCs: 0, DPs: 0