m=5: base 3-graphs with delta_2 >= 2 and no tight Hamiltonian path (=> apex counterexample at n=6, k=3); 60 path clauses: UNSAT  [0.0s]
m=6: base 3-graphs with delta_2 >= 2 and no tight Hamiltonian path (=> apex counterexample at n=7, k=3); 360 path clauses: SAT, |G| = 10, delta_2 = 2, tight Ham path: False  [0.0s]
   G = [[0, 1, 2], [0, 1, 3], [0, 2, 5], [0, 3, 4], [0, 4, 5], [1, 2, 4], [1, 3, 5], [1, 4, 5], [2, 3, 4], [2, 3, 5]]
m=7: base 3-graphs with delta_2 >= 3 and no tight Hamiltonian path (=> apex counterexample at n=8, k=3); 2520 path clauses: UNSAT  [0.0s]
m=8: base 3-graphs with delta_2 >= 3 and no tight Hamiltonian path (=> apex counterexample at n=9, k=3); 20160 path clauses: UNSAT  [0.3s]
m=9: base 3-graphs with delta_2 >= 4 and no tight Hamiltonian path (=> apex counterexample at n=10, k=3); 181440 path clauses: UNSAT  [5.4s]
