This position was from my ChestUCI database, and I have never found a solution for it.
I told it to use the database parameters and search, and no mate was found.
...
d=23 t=43952.17s [3.90] n=34324808kN [4.31] Hash: spd=36.19 in=1995272177 out=1946723128
d=24 t=1258127.47s [28.62] n=1142201663kN [33.28] Hash: spd=260.27 in=1841486049 out=1792937000
Search completed ... (Time=1258127.52s)
No Mate in 24 found ! (349:28:47)

Try it with /X12

In lower depth it cost little more Time, at d=23 [3.90] (Faktor to previous depth), but at d=24 it will not be a Faktor of 28.62
but maybe only a factor of 3.xx to 4.xx, and the solution time on your machine around 250.000 sec instead 1.258.127 sec.

It depends on the unit of measure. Usual engines search X depths which means X plies (1 ply = 1 half move), but Chest mate solver has the option of 'SearchDepth n' which means n moves (understanding one move as two plies).

In a problem of 'checkmate in n moves' with the winning side being the side to move, you must set SearchDepth equal to n, and there will be one or more checkmates in 2n - 1 plies, not 2n plies.

In a problem of 'checkmate in n moves' with the losing side being the side to move, you must set SearchDepth equal to n, tick the DefenderMoves option and there will be one or more checkmates in 2n plies.

It depends on the unit of measure. Usual engines search X depths which means X plies (1 ply = 1 half move), but Chest mate solver has the option of 'SearchDepth n' which means n moves (understanding one move as two plies).

In a problem of 'checkmate in n moves' with the winning side being the side to move, you must set SearchDepth equal to n, and there will be one or more checkmates in 2n - 1 plies, not 2n plies.

In a problem of 'checkmate in n moves' with the losing side being the side to move, you must set SearchDepth equal to n, tick the DefenderMoves option and there will be one or more checkmates in 2n plies.

This position was from my ChestUCI database, and I have never found a solution for it.
I told it to use the database parameters and search, and no mate was found.
...
d=23 t=43952.17s [3.90] n=34324808kN [4.31] Hash: spd=36.19 in=1995272177 out=1946723128
d=24 t=1258127.47s [28.62] n=1142201663kN [33.28] Hash: spd=260.27 in=1841486049 out=1792937000
Search completed ... (Time=1258127.52s)
No Mate in 24 found ! (349:28:47)

Try it with /X12

In lower depth it cost little more Time, at d=23 [3.90] (Faktor to previous depth), but at d=24 it will not be a Faktor of 28.62
but maybe only a factor of 3.xx to 4.xx, and the solution time on your machine around 250.000 sec instead 1.258.127 sec.

349 hour your run, estimated run "only" 76 hour

If I changed the parameter and spent the time, would it find the mate?
The reason I am asking is that I ran using the parameters in the database which were supposed to have found it.
No mate was found using those parameters.

Taking ideas is not a vice, it is a virtue. We have another word for this. It is called learning.
But sharing ideas is an even greater virtue. We have another word for this. It is called teaching.