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


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


MAYBE
Input TRS:
    1: b(B(x)) -> B(b(x))
    2: b(c(d(x))) -> B(c(D(x)))
    3: D(d(x)) -> d(D(x))
    4: a(P(x)) -> a(b(b(x)))
    5: B(P(x)) -> P(b(x))
    6: b(c(d(x))) -> P(c(Q(x)))
    7: Q(D(x)) -> d(Q(x))
    8: Q(e(x)) -> d(d(e(x)))
Number of strict rules: 8
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #b(c(d(x))) -> #B(c(D(x)))
   #2: #b(c(d(x))) -> #D(x)
   #3: #b(c(d(x))) -> #Q(x)
   #4: #Q(D(x)) -> #Q(x)
   #5: #B(P(x)) -> #b(x)
   #6: #D(d(x)) -> #D(x)
   #7: #b(B(x)) -> #B(b(x))
   #8: #b(B(x)) -> #b(x)
   #9: #a(P(x)) -> #a(b(b(x)))
   #10: #a(P(x)) -> #b(b(x))
   #11: #a(P(x)) -> #b(x)
Number of SCCs: 4, DPs: 6
	SCC { #4 }
Sum... succeeded.
  a(x1)		w: (0)
  Q(x1)		w: (0)
  d(x1)		w: (0)
  b(x1)		w: (0)
  #B(x1)		w: (0)
  #Q(x1)		w: (x1)
  c(x1)		w: (0)
  D(x1)		w: (1 + x1)
  B(x1)		w: (0)
  #D(x1)		w: (0)
  e(x1)		w: (0)
  P(x1)		w: (0)
  #a(x1)		w: (0)
  #b(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #4
Number of SCCs: 3, DPs: 5
	SCC { #6 }
Sum... succeeded.
  a(x1)		w: (0)
  Q(x1)		w: (0)
  d(x1)		w: (1 + x1)
  b(x1)		w: (0)
  #B(x1)		w: (0)
  #Q(x1)		w: (0)
  c(x1)		w: (0)
  D(x1)		w: (1)
  B(x1)		w: (0)
  #D(x1)		w: (x1)
  e(x1)		w: (0)
  P(x1)		w: (0)
  #a(x1)		w: (0)
  #b(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 4
	SCC { #9 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.