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


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


MAYBE
Input TRS:
    1: Tl(O(x),y) -> Wr(check(x),y)
    2: Tl(O(x),y) -> Wr(x,check(y))
    3: Tl(N(x),y) -> Wr(check(x),y)
    4: Tl(N(x),y) -> Wr(x,check(y))
    5: Tr(x,O(y)) -> Wl(check(x),y)
    6: Tr(x,O(y)) -> Wl(x,check(y))
    7: Tr(x,N(y)) -> Wl(check(x),y)
    8: Tr(x,N(y)) -> Wl(x,check(y))
    9: Tl(B(),y) -> Wr(check(B()),y)
    10: Tl(B(),y) -> Wr(B(),check(y))
    11: Tr(x,B()) -> Wl(check(x),B())
    12: Tr(x,B()) -> Wl(x,check(B()))
    13: Tl(O(x),y) ->= Wl(check(x),y)
    14: Tl(O(x),y) ->= Wl(x,check(y))
    15: Tl(N(x),y) ->= Wl(check(x),y)
    16: Tl(N(x),y) ->= Wl(x,check(y))
    17: Tr(x,O(y)) ->= Wr(check(x),y)
    18: Tr(x,O(y)) ->= Wr(x,check(y))
    19: Tr(x,N(y)) ->= Wr(check(x),y)
    20: Tr(x,N(y)) ->= Wr(x,check(y))
    21: B() ->= N(B())
    22: check(O(x)) ->= ok(O(x))
    23: Wl(ok(x),y) ->= Tl(x,y)
    24: Wl(x,ok(y)) ->= Tl(x,y)
    25: Wr(ok(x),y) ->= Tr(x,y)
    26: Wr(x,ok(y)) ->= Tr(x,y)
    27: check(O(x)) ->= O(check(x))
    28: check(N(x)) ->= N(check(x))
    29: O(ok(x)) ->= ok(O(x))
    30: N(ok(x)) ->= ok(N(x))
Number of strict rules: 12
Direct POLO(bPol) ... removes: 18 1 17 5 14 13 6 2
      Tl	w: 2 * x1 + 2 * x2 + 3
      O 	w: x1 + 1
      B 	w: 1
      check	w: x1 + 1
      ok	w: x1 + 1
      Tr	w: 2 * x1 + 2 * x2 + 3
      Wr	w: 2 * x1 + 2 * x2 + 1
      N 	w: x1
      Wl	w: 2 * x1 + 2 * x2 + 1
Number of strict rules: 8
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
   #1: #Tl(B(),y) -> #Wr(check(B()),y)
   #2: #Tr(x,B()) -> #Wl(check(x),B())
   #3: #Wl(x,ok(y)) ->? #Tl(x,y)
   #4: #Wl(ok(x),y) ->? #Tl(x,y)
   #5: #Tr(x,B()) -> #Wl(x,check(B()))
   #6: #Wr(ok(x),y) ->? #Tr(x,y)
   #7: #Tr(x,N(y)) ->? #Wr(x,check(y))
   #8: #Tr(x,N(y)) -> #Wl(check(x),y)
   #9: #Tl(B(),y) -> #Wr(B(),check(y))
   #10: #Tr(x,N(y)) ->? #Wr(check(x),y)
   #11: #Wr(x,ok(y)) ->? #Tr(x,y)
   #12: #Tl(N(x),y) ->? #Wl(x,check(y))
   #13: #Tl(N(x),y) -> #Wr(check(x),y)
   #14: #Tr(x,N(y)) -> #Wl(x,check(y))
   #15: #Tl(N(x),y) ->? #Wl(check(x),y)
   #16: #Tl(N(x),y) -> #Wr(x,check(y))
Number of SCCs: 1, DPs: 16
  SCC { #1..16 }
POLO(Sum)... succeeded.
      #Wr	w: x1 + 2
      #Tl	w: x1 + 2
      Tl	w: x1 + x2
      O 	w: 0
      B 	w: 1
      check	w: 0
      ok	w: x1
      Tr	w: x1 + x2
      Wr	w: x1 + x2
      #Wl	w: x1 + 2
      N 	w: x1
      Wl	w: x1 + x2
      #Tr	w: x1 + 2
    Removed DPs: #1
Number of SCCs: 1, DPs: 15
  SCC { #2..16 }
POLO(Sum)... succeeded.
      #Wr	w: x2 + 2
      #Tl	w: x2 + 2
      Tl	w: x1 + x2
      O 	w: 0
      B 	w: 1
      check	w: 0
      ok	w: x1
      Tr	w: x1 + x2
      Wr	w: x1 + x2
      #Wl	w: x2 + 2
      N 	w: x1
      Wl	w: x1 + x2
      #Tr	w: x2 + 2
    Removed DPs: #5
Number of SCCs: 1, DPs: 14
  SCC { #2..4 #6..16 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  failed.