/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,y),x,y)
    2: cond2(true(),x,y) -> cond3(gr(x,0()),x,y)
    3: cond2(false(),x,y) -> cond4(gr(y,0()),x,y)
    4: cond3(true(),x,y) -> cond3(gr(x,0()),p(x),y)
    5: cond3(false(),x,y) -> cond1(and(gr(x,0()),gr(y,0())),x,y)
    6: cond4(true(),x,y) -> cond4(gr(y,0()),x,p(y))
    7: cond4(false(),x,y) -> cond1(and(gr(x,0()),gr(y,0())),x,y)
    8: gr(0(),x) -> false()
    9: gr(s(x),0()) -> true()
    10: gr(s(x),s(y)) -> gr(x,y)
    11: and(true(),true()) -> true()
    12: and(false(),x) -> false()
    13: and(x,false()) -> false()
    14: p(0()) -> 0()
    15: p(s(x)) -> x
Number of strict rules: 15
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #cond2(true(),x,y) -> #cond3(gr(x,0()),x,y)
   #2: #cond2(true(),x,y) -> #gr(x,0())
   #3: #cond4(true(),x,y) -> #cond4(gr(y,0()),x,p(y))
   #4: #cond4(true(),x,y) -> #gr(y,0())
   #5: #cond4(true(),x,y) -> #p(y)
   #6: #cond4(false(),x,y) -> #cond1(and(gr(x,0()),gr(y,0())),x,y)
   #7: #cond4(false(),x,y) -> #and(gr(x,0()),gr(y,0()))
   #8: #cond4(false(),x,y) -> #gr(x,0())
   #9: #cond4(false(),x,y) -> #gr(y,0())
   #10: #gr(s(x),s(y)) -> #gr(x,y)
   #11: #cond3(false(),x,y) -> #cond1(and(gr(x,0()),gr(y,0())),x,y)
   #12: #cond3(false(),x,y) -> #and(gr(x,0()),gr(y,0()))
   #13: #cond3(false(),x,y) -> #gr(x,0())
   #14: #cond3(false(),x,y) -> #gr(y,0())
   #15: #cond2(false(),x,y) -> #cond4(gr(y,0()),x,y)
   #16: #cond2(false(),x,y) -> #gr(y,0())
   #17: #cond1(true(),x,y) -> #cond2(gr(x,y),x,y)
   #18: #cond1(true(),x,y) -> #gr(x,y)
   #19: #cond3(true(),x,y) -> #cond3(gr(x,0()),p(x),y)
   #20: #cond3(true(),x,y) -> #gr(x,0())
   #21: #cond3(true(),x,y) -> #p(x)
Number of SCCs: 2, DPs: 8
	SCC { #10 }
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)
  and(x1,x2)		w: (0)
  #cond4(x1,x2,x3)		w: (0)
  false()		w: (0)
  #p(x1)		w: (0)
  cond4(x1,x2,x3)		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)
  #cond2(x1,x2,x3)		w: (0)
  gr(x1,x2)		w: (0)
  #and(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #10
Number of SCCs: 1, DPs: 7
	SCC { #1 #3 #6 #11 #15 #17 #19 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, 28105 + x3})
  s(x1)		w: (max{0, 28102 + x1})
  #cond1(x1,x2,x3)		w: (max{0, 28105 + x3, 1 + x1})
  and(x1,x2)		w: (max{0, 1 + x2})
  #cond4(x1,x2,x3)		w: (max{0, 28105 + x3, 3 + x1})
  false()		w: (1)
  #p(x1)		w: (0)
  cond4(x1,x2,x3)		w: (0)
  true()		w: (28103)
  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)
  #cond2(x1,x2,x3)		w: (max{0, 28105 + x3})
  gr(x1,x2)		w: (max{0, 1 + x1})
  #and(x1,x2)		w: (0)
    USABLE RULES: { 8 9 11..15 }
    Removed DPs: #3
Number of SCCs: 1, DPs: 6
	SCC { #1 #6 #11 #15 #17 #19 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, 50581 + x2, -2241 + x1})
  s(x1)		w: (max{0, 28102 + x1})
  #cond1(x1,x2,x3)		w: (max{0, 50581 + x2, -2242 + x1})
  and(x1,x2)		w: (max{0, 11970 + x1})
  #cond4(x1,x2,x3)		w: (max{0, 50581 + x2})
  false()		w: (11970)
  #p(x1)		w: (0)
  cond4(x1,x2,x3)		w: (0)
  true()		w: (52824)
  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)
  #cond2(x1,x2,x3)		w: (max{0, 50581 + x2, -11969 + x1})
  gr(x1,x2)		w: (max{0, 40853 + x1})
  #and(x1,x2)		w: (0)
    USABLE RULES: { 8..15 }
    Removed DPs: #19
Number of SCCs: 1, DPs: 5
	SCC { #1 #6 #11 #15 #17 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.