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


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


YES
Input TRS:
    1: minus(X,s(Y)) -> pred(minus(X,Y))
    2: minus(X,0()) -> X
    3: pred(s(X)) -> X
    4: le(s(X),s(Y)) -> le(X,Y)
    5: le(s(X),0()) -> false()
    6: le(0(),Y) -> true()
    7: gcd(0(),Y) -> 0()
    8: gcd(s(X),0()) -> s(X)
    9: gcd(s(X),s(Y)) -> if(le(Y,X),s(X),s(Y))
    10: if(true(),s(X),s(Y)) -> gcd(minus(X,Y),s(Y))
    11: if(false(),s(X),s(Y)) -> gcd(minus(Y,X),s(X))
Number of strict rules: 11
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #gcd(s(X),s(Y)) -> #if(le(Y,X),s(X),s(Y))
   #2: #gcd(s(X),s(Y)) -> #le(Y,X)
   #3: #if(false(),s(X),s(Y)) -> #gcd(minus(Y,X),s(X))
   #4: #if(false(),s(X),s(Y)) -> #minus(Y,X)
   #5: #if(true(),s(X),s(Y)) -> #gcd(minus(X,Y),s(Y))
   #6: #if(true(),s(X),s(Y)) -> #minus(X,Y)
   #7: #minus(X,s(Y)) -> #pred(minus(X,Y))
   #8: #minus(X,s(Y)) -> #minus(X,Y)
   #9: #le(s(X),s(Y)) -> #le(X,Y)
Number of SCCs: 3, DPs: 5
  SCC { #8 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: 0
      minus	w: 0
      gcd	w: 0
      false	w: 0
      true	w: 0
      pred	w: 0
      0 	w: 0
      if	w: 0
      #minus	w: x2
      #pred	w: 0
      #if	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 4
  SCC { #9 }
POLO(Sum)... succeeded.
      le	w: 0
      s 	w: x1 + 1
      #le	w: x1
      minus	w: 0
      gcd	w: 0
      false	w: 0
      true	w: 0
      pred	w: 0
      0 	w: 0
      if	w: 0
      #minus	w: 0
      #pred	w: 0
      #if	w: 0
      #gcd	w: 0
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #5 }
POLO(Sum)... succeeded.
      le	w: x1 + x2 + 1
      s 	w: x1 + 3
      #le	w: 0
      minus	w: x1 + 1
      gcd	w: 0
      false	w: 6
      true	w: 3
      pred	w: x1
      0 	w: 1
      if	w: 0
      #minus	w: 0
      #pred	w: 0
      #if	w: x2 + x3
      #gcd	w: x1 + x2 + 1
    USABLE RULES: { 1..3 }
    Removed DPs: #1 #3 #5
Number of SCCs: 0, DPs: 0