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


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


YES
Input TRS:
    1: r0(0(x1)) -> 0(r0(x1))
    2: r0(1(x1)) -> 1(r0(x1))
    3: r0(m(x1)) -> m(r0(x1))
    4: r1(0(x1)) -> 0(r1(x1))
    5: r1(1(x1)) -> 1(r1(x1))
    6: r1(m(x1)) -> m(r1(x1))
    7: r0(b(x1)) -> qr(0(b(x1)))
    8: r1(b(x1)) -> qr(1(b(x1)))
    9: 0(qr(x1)) -> qr(0(x1))
    10: 1(qr(x1)) -> qr(1(x1))
    11: m(qr(x1)) -> ql(m(x1))
    12: 0(ql(x1)) -> ql(0(x1))
    13: 1(ql(x1)) -> ql(1(x1))
    14: b(ql(0(x1))) -> 0(b(r0(x1)))
    15: b(ql(1(x1))) -> 1(b(r1(x1)))
Number of strict rules: 15
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #r0(1(x1)) -> #1(r0(x1))
   #2: #r0(1(x1)) -> #r0(x1)
   #3: #r1(m(x1)) -> #m(r1(x1))
   #4: #r1(m(x1)) -> #r1(x1)
   #5: #1(ql(x1)) -> #1(x1)
   #6: #0(qr(x1)) -> #0(x1)
   #7: #m(qr(x1)) -> #m(x1)
   #8: #0(ql(x1)) -> #0(x1)
   #9: #b(ql(0(x1))) -> #0(b(r0(x1)))
   #10: #b(ql(0(x1))) -> #b(r0(x1))
   #11: #b(ql(0(x1))) -> #r0(x1)
   #12: #r0(b(x1)) -> #0(b(x1))
   #13: #1(qr(x1)) -> #1(x1)
   #14: #r1(1(x1)) -> #1(r1(x1))
   #15: #r1(1(x1)) -> #r1(x1)
   #16: #r0(m(x1)) -> #m(r0(x1))
   #17: #r0(m(x1)) -> #r0(x1)
   #18: #r0(0(x1)) -> #0(r0(x1))
   #19: #r0(0(x1)) -> #r0(x1)
   #20: #r1(b(x1)) -> #1(b(x1))
   #21: #b(ql(1(x1))) -> #1(b(r1(x1)))
   #22: #b(ql(1(x1))) -> #b(r1(x1))
   #23: #b(ql(1(x1))) -> #r1(x1)
   #24: #r1(0(x1)) -> #0(r1(x1))
   #25: #r1(0(x1)) -> #r1(x1)
Number of SCCs: 6, DPs: 13
	SCC { #7 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (0)
  b(x1)		w: (0)
  r0(x1)		w: (0)
  0(x1)		w: (0)
  ql(x1)		w: (0)
  #r1(x1)		w: (0)
  r1(x1)		w: (0)
  #r0(x1)		w: (0)
  #m(x1)		w: (x1)
  #1(x1)		w: (0)
  #b(x1)		w: (0)
  qr(x1)		w: (1 + x1)
  m(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 5, DPs: 12
	SCC { #6 #8 }
Sum... succeeded.
  #0(x1)		w: (x1)
  1(x1)		w: (0)
  b(x1)		w: (0)
  r0(x1)		w: (0)
  0(x1)		w: (0)
  ql(x1)		w: (1 + x1)
  #r1(x1)		w: (0)
  r1(x1)		w: (0)
  #r0(x1)		w: (0)
  #m(x1)		w: (0)
  #1(x1)		w: (0)
  #b(x1)		w: (0)
  qr(x1)		w: (1 + x1)
  m(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6 #8
Number of SCCs: 4, DPs: 10
	SCC { #5 #13 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (0)
  b(x1)		w: (0)
  r0(x1)		w: (0)
  0(x1)		w: (0)
  ql(x1)		w: (1 + x1)
  #r1(x1)		w: (0)
  r1(x1)		w: (0)
  #r0(x1)		w: (0)
  #m(x1)		w: (0)
  #1(x1)		w: (x1)
  #b(x1)		w: (0)
  qr(x1)		w: (1 + x1)
  m(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #5 #13
Number of SCCs: 3, DPs: 8
	SCC { #10 #22 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (2439 + x1)
  b(x1)		w: (1 + x1)
  r0(x1)		w: (1 + x1)
  0(x1)		w: (21240 + x1)
  ql(x1)		w: (x1)
  #r1(x1)		w: (0)
  r1(x1)		w: (1 + x1)
  #r0(x1)		w: (0)
  #m(x1)		w: (0)
  #1(x1)		w: (0)
  #b(x1)		w: (x1)
  qr(x1)		w: (1)
  m(x1)		w: (1)
    USABLE RULES: { 1..13 }
    Removed DPs: #10 #22
Number of SCCs: 2, DPs: 6
	SCC { #4 #15 #25 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (1 + x1)
  b(x1)		w: (1 + x1)
  r0(x1)		w: (1)
  0(x1)		w: (1 + x1)
  ql(x1)		w: (x1)
  #r1(x1)		w: (x1)
  r1(x1)		w: (30613 + x1)
  #r0(x1)		w: (0)
  #m(x1)		w: (0)
  #1(x1)		w: (0)
  #b(x1)		w: (0)
  qr(x1)		w: (1)
  m(x1)		w: (5854 + x1)
    USABLE RULES: { 7..10 12 13 }
    Removed DPs: #4 #15 #25
Number of SCCs: 1, DPs: 3
	SCC { #2 #17 #19 }
Sum... succeeded.
  #0(x1)		w: (0)
  1(x1)		w: (1 + x1)
  b(x1)		w: (1 + x1)
  r0(x1)		w: (1)
  0(x1)		w: (1 + x1)
  ql(x1)		w: (x1)
  #r1(x1)		w: (0)
  r1(x1)		w: (282 + x1)
  #r0(x1)		w: (x1)
  #m(x1)		w: (0)
  #1(x1)		w: (0)
  #b(x1)		w: (0)
  qr(x1)		w: (1)
  m(x1)		w: (20538 + x1)
    USABLE RULES: { 7..10 12 13 }
    Removed DPs: #2 #17 #19
Number of SCCs: 0, DPs: 0