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


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


MAYBE
Input TRS:
    1: cond1(true(),x,y) -> cond2(gr(x,0()),x,y)
    2: cond2(true(),x,y) -> cond1(or(gr(x,0()),gr(y,0())),p(x),y)
    3: cond2(false(),x,y) -> cond3(gr(y,0()),x,y)
    4: cond3(true(),x,y) -> cond1(or(gr(x,0()),gr(y,0())),x,p(y))
    5: cond3(false(),x,y) -> cond1(or(gr(x,0()),gr(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: or(false(),false()) -> false()
    10: or(true(),x) -> true()
    11: or(x,true()) -> true()
    12: p(0()) -> 0()
    13: p(s(x)) -> x
Number of strict rules: 13
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #cond2(true(),x,y) -> #cond1(or(gr(x,0()),gr(y,0())),p(x),y)
   #2: #cond2(true(),x,y) -> #or(gr(x,0()),gr(y,0()))
   #3: #cond2(true(),x,y) -> #gr(x,0())
   #4: #cond2(true(),x,y) -> #gr(y,0())
   #5: #cond2(true(),x,y) -> #p(x)
   #6: #cond3(false(),x,y) -> #cond1(or(gr(x,0()),gr(y,0())),x,y)
   #7: #cond3(false(),x,y) -> #or(gr(x,0()),gr(y,0()))
   #8: #cond3(false(),x,y) -> #gr(x,0())
   #9: #cond3(false(),x,y) -> #gr(y,0())
   #10: #cond2(false(),x,y) -> #cond3(gr(y,0()),x,y)
   #11: #cond2(false(),x,y) -> #gr(y,0())
   #12: #cond1(true(),x,y) -> #cond2(gr(x,0()),x,y)
   #13: #cond1(true(),x,y) -> #gr(x,0())
   #14: #gr(s(x),s(y)) -> #gr(x,y)
   #15: #cond3(true(),x,y) -> #cond1(or(gr(x,0()),gr(y,0())),x,p(y))
   #16: #cond3(true(),x,y) -> #or(gr(x,0()),gr(y,0()))
   #17: #cond3(true(),x,y) -> #gr(x,0())
   #18: #cond3(true(),x,y) -> #gr(y,0())
   #19: #cond3(true(),x,y) -> #p(y)
Number of SCCs: 2, DPs: 6
	SCC { #14 }
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)
  or(x1,x2)		w: (0)
  cond3(x1,x2,x3)		w: (0)
  #cond2(x1,x2,x3)		w: (0)
  #or(x1,x2)		w: (0)
  gr(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #14
Number of SCCs: 1, DPs: 5
	SCC { #1 #6 #10 #12 #15 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, 3041 + x3, 593 + x1})
  s(x1)		w: (max{0, 2450 + x1})
  #cond1(x1,x2,x3)		w: (max{0, 3041 + x3, 1 + x1})
  false()		w: (0)
  #p(x1)		w: (0)
  true()		w: (2449)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (max{0, -3 + x1})
  0()		w: (0)
  #gr(x1,x2)		w: (0)
  or(x1,x2)		w: (max{0, 3040 + x2})
  cond3(x1,x2,x3)		w: (0)
  #cond2(x1,x2,x3)		w: (max{0, 3041 + x3})
  #or(x1,x2)		w: (0)
  gr(x1,x2)		w: (max{0, -1 + x1})
    USABLE RULES: { 6 7 9..13 }
    Removed DPs: #15
Number of SCCs: 1, DPs: 4
	SCC { #1 #6 #10 #12 }
Sum... Max... QLPOpS... NegMaxSum... succeeded.
  cond2(x1,x2,x3)		w: (0)
  #cond3(x1,x2,x3)		w: (max{0, 16675 + x2})
  s(x1)		w: (max{0, 31647 + x1})
  #cond1(x1,x2,x3)		w: (max{0, 16675 + x2})
  false()		w: (0)
  #p(x1)		w: (0)
  true()		w: (1)
  cond1(x1,x2,x3)		w: (0)
  p(x1)		w: (max{0, -31647 + x1})
  0()		w: (0)
  #gr(x1,x2)		w: (0)
  or(x1,x2)		w: (0)
  cond3(x1,x2,x3)		w: (0)
  #cond2(x1,x2,x3)		w: (max{0, 16675 + x2, 16675 + x1})
  #or(x1,x2)		w: (0)
  gr(x1,x2)		w: (max{0, -1 + x1})
    USABLE RULES: { 6 7 12 13 }
    Removed DPs: #1
Number of SCCs: 1, DPs: 3
	SCC { #6 #10 #12 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.