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


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


MAYBE
Input TRS:
    1: f(a(),f(a(),x)) -> f(c(),f(b(),x))
    2: f(b(),f(b(),x)) -> f(a(),f(c(),x))
    3: f(c(),f(c(),x)) -> f(b(),f(a(),x))
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying f
1: f^1_a(f^1_a(x)) -> f^1_c(f^1_b(x))
2: f^1_b(f^1_b(x)) -> f^1_a(f^1_c(x))
3: f^1_c(f^1_c(x)) -> f^1_b(f^1_a(x))
4: f(a(),_1) ->= f^1_a(_1)
5: f(c(),_1) ->= f^1_c(_1)
6: f(b(),_1) ->= f^1_b(_1)
Number of strict rules: 3
Direct POLO(bPol) ... removes: 4 5 6
      a 	w: 1
      b 	w: 1
      f^1_b	w: x1 + 1
      c 	w: 1
      f 	w: 2 * x1 + 2 * x2
      f^1_a	w: x1 + 1
      f^1_c	w: x1 + 1
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Dependency Pairs:
   #1: #f^1_b(f^1_b(x)) -> #f^1_a(f^1_c(x))
   #2: #f^1_b(f^1_b(x)) -> #f^1_c(x)
   #3: #f^1_c(f^1_c(x)) -> #f^1_b(f^1_a(x))
   #4: #f^1_c(f^1_c(x)) -> #f^1_a(x)
   #5: #f^1_a(f^1_a(x)) -> #f^1_c(f^1_b(x))
   #6: #f^1_a(f^1_a(x)) -> #f^1_b(x)
Number of SCCs: 1, DPs: 6
  SCC { #1..6 }
POLO(Sum)... succeeded.
      a 	w: 0
      #f^1_a	w: x1
      #f^1_b	w: x1
      b 	w: 0
      f^1_b	w: x1 + 1
      c 	w: 0
      f 	w: 0
      #f^1_c	w: x1
      f^1_a	w: x1 + 1
      f^1_c	w: x1 + 1
    USABLE RULES: { 1..3 }
    Removed DPs: #2 #4 #6
Number of SCCs: 1, DPs: 3
  SCC { #1 #3 #5 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.