Very interesting DSA problem to learn and figure out how it works.

I'm pretty sure my solution is somewhat close to this one. Is mine supposed to pass?

Is there any reason to limit the problem to 3-SAT rather than a general SAT solver?

If the kata required some sort of optimization specific to 3-SAT, then it would make sense. However, most current solutions are general solvers, so I see no reason to limit the input to 3 literals.

Also, if you prefer to stick to 3-SAT, wouldn't clauses: list[tuple[int, int, int]] make more sense than clauses: list[list[int]]? It would help avoid the n-SAT confusion, at least.

You are correct, however, I believe the confusion comes from the line:

Implement an n-variable 3-SAT solver

It kind of sounds like you are asking us to implement an n literals version of a 3-SAT solver, which would be a n-SAT solver.

Maybe just say:

Implement a 3-SAT solver.

And mention the n variables in the Input section.

Though I think it's also fine as is, so do what you think is best and resolve the suggestion.

thx, done

Fixed. And it also makes Python 4 seconds faster.

oops forgot about that, fixed

You can merge them into one by just doing the tests yourself and only tell codewars' test framework if all tests passed or not.

It looks like only Python has this problem.
I can think of a workaround but lemme ask first how should I merge "Test Passed"s into one?

I would also recommend disabling allow_raise=True for fixed tests.

approved

I suggest to split random tests in 2 batches, one with smaller input and one for the bigger. Break the bigger ones on first failure, but show all test cases for the smaller ones.