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


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


YES
Input TRS:
    1: active(f(a(),X,X)) -> mark(f(X,b(),b()))
    2: active(b()) -> mark(a())
    3: active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
    4: f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
    5: proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
    6: proper(a()) -> ok(a())
    7: proper(b()) -> ok(b())
    8: f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
    9: top(mark(X)) -> top(proper(X))
    10: top(ok(X)) -> top(active(X))
Number of strict rules: 10
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #top(mark(X)) -> #top(proper(X))
   #2: #top(mark(X)) -> #proper(X)
   #3: #top(ok(X)) -> #top(active(X))
   #4: #top(ok(X)) -> #active(X)
   #5: #proper(f(X1,X2,X3)) -> #f(proper(X1),proper(X2),proper(X3))
   #6: #proper(f(X1,X2,X3)) -> #proper(X1)
   #7: #proper(f(X1,X2,X3)) -> #proper(X2)
   #8: #proper(f(X1,X2,X3)) -> #proper(X3)
   #9: #active(f(X1,X2,X3)) -> #f(X1,active(X2),X3)
   #10: #active(f(X1,X2,X3)) -> #active(X2)
   #11: #active(f(a(),X,X)) -> #f(X,b(),b())
   #12: #f(ok(X1),ok(X2),ok(X3)) -> #f(X1,X2,X3)
   #13: #f(X1,mark(X2),X3) -> #f(X1,X2,X3)
Number of SCCs: 4, DPs: 8
  SCC { #10 }
POLO(Sum)... succeeded.
      a 	w: 0
      b 	w: 0
      top	w: 0
      #top	w: 0
      f 	w: x2 + 1
      proper	w: 0
      ok	w: 0
      mark	w: 0
      #f 	w: 0
      #proper	w: 0
      active	w: 0
      #active	w: x1
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 3, DPs: 7
  SCC { #1 #3 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... succeeded.
      a 	w: [6;1]
      b 	w: [1;3]
      top	w: [0;0]
      #top	w: [0,1;0,1] * x1
      f 	w: [1,0;1,0] * x1 + [0,0;0,1] * x2 + [0,0;1,0] * x3 + [1;1]
      proper	w: x1 + [0;2]
      ok	w: x1 + [0;2]
      mark	w: [0,0;0,1] * x1 + [1;3]
      #f 	w: [0;0]
      #proper	w: [0;0]
      active	w: [0,1;0,1] * x1 + [1;1]
      #active	w: [0;0]
    USABLE RULES: { 1..8 }
    Removed DPs: #1 #3
Number of SCCs: 2, DPs: 5
  SCC { #12 #13 }
POLO(Sum)... succeeded.
      a 	w: 1
      b 	w: 1
      top	w: 0
      #top	w: 0
      f 	w: 2
      proper	w: 1
      ok	w: x1 + 1
      mark	w: x1 + 2
      #f 	w: x2
      #proper	w: 0
      active	w: 2
      #active	w: 0
    USABLE RULES: { }
    Removed DPs: #12 #13
Number of SCCs: 1, DPs: 3
  SCC { #6..8 }
POLO(Sum)... succeeded.
      a 	w: 1
      b 	w: 1
      top	w: 0
      #top	w: 0
      f 	w: x1 + x2 + x3 + 2
      proper	w: 0
      ok	w: x1
      mark	w: x1
      #f 	w: 0
      #proper	w: x1
      active	w: 0
      #active	w: 0
    USABLE RULES: { }
    Removed DPs: #6..8
Number of SCCs: 0, DPs: 0