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


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


MAYBE
Input TRS:
    1: t1($(x1)) -> $(x1)
    2: t0(b0($(x1))) -> t0($(x1))
    3: t1(b0($(x1))) -> t1($(x1))
    4: t1(b1($(x1))) -> t1(t2($(x1)))
    5: t2(b1($(x1))) -> t2(t2($(x1)))
    6: b0(t0(x1)) -> t0(b0(x1))
    7: b0(t1(x1)) -> t0(b1(x1))
    8: b0(t2(x1)) -> t1(b0(x1))
    9: b1(t0(x1)) -> t1(b1(x1))
    10: b1(t1(x1)) -> t2(b0(x1))
    11: b1(t2(x1)) -> t2(b1(x1))
    12: &(t0(x1)) -> &(b1(x1))
    13: &(t1(x1)) -> &(b0(b0(x1)))
    14: &(t2(x1)) -> &(b0(b1(x1)))
Number of strict rules: 14
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #t0(b0($(x1))) -> #t0($(x1))
   #2: #b0(t0(x1)) -> #t0(b0(x1))
   #3: #b0(t0(x1)) -> #b0(x1)
   #4: #&(t1(x1)) -> #&(b0(b0(x1)))
   #5: #&(t1(x1)) -> #b0(b0(x1))
   #6: #&(t1(x1)) -> #b0(x1)
   #7: #b1(t0(x1)) -> #t1(b1(x1))
   #8: #b1(t0(x1)) -> #b1(x1)
   #9: #b1(t2(x1)) -> #t2(b1(x1))
   #10: #b1(t2(x1)) -> #b1(x1)
   #11: #&(t0(x1)) -> #&(b1(x1))
   #12: #&(t0(x1)) -> #b1(x1)
   #13: #&(t2(x1)) -> #&(b0(b1(x1)))
   #14: #&(t2(x1)) -> #b0(b1(x1))
   #15: #&(t2(x1)) -> #b1(x1)
   #16: #b0(t1(x1)) -> #t0(b1(x1))
   #17: #b0(t1(x1)) -> #b1(x1)
   #18: #b1(t1(x1)) -> #t2(b0(x1))
   #19: #b1(t1(x1)) -> #b0(x1)
   #20: #t2(b1($(x1))) -> #t2(t2($(x1)))
   #21: #t2(b1($(x1))) -> #t2($(x1))
   #22: #t1(b0($(x1))) -> #t1($(x1))
   #23: #b0(t2(x1)) -> #t1(b0(x1))
   #24: #b0(t2(x1)) -> #b0(x1)
   #25: #t1(b1($(x1))) -> #t1(t2($(x1)))
   #26: #t1(b1($(x1))) -> #t2($(x1))
Number of SCCs: 2, DPs: 9
	SCC { #4 #11 #13 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.