124.11/31.09	MAYBE
124.11/31.09	(UNSUPPORTED)
124.11/31.09	ConCon could not decide confluence of the system.
124.11/31.09	\cite{ALS94}, Theorem 4.1 does not apply.
124.11/31.09	This system is of type 3 or smaller.
124.11/31.09	This system is absolutely deterministic.
124.11/31.09	The external tool could not decide termination of the system.
124.11/31.09	Call external tool:
124.11/31.09	./ttt2.sh
124.11/31.09	Input:
124.11/31.09	(VAR st_2 x t in_2 pid st_3 n h m st_1 in_3)
124.11/31.09	(RULES
124.11/31.09	  fstsplit(s(n), cons(h, t)) -> cons(h, fstsplit(n, t))
124.11/31.09	  head(cons(h, t)) -> h
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U6(leq(m, length(st_3)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U6(true, st_2, in_2, st_3, m, st_1, in_3) -> U7(empty(fstsplit(m, st_3)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U7(false, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, in_2, st_2, in_3, sndsplit(m, st_3), m)
124.11/31.09	  map_f(pid, nil) -> nil
124.11/31.09	  leq(s(n), s(m)) -> leq(n, m)
124.11/31.09	  app(cons(h, t), x) -> cons(h, app(t, x))
124.11/31.09	  sndsplit(s(n), nil) -> nil
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U6(leq(m, length(st_3)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U6(false, st_2, in_2, st_3, m, st_1, in_3) -> U8(empty(fstsplit(m, app(map_f(three, head(in_3)), st_3))), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U8(false, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, in_2, st_2, tail(in_3), sndsplit(m, app(map_f(three, head(in_3)), st_3)), m)
124.11/31.09	  fstsplit(s(n), nil) -> nil
124.11/31.09	  sndsplit(0, x) -> x
124.11/31.09	  empty(nil) -> true
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U5(empty(map_f(two, head(in_2))), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U5(true, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, tail(in_2), st_2, in_3, st_3, m)
124.11/31.09	  tail(cons(h, t)) -> t
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U2(leq(m, length(st_2)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U2(true, st_2, in_2, st_3, m, st_1, in_3) -> U3(empty(fstsplit(m, st_2)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U3(false, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, in_2, sndsplit(m, st_2), cons(fstsplit(m, st_2), in_3), st_3, m)
124.11/31.09	  length(cons(h, t)) -> s(length(t))
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U2(leq(m, length(st_2)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U2(false, st_2, in_2, st_3, m, st_1, in_3) -> U4(empty(fstsplit(m, app(map_f(two, head(in_2)), st_2))), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U4(false, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, tail(in_2), sndsplit(m, app(map_f(two, head(in_2)), st_2)), cons(fstsplit(m, app(map_f(two, head(in_2)), st_2)), in_3), st_3, m)
124.11/31.09	  leq(0, m) -> true
124.11/31.09	  map_f(pid, cons(h, t)) -> app(f(pid, h), map_f(pid, t))
124.11/31.09	  empty(cons(h, t)) -> false
124.11/31.09	  fstsplit(0, x) -> nil
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U1(empty(fstsplit(m, st_1)), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U1(false, st_2, in_2, st_3, m, st_1, in_3) -> ring(sndsplit(m, st_1), cons(fstsplit(m, st_1), in_2), st_2, in_3, st_3, m)
124.11/31.09	  app(nil, x) -> x
124.11/31.09	  sndsplit(s(n), cons(h, t)) -> sndsplit(n, t)
124.11/31.09	  ring(st_1, in_2, st_2, in_3, st_3, m) -> U9(empty(map_f(three, head(in_3))), st_2, in_2, st_3, m, st_1, in_3)
124.11/31.09	  U9(true, st_2, in_2, st_3, m, st_1, in_3) -> ring(st_1, in_2, st_2, tail(in_3), st_3, m)
124.11/31.09	  leq(s(n), 0) -> false
124.11/31.09	  length(nil) -> 0
124.11/31.09	)
124.11/31.09	
124.11/31.10	EOF