Find All Distinct Gozinta Chains Gozinta Chains
(Inspired by Project Euler #606)
A gozinta chain for n is a sequence {1,a,b,...,n} where each element properly divides the next.
For example, there are eight distinct gozinta chains for 12:
{1,12}, {1,2,12}, {1,2,4,12}, {1,2,6,12}, {1,3,12}, {1,3,6,12}, {1,4,12} and {1,6,12}.

The Challenge
Write a program or function that accepts a positive integer (n &gt; 1) and outputs or returns all the distinct gozinta chains for the given number.

Order in the chains matters (ascending), order of the chains does not.
On the off-chance it exists, you cannot use a builtin that solves the challenge.
This is code-golf.

Edit: Removing 1 as a potential input.
Python 3, 68 65 bytes
Edit: -3 bytes thanks to @notjagan

f=lambda x:[y+[x]for k in range(1,x)if x%k&lt;1for y in f(k)]or[[x]]

Try it online!
Explanation
Each gozinta chain consists of the number x at the end of the chain, with at least one divisor to the left of it. For each divisor k of x the chains [1,...,k,x] are distinct. We can therefore for each divisor k find all of its distinct gozinta chains  and append x to the end of them, to get all distinct gozinta chains with k directly to the left of x. This is done recursively until x = 1 where [[1]] is returned, as all gozinta chains start with 1, meaning the recursion have bottomed out.
The code becomes so short due to Python list comprehension allowing double iteration. This means that the values found in f(k) can be added to the same list for all of the different divisors k.