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


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


MAYBE
Input TRS:
    1: p(0(x1)) -> 0(s(s(p(x1))))
    2: p(s(x1)) -> x1
    3: p(p(s(x1))) -> p(x1)
    4: f(s(x1)) -> g(s(x1))
    5: g(x1) -> i(s(half(x1)))
    6: i(x1) -> f(p(x1))
    7: half(0(x1)) -> 0(s(s(half(x1))))
    8: half(s(s(x1))) -> s(half(p(p(s(s(x1))))))
    9: 0(x1) -> x1
    10: rd(0(x1)) -> 0(0(0(0(0(0(rd(x1)))))))
Number of strict rules: 10
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #i(x1) -> #f(p(x1))
   #2: #i(x1) -> #p(x1)
   #3: #half(0(x1)) -> #0(s(s(half(x1))))
   #4: #half(0(x1)) -> #half(x1)
   #5: #rd(0(x1)) -> #0(0(0(0(0(0(rd(x1)))))))
   #6: #rd(0(x1)) -> #0(0(0(0(0(rd(x1))))))
   #7: #rd(0(x1)) -> #0(0(0(0(rd(x1)))))
   #8: #rd(0(x1)) -> #0(0(0(rd(x1))))
   #9: #rd(0(x1)) -> #0(0(rd(x1)))
   #10: #rd(0(x1)) -> #0(rd(x1))
   #11: #rd(0(x1)) -> #rd(x1)
   #12: #g(x1) -> #i(s(half(x1)))
   #13: #g(x1) -> #half(x1)
   #14: #p(p(s(x1))) -> #p(x1)
   #15: #p(0(x1)) -> #0(s(s(p(x1))))
   #16: #p(0(x1)) -> #p(x1)
   #17: #half(s(s(x1))) -> #half(p(p(s(s(x1)))))
   #18: #half(s(s(x1))) -> #p(p(s(s(x1))))
   #19: #half(s(s(x1))) -> #p(s(s(x1)))
   #20: #f(s(x1)) -> #g(s(x1))
Number of SCCs: 4, DPs: 8
	SCC { #11 }
Sum... succeeded.
  #0(x1)		w: (0)
  s(x1)		w: (0)
  rd(x1)		w: (0)
  #half(x1)		w: (0)
  #p(x1)		w: (0)
  #rd(x1)		w: (x1)
  f(x1)		w: (0)
  half(x1)		w: (0)
  p(x1)		w: (0)
  0(x1)		w: (1 + x1)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  i(x1)		w: (0)
  g(x1)		w: (0)
  #i(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #11
Number of SCCs: 3, DPs: 7
	SCC { #14 #16 }
Sum... succeeded.
  #0(x1)		w: (0)
  s(x1)		w: (1 + x1)
  rd(x1)		w: (0)
  #half(x1)		w: (0)
  #p(x1)		w: (x1)
  #rd(x1)		w: (0)
  f(x1)		w: (0)
  half(x1)		w: (0)
  p(x1)		w: (x1)
  0(x1)		w: (1 + x1)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  i(x1)		w: (0)
  g(x1)		w: (0)
  #i(x1)		w: (0)
    USABLE RULES: { }
    Removed DPs: #14 #16
Number of SCCs: 2, DPs: 5
	SCC { #4 #17 }
Sum... succeeded.
  #0(x1)		w: (0)
  s(x1)		w: (x1)
  rd(x1)		w: (0)
  #half(x1)		w: (7719 + x1)
  #p(x1)		w: (0)
  #rd(x1)		w: (0)
  f(x1)		w: (0)
  half(x1)		w: (0)
  p(x1)		w: (x1)
  0(x1)		w: (39 + x1)
  #f(x1)		w: (0)
  #g(x1)		w: (0)
  i(x1)		w: (0)
  g(x1)		w: (0)
  #i(x1)		w: (0)
    USABLE RULES: { 1..3 9 }
    Removed DPs: #4
Number of SCCs: 2, DPs: 4
	SCC { #17 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.