As others have already pointed out, one can check the local stability by looking at the linearization around the equilibrium point. Namely, if the system is not locally stable then it also would not be globally stable. Once you have established that your system is locally stable one could try to find a candidate quadratic Lyapunov function by solving a continues Lyapunov equation $A^\top P + P\,A + Q = 0$, with $V(x) = x^\top P\,x$. This should guarantee that near the equilibrium point you have a valid Lyapunov function. However, depending on your choice for $Q$ it might not yield a Lyapunov function with $\dot{V}(x) \leq 0\ \forall\,x\neq0$.
A more systematic approach can be obtained using the circle criterion. More detailed steps on how to apply this can be found in another answer of mine, here. It can be noted that the circle criterion is a sufficient but not necessary condition. So if the criterion is not satisfied does not imply the system is unstable.
For example when using the circle criterion on your system allows one to obtain
$$
P =
\begin{bmatrix}
2.7160 & 0.8451 \\ 0.8451 & 0.6192
\end{bmatrix}, \tag{1}
$$
for $\epsilon = 0.7$, $W = 1.4142$ and $L = \begin{bmatrix}-1.0576 & -0.5976\end{bmatrix}$.
Another sufficient way of finding a quadratic Lyapunov function is by formulating the dynamics as $\dot{x} = A(x)\,x$, with $x \in \mathbb{R}^n$ and $A(x) \in \mathbb{R}^{n \times n}$. If the matrix $A(x)$ can also be written as
$$
A(x) = \sum_{i = 1}^N \alpha_i\,A_i, \tag{2}
$$
with for each $x$ weights $\alpha_i \in \mathbb{R}$ such that $0 \leq \alpha_i \leq 1$ and $\sum \alpha_i = 1$, then one can find a Lyapunov function by finding a common quadratic Lyapunov function for all $A_i$. In your case the nonlinear term $\sin(x)$ can be bounded by $1\,x$ and $-0.22\,x$, yielding
$$
A_1 =
\begin{bmatrix}
1 & 1 \\ -5 & -2
\end{bmatrix}, \quad
A_2 =
\begin{bmatrix}
-0.22 & 1 \\ -5 & -2
\end{bmatrix}.
$$
The common quadratic Lyapunov function can be found by solving the following linear matrix inequalities
$$
A_i^\top P + P\,A_i \prec 0,\ \forall\,i \in 1, \cdots, N, \tag{3}
$$
for $P \succ 0$. Namely, for the Lyapunov function $V(x) = x^\top P\,x$ one gets
$$
\dot{V}(x) = x^\top \left(A(x)^\top P + P\,A(x)\right) x, \tag{4}
$$
which, after substituting in $(2)$, yields
$$
\dot{V}(x) = x^\top \left[\sum_{i = 1}^N \alpha_i \left(A_i^\top P + P\,A_i\right)\right] x. \tag{5}
$$
Now by using $(3)$ in $(5)$ yields that the summation in $(5)$ is a sum of negative definite matrices, which always return another negative definite matrix and thus $\dot{V}(x) \leq 0\ \forall\,x\neq0$.
It can be noted that the $P$ from $(1)$ also satisfies $(3)$ using the earlier defined $A_1$ and $A_2$, though a solution could also be obtained using any LMI solver.