(SIde note: The events are neither mutually exclusive nor independent.)
$P(E\cap F)$ is the probability that one die is a six and the other die is not. That's $\frac 1 6\frac 5 6+\frac 5 6\frac 1 6$ by adding the probability that the first die is a six and the other not, to the probability that the first die is not a six and the other is. (NB: Those events are mutually exclusive partitions of $E\cap F$.)
$$\mathsf P(E\cap F) = 2 \cdot \frac 1 6 \cdot \frac 5 6\\ = \frac{10}{36}$$
Then we just use conditional probability as you noted.
$$\mathsf P(E\mid F) = \frac{\mathsf P(E\cap F)}{\mathsf P(F)}\\ = \frac{10/36}{30/36} \\ = \frac {1}{3}$$
An approach to this problem, a bit lengthy but having the advantage to provide a clear picture,
might be the following.
Start from considering the dice marked.
The set of possible, equi-probable, outcomes is represented by $6^3=216$ triples.
Then consider that you want the outcome of die 2 to be consecutive to the outcome of die 1, while the outcome of die 3 can be whatever
$$
\begin{array}{c|ccc}
{die} & & 1 & 2 & 3 \\
{result} & & {1 \le k \le 5} & {k + 1} & \forall \\
{prob} & & {5/6} & {1/6} & 1 \\
\end{array}
$$
the probability of getting such a scheme is $5/36$.
Now, since in our problem order does not matter, we shall swap (permute) the above configuration.
But we cannot perform that without considering the value of die 3 (call it $j$) compared with the result of die 1 and 2.
In fact, while e.g. $(1,2,3)$ can be permuted in $6$ ways, $(1,1,3)$ can be permuted in $3$ ways.
Moreover, we shall exclude the permuted triples that fall within the range of those already considered.
So, the prospect of the possible ordered configurations and number of ways to swap them is the following
$$ \bbox[lightyellow] {
\begin{array}{*{20}c}
{config.} & {N.\,ordered} & {N.\,swaps} & {Tot.} \\
\hline
{\left\{ {k,\;k + 1,\;k + 1 < j} \right\}} & {4 + 3 + 2 + 1} & {3!} & {60} \\
{\left\{ {k,\;k + 1,\;k + 1 = j} \right\}} & 5 & 3 & {15} \\
{\left\{ {k,\;k + 1,\;k = j} \right\}} & 5 & 3 & {15} \\
{\left\{ {k,\;k + 1,\;j = k - 1} \right\}} & 4 & 0 & 0 \\
{\left\{ {k,\;k + 1,\;j < k - 1} \right\}} & {1 + 2 + 3} & {3!} & {36} \\
\hline
{{\rm at}\,{\rm least}\,{\rm 2}\,{\rm consecutive}} & {} & {\rm = } & {126} \\
\end{array}
} $$
We see that the fourth configuration is cancelled as being already included in the first.
The prospect for the complementary case (no consecutive outcomes) will give
$$ \bbox[lightyellow] {
\begin{array}{*{20}c}
{config.} & {N.\,ordered} & {N.\,swaps} & {Tot.} \\
\hline
{\left\{ {k,\;k,\;k} \right\}} & 6 & 1 & 6 \\
{\left\{ {k,\;k,\; \ge k + 2} \right\}} & {4 + 3 + 2 + 1} & 3 & {30} \\
{\left\{ {k,\; \ge k + 2,\; = } \right\}} & {4 + 3 + 2 + 1} & 3 & {30} \\
{\left\{ {k,\;k + 2,\; \ge k + 4} \right\}} & {2 + 1} & {3!} & {18} \\
{\left\{ {k,\;k + 3,\; \ge k + 5} \right\}} & 1 & {3!} & 6 \\
\hline
{{\rm none}\,{\rm consecutive}} & {} & {\rm = } & {90} \\
\end{array}
} $$
In the case of asking for three consecutive outcomes instead, considering them to be ordered we will have
$$
\begin{array}{c|ccc}
{die} & & 1 & 2 & 3 \\
{result} & & {1 \le k \le 4} & {k + 1} & {k + 2} \\
{prob} & & {4/6} & {1/6} & {1/6} \\
\end{array}
$$
and since each possible triple has distinct values, we can permute them to obtain:
$$ \bbox[lightyellow] { p(\text{3 consec.})={4/6} \cdot {1/6} \cdot {1/6} \cdot 6=1/9=24/216 }$$.
You can verify by direct counting that the values above are correct.
Best Answer
You are correct; the answer is $\frac23$. What you calculated is $P(\neg A\mid B)$, and it is easy to show that $P(\neg A\mid B)+P(A\mid B)=1$.