Erdős Problem #794 — A Density Threshold for 3-Uniform Hypergraphs

Is it true that every $3$-uniform hypergraph on $3n$ vertices with at least $n^3+1$ edges contains either a subgraph on $4$ vertices with $3$ edges or a subgraph on $5$ vertices with $7$ edges?