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


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


MAYBE
Input TRS:
    1: le(s(x),0()) -> false()
    2: le(0(),y) -> true()
    3: le(s(x),s(y)) -> le(x,y)
    4: plus(0(),y) -> y
    5: plus(s(x),y) -> s(plus(x,y))
    6: times(0(),y) -> 0()
    7: times(s(x),y) -> plus(y,times(x,y))
    8: log(x,0()) -> baseError()
    9: log(x,s(0())) -> baseError()
    10: log(0(),s(s(b))) -> logZeroError()
    11: log(s(x),s(s(b))) -> loop(s(x),s(s(b)),s(0()),0())
    12: loop(x,s(s(b)),s(y),z) -> if(le(x,s(y)),x,s(s(b)),s(y),z)
    13: if(true(),x,b,y,z) -> z
    14: if(false(),x,b,y,z) -> loop(x,b,times(b,y),s(z))
Number of strict rules: 14
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #log(s(x),s(s(b))) -> #loop(s(x),s(s(b)),s(0()),0())
   #2: #loop(x,s(s(b)),s(y),z) -> #if(le(x,s(y)),x,s(s(b)),s(y),z)
   #3: #loop(x,s(s(b)),s(y),z) -> #le(x,s(y))
   #4: #if(false(),x,b,y,z) -> #loop(x,b,times(b,y),s(z))
   #5: #if(false(),x,b,y,z) -> #times(b,y)
   #6: #times(s(x),y) -> #plus(y,times(x,y))
   #7: #times(s(x),y) -> #times(x,y)
   #8: #plus(s(x),y) -> #plus(x,y)
   #9: #le(s(x),s(y)) -> #le(x,y)
Number of SCCs: 4, DPs: 5
	SCC { #7 }
Sum... succeeded.
  le(x1,x2)		w: (0)
  s(x1)		w: (1 + x1)
  #le(x1,x2)		w: (0)
  #plus(x1,x2)		w: (0)
  false()		w: (0)
  logZeroError()		w: (0)
  #log(x1,x2)		w: (0)
  true()		w: (0)
  baseError()		w: (0)
  #times(x1,x2)		w: (x1)
  log(x1,x2)		w: (0)
  #loop(x1,x2,x3,x4)		w: (0)
  0()		w: (0)
  if(x1,x2,x3,x4,x5)		w: (0)
  times(x1,x2)		w: (0)
  loop(x1,x2,x3,x4)		w: (0)
  plus(x1,x2)		w: (0)
  #if(x1,x2,x3,x4,x5)		w: (0)
    USABLE RULES: { }
    Removed DPs: #7
Number of SCCs: 3, DPs: 4
	SCC { #8 }
Sum... succeeded.
  le(x1,x2)		w: (0)
  s(x1)		w: (1 + x1)
  #le(x1,x2)		w: (0)
  #plus(x1,x2)		w: (x1)
  false()		w: (0)
  logZeroError()		w: (0)
  #log(x1,x2)		w: (0)
  true()		w: (0)
  baseError()		w: (0)
  #times(x1,x2)		w: (0)
  log(x1,x2)		w: (0)
  #loop(x1,x2,x3,x4)		w: (0)
  0()		w: (0)
  if(x1,x2,x3,x4,x5)		w: (0)
  times(x1,x2)		w: (0)
  loop(x1,x2,x3,x4)		w: (0)
  plus(x1,x2)		w: (0)
  #if(x1,x2,x3,x4,x5)		w: (0)
    USABLE RULES: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 3
	SCC { #9 }
Sum... succeeded.
  le(x1,x2)		w: (0)
  s(x1)		w: (1 + x1)
  #le(x1,x2)		w: (x2)
  #plus(x1,x2)		w: (0)
  false()		w: (0)
  logZeroError()		w: (0)
  #log(x1,x2)		w: (0)
  true()		w: (0)
  baseError()		w: (0)
  #times(x1,x2)		w: (0)
  log(x1,x2)		w: (0)
  #loop(x1,x2,x3,x4)		w: (0)
  0()		w: (0)
  if(x1,x2,x3,x4,x5)		w: (0)
  times(x1,x2)		w: (0)
  loop(x1,x2,x3,x4)		w: (0)
  plus(x1,x2)		w: (0)
  #if(x1,x2,x3,x4,x5)		w: (0)
    USABLE RULES: { }
    Removed DPs: #9
Number of SCCs: 1, DPs: 2
	SCC { #2 #4 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.