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


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


YES
Input TRS:
    1: f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10)
    2: f(0(),s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10)
    3: f(0(),0(),s(x3),x4,x5,x6,x7,x8,x9,x10) -> f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10)
    4: f(0(),0(),0(),s(x4),x5,x6,x7,x8,x9,x10) -> f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10)
    5: f(0(),0(),0(),0(),s(x5),x6,x7,x8,x9,x10) -> f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10)
    6: f(0(),0(),0(),0(),0(),s(x6),x7,x8,x9,x10) -> f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10)
    7: f(0(),0(),0(),0(),0(),0(),s(x7),x8,x9,x10) -> f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10)
    8: f(0(),0(),0(),0(),0(),0(),0(),s(x8),x9,x10) -> f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10)
    9: f(0(),0(),0(),0(),0(),0(),0(),0(),s(x9),x10) -> f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10)
    10: f(0(),0(),0(),0(),0(),0(),0(),0(),0(),s(x10)) -> f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10)
    11: f(0(),0(),0(),0(),0(),0(),0(),0(),0(),0()) -> 0()
Number of strict rules: 11
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #f(0(),s(x2),x3,x4,x5,x6,x7,x8,x9,x10) -> #f(x2,x2,x3,x4,x5,x6,x7,x8,x9,x10)
   #2: #f(0(),0(),0(),0(),0(),s(x6),x7,x8,x9,x10) -> #f(x6,x6,x6,x6,x6,x6,x7,x8,x9,x10)
   #3: #f(0(),0(),0(),0(),0(),0(),0(),0(),s(x9),x10) -> #f(x9,x9,x9,x9,x9,x9,x9,x9,x9,x10)
   #4: #f(0(),0(),0(),0(),0(),0(),s(x7),x8,x9,x10) -> #f(x7,x7,x7,x7,x7,x7,x7,x8,x9,x10)
   #5: #f(0(),0(),0(),0(),0(),0(),0(),0(),0(),s(x10)) -> #f(x10,x10,x10,x10,x10,x10,x10,x10,x10,x10)
   #6: #f(0(),0(),0(),0(),s(x5),x6,x7,x8,x9,x10) -> #f(x5,x5,x5,x5,x5,x6,x7,x8,x9,x10)
   #7: #f(0(),0(),s(x3),x4,x5,x6,x7,x8,x9,x10) -> #f(x3,x3,x3,x4,x5,x6,x7,x8,x9,x10)
   #8: #f(s(x1),x2,x3,x4,x5,x6,x7,x8,x9,x10) -> #f(x1,x2,x3,x4,x5,x6,x7,x8,x9,x10)
   #9: #f(0(),0(),0(),0(),0(),0(),0(),s(x8),x9,x10) -> #f(x8,x8,x8,x8,x8,x8,x8,x8,x9,x10)
   #10: #f(0(),0(),0(),s(x4),x5,x6,x7,x8,x9,x10) -> #f(x4,x4,x4,x4,x5,x6,x7,x8,x9,x10)
Number of SCCs: 1, DPs: 10
  SCC { #1..10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x10
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 1, DPs: 9
  SCC { #1..4 #6..10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x9
    USABLE RULES: { }
    Removed DPs: #3
Number of SCCs: 1, DPs: 8
  SCC { #1 #2 #4 #6..10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x8
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 1, DPs: 7
  SCC { #1 #2 #4 #6..8 #10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x7
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 1, DPs: 6
  SCC { #1 #2 #6..8 #10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x6
    USABLE RULES: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 5
  SCC { #1 #6..8 #10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x5
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 1, DPs: 4
  SCC { #1 #7 #8 #10 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x4
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 1, DPs: 3
  SCC { #1 #7 #8 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x3
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 1, DPs: 2
  SCC { #1 #8 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x2
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1
  SCC { #8 }
POLO(Sum)... succeeded.
      s 	w: x1 + 1
      f 	w: 0
      0 	w: 1
      #f 	w: x1
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 0, DPs: 0