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


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


MAYBE
Input TRS:
    1: cond1(true(),x,y) -> cond2(gr(x,0()),x,y)
    2: cond2(true(),x,y) -> cond1(gr(add(x,y),0()),p(x),y)
    3: cond2(false(),x,y) -> cond3(gr(y,0()),x,y)
    4: cond3(true(),x,y) -> cond1(gr(add(x,y),0()),x,p(y))
    5: cond3(false(),x,y) -> cond1(gr(add(x,y),0()),x,y)
    6: gr(0(),x) -> false()
    7: gr(s(x),0()) -> true()
    8: gr(s(x),s(y)) -> gr(x,y)
    9: add(0(),x) -> x
    10: add(s(x),y) -> s(add(x,y))
    11: p(0()) -> 0()
    12: p(s(x)) -> x
Number of strict rules: 12
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #cond2(true(),x,y) -> #cond1(gr(add(x,y),0()),p(x),y)
   #2: #cond2(true(),x,y) -> #gr(add(x,y),0())
   #3: #cond2(true(),x,y) -> #add(x,y)
   #4: #cond2(true(),x,y) -> #p(x)
   #5: #add(s(x),y) -> #add(x,y)
   #6: #cond3(false(),x,y) -> #cond1(gr(add(x,y),0()),x,y)
   #7: #cond3(false(),x,y) -> #gr(add(x,y),0())
   #8: #cond3(false(),x,y) -> #add(x,y)
   #9: #cond2(false(),x,y) -> #cond3(gr(y,0()),x,y)
   #10: #cond2(false(),x,y) -> #gr(y,0())
   #11: #cond1(true(),x,y) -> #cond2(gr(x,0()),x,y)
   #12: #cond1(true(),x,y) -> #gr(x,0())
   #13: #gr(s(x),s(y)) -> #gr(x,y)
   #14: #cond3(true(),x,y) -> #cond1(gr(add(x,y),0()),x,p(y))
   #15: #cond3(true(),x,y) -> #gr(add(x,y),0())
   #16: #cond3(true(),x,y) -> #add(x,y)
   #17: #cond3(true(),x,y) -> #p(y)
Number of SCCs: 3, DPs: 7
	SCC { #5 }
Sum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (0)
  s(x1)		w: (1 + x1)
  #cond1(x1,x2,x3)		w: (0)
  false()		w: (0)
  #p(x1)		w: (0)
  true()		w: (0)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  #gr(x1,x2)		w: (0)
  cond3(x1,x2,x3)		w: (0)
  #add(x1,x2)		w: (x1)
  add(x1,x2)		w: (0)
  #cond2(x1,x2,x3)		w: (0)
  gr(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #5
Number of SCCs: 2, DPs: 6
	SCC { #13 }
Sum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (0)
  s(x1)		w: (1 + x1)
  #cond1(x1,x2,x3)		w: (0)
  false()		w: (0)
  #p(x1)		w: (0)
  true()		w: (0)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (0)
  0()		w: (0)
  #gr(x1,x2)		w: (x2)
  cond3(x1,x2,x3)		w: (0)
  #add(x1,x2)		w: (0)
  add(x1,x2)		w: (0)
  #cond2(x1,x2,x3)		w: (0)
  gr(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #13
Number of SCCs: 1, DPs: 5
	SCC { #1 #6 #9 #11 #14 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, -38145 + x3, -56736 + x1})
  s(x1)		w: (max{0, 50764 + x1})
  #cond1(x1,x2,x3)		w: (max{0, -38145 + x3})
  false()		w: (18588)
  #p(x1)		w: (0)
  true()		w: (69354)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (max{0, -1 + x1})
  0()		w: (0)
  #gr(x1,x2)		w: (0)
  cond3(x1,x2,x3)		w: (0)
  #add(x1,x2)		w: (0)
  add(x1,x2)		w: (max{0, -50763 + x1})
  #cond2(x1,x2,x3)		w: (max{0, -38145 + x3})
  gr(x1,x2)		w: (max{0, 18590 + x1})
    USABLE RULES: { 6 7 11 12 }
    Removed DPs: #14
Number of SCCs: 1, DPs: 4
	SCC { #1 #6 #9 #11 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, 41383 + x2})
  s(x1)		w: (max{0, 2 + x1})
  #cond1(x1,x2,x3)		w: (max{0, 41383 + x2})
  false()		w: (1)
  #p(x1)		w: (0)
  true()		w: (5)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (max{0, -1 + x1})
  0()		w: (0)
  #gr(x1,x2)		w: (0)
  cond3(x1,x2,x3)		w: (0)
  #add(x1,x2)		w: (0)
  add(x1,x2)		w: (max{0, -1 + x1})
  #cond2(x1,x2,x3)		w: (max{0, 41383 + x2, 41379 + x1})
  gr(x1,x2)		w: (max{0, 3 + x1})
    USABLE RULES: { 6 7 11 12 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 3
	SCC { #6 #9 #11 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.