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