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


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


MAYBE
Input TRS:
    1: isList(nil()) -> tt()
    2: isList(Cons(x,xs)) -> isList(xs)
    3: downfrom(0()) -> nil()
    4: downfrom(s(x)) -> Cons(s(x),downfrom(x))
    5: f(x) -> cond(isList(downfrom(x)),s(x))
    6: cond(tt(),x) -> f(x)
Number of strict rules: 6
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #isList(Cons(x,xs)) -> #isList(xs)
   #2: #cond(tt(),x) -> #f(x)
   #3: #f(x) -> #cond(isList(downfrom(x)),s(x))
   #4: #f(x) -> #isList(downfrom(x))
   #5: #f(x) -> #downfrom(x)
   #6: #downfrom(s(x)) -> #downfrom(x)
Number of SCCs: 3, DPs: 4
	SCC { #6 }
Sum... succeeded.
  s(x1)		w: (1 + x1)
  f(x1)		w: (0)
  isList(x1)		w: (0)
  #cond(x1,x2)		w: (0)
  0()		w: (0)
  nil()		w: (0)
  #f(x1)		w: (0)
  #isList(x1)		w: (0)
  #downfrom(x1)		w: (x1)
  tt()		w: (0)
  downfrom(x1)		w: (0)
  Cons(x1,x2)		w: (0)
  cond(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #6
Number of SCCs: 2, DPs: 3
	SCC { #1 }
Sum... succeeded.
  s(x1)		w: (1)
  f(x1)		w: (0)
  isList(x1)		w: (0)
  #cond(x1,x2)		w: (0)
  0()		w: (0)
  nil()		w: (0)
  #f(x1)		w: (0)
  #isList(x1)		w: (x1)
  #downfrom(x1)		w: (0)
  tt()		w: (0)
  downfrom(x1)		w: (0)
  Cons(x1,x2)		w: (1 + x2)
  cond(x1,x2)		w: (0)
    USABLE RULES: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 2
	SCC { #2 #3 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  failed.