diff --git a/content/MFES/T - Aula 2 - 18 Setembro 2023.md b/content/MFES/T - Aula 2 - 18 Setembro 2023.md
index 96bc7f1..919ef6c 100644
--- a/content/MFES/T - Aula 2 - 18 Setembro 2023.md	
+++ b/content/MFES/T - Aula 2 - 18 Setembro 2023.md	
@@ -27,8 +27,8 @@ Usually SAT solvers deal with formulas in conjunctive normal form (CNF)
 - **clause**: disjuntion of literals. (A _ ¬B _ C)
 - **conjunctive normal form**: conjuction of clauses. (A _ ¬B _ C) ^ (B _ ¬A) ^ ¬C
 
-   > [!info]+ Cook's theorem(1971)
- > SAT is NP-complete
+> [!info]+ Cook's theorem(1971)
+> SAT is NP-complete
 
 
 ## 1.2 Proposicional Logic (PL)