TIME: 4500


SCC: 41
=================================
Global Ranking Function: nat(1*A+ -1)

  Flatten_flatten(LTree;)LTree;(A) :- Flatten_flatten(LTree;)LTree;(B) [1*A+ -1*B>=1,1*B>=1]
=================================

SCC: 46
=================================
Global Ranking Function: nat(1*A+ -1)

  Count_count(LTree;)I(A) :- Count_count(LTree;)I(B) [1*A+ -1*B>=1,1*B>=1]
=================================

SCC: 115
=================================
Global Ranking Function: nat(1*A)

  14_loop(A,B,C,D) :- 14_loop(E,F,G,H) [1*A+ -1*E=1,1*H=0,1*B+ -1*F=0,1*A>=1,1*G>=0,1*C>=2,1*C+ -1*G>=1]
  14_loop(A,B,C,D) :- 14_loop(E,F,G,H) [1*F+ -1*G=0,1*H=0,1*A+ -1*E=1,1*A>=1,1*F>=0,1*B+ -1*F>= -1,1*C>=1]
  14_loop(A,B,C,D) :- 14_loop(E,F,G,H) [1*B+ -1*F=0,1*A+ -1*E=1,1*A>=1,1*H>=1,1*G>=0,1*C+ -1*G>=1,1*C>=2]
  14_loop(A,B,C,D) :- 14_loop(E,F,G,H) [1*F+ -1*G=0,1*A+ -1*E=1,1*E>=0,1*F>=0,1*B+ -1*F>= -1,1*C>=1,1*H>=1]
=================================