Find the number of partitions of the set $\{1,2,3,\cdots ,11,12\}$ into three nonempty subsets such that no subset has two elements which differ by $1$.

Let's think step by step and output the final answer within \boxed{}.
user