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


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


MAYBE
Input TRS:
    1: a__p(0()) -> 0()
    2: a__p(s(X)) -> mark(X)
    3: a__leq(0(),Y) -> true()
    4: a__leq(s(X),0()) -> false()
    5: a__leq(s(X),s(Y)) -> a__leq(mark(X),mark(Y))
    6: a__if(true(),X,Y) -> mark(X)
    7: a__if(false(),X,Y) -> mark(Y)
    8: a__diff(X,Y) -> a__if(a__leq(mark(X),mark(Y)),0(),s(diff(p(X),Y)))
    9: mark(p(X)) -> a__p(mark(X))
    10: mark(leq(X1,X2)) -> a__leq(mark(X1),mark(X2))
    11: mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3)
    12: mark(diff(X1,X2)) -> a__diff(mark(X1),mark(X2))
    13: mark(0()) -> 0()
    14: mark(s(X)) -> s(mark(X))
    15: mark(true()) -> true()
    16: mark(false()) -> false()
    17: a__p(X) -> p(X)
    18: a__leq(X1,X2) -> leq(X1,X2)
    19: a__if(X1,X2,X3) -> if(X1,X2,X3)
    20: a__diff(X1,X2) -> diff(X1,X2)
Number of strict rules: 20
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #a__p(s(X)) -> #mark(X)
   #2: #a__if(true(),X,Y) -> #mark(X)
   #3: #mark(p(X)) -> #a__p(mark(X))
   #4: #mark(p(X)) -> #mark(X)
   #5: #mark(if(X1,X2,X3)) -> #a__if(mark(X1),X2,X3)
   #6: #mark(if(X1,X2,X3)) -> #mark(X1)
   #7: #mark(diff(X1,X2)) -> #a__diff(mark(X1),mark(X2))
   #8: #mark(diff(X1,X2)) -> #mark(X1)
   #9: #mark(diff(X1,X2)) -> #mark(X2)
   #10: #mark(s(X)) -> #mark(X)
   #11: #a__if(false(),X,Y) -> #mark(Y)
   #12: #mark(leq(X1,X2)) -> #a__leq(mark(X1),mark(X2))
   #13: #mark(leq(X1,X2)) -> #mark(X1)
   #14: #mark(leq(X1,X2)) -> #mark(X2)
   #15: #a__leq(s(X),s(Y)) -> #a__leq(mark(X),mark(Y))
   #16: #a__leq(s(X),s(Y)) -> #mark(X)
   #17: #a__leq(s(X),s(Y)) -> #mark(Y)
   #18: #a__diff(X,Y) -> #a__if(a__leq(mark(X),mark(Y)),0(),s(diff(p(X),Y)))
   #19: #a__diff(X,Y) -> #a__leq(mark(X),mark(Y))
   #20: #a__diff(X,Y) -> #mark(X)
   #21: #a__diff(X,Y) -> #mark(Y)
Number of SCCs: 1, DPs: 21
	SCC { #1..21 }
Sum... Max... succeeded.
  #a__diff(x1,x2)		w: (max{1 + x2, 77769 + x1})
  diff(x1,x2)		w: (max{x2, 77768 + x1})
  s(x1)		w: (x1)
  false()		w: (56112)
  a__p(x1)		w: (x1)
  leq(x1,x2)		w: (max{x2, 56112 + x1})
  a__leq(x1,x2)		w: (max{x2, 56112 + x1})
  true()		w: (84077)
  p(x1)		w: (x1)
  #mark(x1)		w: (1 + x1)
  0()		w: (30205)
  if(x1,x2,x3)		w: (max{x3, 47563 + x2, x1})
  a__diff(x1,x2)		w: (max{x2, 77768 + x1})
  mark(x1)		w: (x1)
  #a__p(x1)		w: (1 + x1)
  #a__leq(x1,x2)		w: (max{1 + x2, 56113 + x1})
  #a__if(x1,x2,x3)		w: (max{1 + x3, 47564 + x2, 0})
  a__if(x1,x2,x3)		w: (max{x3, 47563 + x2, x1})
    USABLE RULES: { 1..20 }
    Removed DPs: #2 #8 #13 #16 #20
Number of SCCs: 1, DPs: 16
	SCC { #1 #3..7 #9..12 #14 #15 #17..19 #21 }
Sum... Max... succeeded.
  #a__diff(x1,x2)		w: (max{x2, 0})
  diff(x1,x2)		w: (max{x2, 0})
  s(x1)		w: (x1)
  false()		w: (0)
  a__p(x1)		w: (29406 + x1)
  leq(x1,x2)		w: (max{x2, 0})
  a__leq(x1,x2)		w: (max{x2, 0})
  true()		w: (0)
  p(x1)		w: (29406 + x1)
  #mark(x1)		w: (x1)
  0()		w: (0)
  if(x1,x2,x3)		w: (max{x3, x2, x1})
  a__diff(x1,x2)		w: (max{x2, 0})
  mark(x1)		w: (x1)
  #a__p(x1)		w: (1 + x1)
  #a__leq(x1,x2)		w: (max{x2, 0})
  #a__if(x1,x2,x3)		w: (max{x3, 0})
  a__if(x1,x2,x3)		w: (max{x3, x2, x1})
    USABLE RULES: { 1..20 }
    Removed DPs: #1 #3 #4
Number of SCCs: 1, DPs: 13
	SCC { #5..7 #9..12 #14 #15 #17..19 #21 }
Sum... Max... succeeded.
  #a__diff(x1,x2)		w: (max{48371 + x2, 0})
  diff(x1,x2)		w: (max{36041 + x2, 0})
  s(x1)		w: (x1)
  false()		w: (0)
  a__p(x1)		w: (13506 + x1)
  leq(x1,x2)		w: (max{11652 + x2, 0})
  a__leq(x1,x2)		w: (max{11652 + x2, 0})
  true()		w: (0)
  p(x1)		w: (13506 + x1)
  #mark(x1)		w: (12330 + x1)
  0()		w: (0)
  if(x1,x2,x3)		w: (max{x3, x2, x1})
  a__diff(x1,x2)		w: (max{36041 + x2, 0})
  mark(x1)		w: (x1)
  #a__p(x1)		w: (1 + x1)
  #a__leq(x1,x2)		w: (max{23982 + x2, 0})
  #a__if(x1,x2,x3)		w: (max{12330 + x3, 0})
  a__if(x1,x2,x3)		w: (max{x3, x2, x1})
    USABLE RULES: { 1..20 }
    Removed DPs: #9 #14 #17 #19 #21
Number of SCCs: 2, DPs: 7
	SCC { #15 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.