Remove assertions that seem to be no longer valid

python/dune/codegen/sumfact/symbolic.py

@@ -847,20 +847,9 @@ class VectorizedSumfactKernel(SumfactKernelBase, ImmutableRecord, prim.Variable)
         # For now we don't mix direct and non_direct input. Could be done in an upper/lower way.
         assert len(set(tuple(k.interface.direct_is_possible for k in kernels))) == 1
 
-        # Assert properties of the matrix sequence of the underlying kernels
-        for i in range(kernels[0].length):
-            assert len(set(tuple(k.matrix_sequence_quadrature_permuted[i].rows for k in kernels))) == 1
-            assert len(set(tuple(k.matrix_sequence_quadrature_permuted[i].cols for k in kernels))) == 1
-            assert len(set(tuple(k.matrix_sequence_quadrature_permuted[i].direction for k in kernels))) == 1
-            assert len(set(tuple(k.matrix_sequence_quadrature_permuted[i].transpose for k in kernels))) == 1
-
         # Join the instruction dependencies of all subkernels
         insn_dep = insn_dep.union(k.insn_dep for k in kernels)
 
-        # Assert that the cost_permutation is the same for all kernels
-        for k in kernels:
-            assert k.interface.cost_permutation == kernels[0].interface.cost_permutation
-
         # We currently assume that all subkernels are consecutive, 0-based within the vector
         assert None not in kernels
 

python/dune/codegen/sumfact/tabulation.py

@@ -148,7 +148,6 @@ class BasisTabulationMatrixArray(BasisTabulationMatrixBase):
         assert len(set(t.quadrature_size for t in tabs)) == 1
         assert len(set(t.basis_size for t in tabs)) == 1
         assert len(set(t.transpose for t in tabs)) == 1
-        assert len(set(t.direction for t in tabs)) == 1
         assert len(set(t.slice_size for t in tabs)) == 1
         self.tabs = tabs