1.95/0.83	NO
1.95/0.83	
1.95/0.83	Problem:
1.95/0.83	 strict:
1.95/0.83	  min(x,0()) -> 0()
1.95/0.83	  min(0(),y) -> 0()
1.95/0.83	  min(s(x),s(y)) -> s(min(x,y))
1.95/0.83	  max(x,0()) -> x
1.95/0.83	  max(0(),y) -> y
1.95/0.83	  max(s(x),s(y)) -> s(max(x,y))
1.95/0.83	  -(x,0()) -> x
1.95/0.83	  -(s(x),s(y)) -> -(x,y)
1.95/0.83	  gcd(nil()) -> 0()
1.95/0.83	  gcd(cons(x,nil())) -> x
1.95/0.83	  gcd(cons(0(),y)) -> gcd(y)
1.95/0.83	  gcd(cons(x,cons(y,z))) -> gcd(cons(-(x,y),cons(y,z)))
1.95/0.83	 weak:
1.95/0.83	  gcd(cons(x,cons(y,z))) -> gcd(cons(max(x,y),cons(min(x,y),z)))
1.95/0.83	
1.95/0.83	Proof:
1.95/0.83	 Unfolding Processor:
1.95/0.83	  loop length: 1
1.95/0.83	  terms:
1.95/0.83	   gcd(cons(x,cons(y,z)))
1.95/0.83	  context: []
1.95/0.83	  substitution:
1.95/0.83	   x -> -(x,y)
1.95/0.83	   y -> y
1.95/0.83	   z -> z
1.95/0.83	  Qed
1.95/0.84	EOF