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


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


NO
Input TRS:
    1: zeros() -> cons(0(),n__zeros())
    2: and(tt(),X) -> activate(X)
    3: length(nil()) -> 0()
    4: length(cons(N,L)) -> s(length(activate(L)))
    5: zeros() -> n__zeros()
    6: activate(n__zeros()) -> zeros()
    7: activate(X) -> X
Number of strict rules: 7
Direct poly ... removes: 3 5 7 2
  s(x1)		w: (x1)
  activate(x1)		w: (1 + 2 * x1)
  and(x1,x2)		w: (1 + 2 * x2 + x1)
  n__zeros()		w: (20977)
  zeros()		w: (41955)
  0()		w: (0)
  nil()		w: (14681)
  cons(x1,x2)		w: (1 + 2 * x2 + x1)
  tt()		w: (1)
  length(x1)		w: (x1)
Number of strict rules: 3
Direct poly ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #activate(n__zeros()) -> #zeros()
   #2: #length(cons(N,L)) -> #length(activate(L))
   #3: #length(cons(N,L)) -> #activate(L)
Number of SCCs: 1, DPs: 1
	SCC { #2 }
Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed.
Finding a loop...  found.
  #length(cons(N,n__zeros()))	-#2->
  #length(activate(n__zeros()))	--->*
  #length(cons(0(),n__zeros()))
  Looping with: [ N := 0(); ]