Diagrams.Solve.Polynomial:cubForm from diagrams-solve-0.1, K

Percentage Accurate: 69.9% → 76.4%

Time: 14.2s

Alternatives: 9

Speedup: 1.2×

Specification

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 69.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos((y - ((z * t) / 3.0d0)))) - (a / (b * 3.0d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(Float64(y - Float64(Float64(z * t) / 3.0)))) - Float64(a / Float64(b * 3.0)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos((y - ((z * t) / 3.0)))) - (a / (b * 3.0));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[N[(y - N[(N[(z * t), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 76.4% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{b \cdot 3} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (- (* (* 2.0 (sqrt x)) (cos y)) (/ a (* b 3.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * sqrt(x)) * cos(y)) - (a / (b * 3.0));
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((2.0d0 * sqrt(x)) * cos(y)) - (a / (b * 3.0d0))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return ((2.0 * Math.sqrt(x)) * Math.cos(y)) - (a / (b * 3.0));
}

Python

def code(x, y, z, t, a, b):
	return ((2.0 * math.sqrt(x)) * math.cos(y)) - (a / (b * 3.0))

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(Float64(2.0 * sqrt(x)) * cos(y)) - Float64(a / Float64(b * 3.0)))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = ((2.0 * sqrt(x)) * cos(y)) - (a / (b * 3.0));
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
4. Step-by-step derivation

   1. lower-cos.f64 77.5

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

5. Applied rewrites 77.5%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
6. Add Preprocessing

Alternative 2: 71.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{b \cdot 3}\\ \mathbf{if}\;t\_1 \leq -1.65 \cdot 10^{-69} \lor \neg \left(t\_1 \leq 2 \cdot 10^{-78}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ a (* b 3.0))))
   (if (or (<= t_1 -1.65e-69) (not (<= t_1 2e-78)))
     (* (fma (/ 2.0 a) (sqrt x) (/ -0.3333333333333333 b)) a)
     (* (* (sqrt x) 2.0) (cos (fma -0.3333333333333333 (* t z) y))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a / (b * 3.0);
	double tmp;
	if ((t_1 <= -1.65e-69) || !(t_1 <= 2e-78)) {
		tmp = fma((2.0 / a), sqrt(x), (-0.3333333333333333 / b)) * a;
	} else {
		tmp = (sqrt(x) * 2.0) * cos(fma(-0.3333333333333333, (t * z), y));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a / Float64(b * 3.0))
	tmp = 0.0
	if ((t_1 <= -1.65e-69) || !(t_1 <= 2e-78))
		tmp = Float64(fma(Float64(2.0 / a), sqrt(x), Float64(-0.3333333333333333 / b)) * a);
	else
		tmp = Float64(Float64(sqrt(x) * 2.0) * cos(fma(-0.3333333333333333, Float64(t * z), y)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1.65e-69], N[Not[LessEqual[t$95$1, 2e-78]], $MachinePrecision]], N[(N[(N[(2.0 / a), $MachinePrecision] * N[Sqrt[x], $MachinePrecision] + N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision], N[(N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision] * N[Cos[N[(-0.3333333333333333 * N[(t * z), $MachinePrecision] + y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 a (*.f64 b #s(literal 3 binary64))) < -1.65e-69 or 2e-78 < (/.f64 a (*.f64 b #s(literal 3 binary64)))

   1. Initial program 79.2%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right)}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]

   5. Applied rewrites 78.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \frac{\sqrt{x}}{a}, 2, \frac{-0.3333333333333333}{b}\right) \cdot a} \]

   6. Taylor expanded in z around 0

      \[\leadsto \frac{2}{3} \cdot \left(\left(t \cdot \left(z \cdot \sin y\right)\right) \cdot \sqrt{x}\right) + \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos y}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 73.2%

      \[\leadsto \mathsf{fma}\left(0.6666666666666666 \cdot \left(\left(\sin y \cdot z\right) \cdot t\right), \color{blue}{\sqrt{x}}, \mathsf{fma}\left(2 \cdot \frac{\cos y}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a\right) \]
   9. Step-by-step derivation

   10. Applied rewrites 75.1%

       \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{x} \cdot \left(\left(\sin y \cdot z\right) \cdot 0.6666666666666666\right), t, \mathsf{fma}\left(2 \cdot \sqrt{x}, \frac{\cos y}{a}, \frac{-0.3333333333333333}{b}\right) \cdot a\right)} \]

   11. Taylor expanded in y around 0

       \[\leadsto a \cdot \left(2 \cdot \left(\frac{1}{a} \cdot \sqrt{x}\right) - \color{blue}{\frac{1}{3} \cdot \frac{1}{b}}\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 86.0%

       \[\leadsto \mathsf{fma}\left(\frac{2}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a \]

   if -1.65e-69 < (/.f64 a (*.f64 b #s(literal 3 binary64))) < 2e-78

   1. Initial program 55.8%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

      \[\leadsto \color{blue}{-2 \cdot \left(\sqrt{x} \cdot \left(\cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right) \cdot {\left(\sqrt{-1}\right)}^{2}\right)\right)} \]

   5. Applied rewrites 51.0%

      \[\leadsto \color{blue}{\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{a}{b \cdot 3} \leq -1.65 \cdot 10^{-69} \lor \neg \left(\frac{a}{b \cdot 3} \leq 2 \cdot 10^{-78}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{2}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a, \frac{-0.3333333333333333}{b}, \cos y \cdot \left(\sqrt{x} \cdot 2\right)\right) \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (fma a (/ -0.3333333333333333 b) (* (cos y) (* (sqrt x) 2.0))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return fma(a, (-0.3333333333333333 / b), (cos(y) * (sqrt(x) * 2.0)));
}

Julia

function code(x, y, z, t, a, b)
	return fma(a, Float64(-0.3333333333333333 / b), Float64(cos(y) * Float64(sqrt(x) * 2.0)))
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(a * N[(-0.3333333333333333 / b), $MachinePrecision] + N[(N[Cos[y], $MachinePrecision] * N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
4. Step-by-step derivation

   1. lower-cos.f64 77.5

      \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]

5. Applied rewrites 77.5%

   \[\leadsto \left(2 \cdot \sqrt{x}\right) \cdot \color{blue}{\cos y} - \frac{a}{b \cdot 3} \]
6. Step-by-step derivation

   1. lift--.f64 N/A

      \[\leadsto \color{blue}{\left(2 \cdot \sqrt{x}\right) \cdot \cos y - \frac{a}{b \cdot 3}} \]

   2. sub-neg N/A

      \[\leadsto \color{blue}{\left(2 \cdot \sqrt{x}\right) \cdot \cos y + \left(\mathsf{neg}\left(\frac{a}{b \cdot 3}\right)\right)} \]

   3. +-commutative N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a}{b \cdot 3}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y} \]

   4. lift-/.f64 N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{\frac{a}{b \cdot 3}}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   5. div-inv N/A

      \[\leadsto \left(\mathsf{neg}\left(\color{blue}{a \cdot \frac{1}{b \cdot 3}}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   6. distribute-rgt-neg-in N/A

      \[\leadsto \color{blue}{a \cdot \left(\mathsf{neg}\left(\frac{1}{b \cdot 3}\right)\right)} + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   7. lift-*.f64 N/A

      \[\leadsto a \cdot \left(\mathsf{neg}\left(\frac{1}{\color{blue}{b \cdot 3}}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   8. *-commutative N/A

      \[\leadsto a \cdot \left(\mathsf{neg}\left(\frac{1}{\color{blue}{3 \cdot b}}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   9. associate-/r* N/A

      \[\leadsto a \cdot \left(\mathsf{neg}\left(\color{blue}{\frac{\frac{1}{3}}{b}}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   10. metadata-eval N/A

       \[\leadsto a \cdot \left(\mathsf{neg}\left(\frac{\color{blue}{\frac{1}{3}}}{b}\right)\right) + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   11. distribute-frac-neg2 N/A

       \[\leadsto a \cdot \color{blue}{\frac{\frac{1}{3}}{\mathsf{neg}\left(b\right)}} + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   12. metadata-eval N/A

       \[\leadsto a \cdot \frac{\color{blue}{\mathsf{neg}\left(\frac{-1}{3}\right)}}{\mathsf{neg}\left(b\right)} + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   13. frac-2neg N/A

       \[\leadsto a \cdot \color{blue}{\frac{\frac{-1}{3}}{b}} + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   14. lift-/.f64 N/A

       \[\leadsto a \cdot \color{blue}{\frac{\frac{-1}{3}}{b}} + \left(2 \cdot \sqrt{x}\right) \cdot \cos y \]

   15. lower-fma.f64 77.4

       \[\leadsto \color{blue}{\mathsf{fma}\left(a, \frac{-0.3333333333333333}{b}, \left(2 \cdot \sqrt{x}\right) \cdot \cos y\right)} \]

   16. lift-*.f64 N/A

       \[\leadsto \mathsf{fma}\left(a, \frac{\frac{-1}{3}}{b}, \color{blue}{\left(2 \cdot \sqrt{x}\right) \cdot \cos y}\right) \]

7. Applied rewrites 77.4%

   \[\leadsto \color{blue}{\mathsf{fma}\left(a, \frac{-0.3333333333333333}{b}, \cos y \cdot \left(\sqrt{x} \cdot 2\right)\right)} \]
8. Add Preprocessing

Alternative 4: 76.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(2 \cdot \cos y, \sqrt{x}, -0.3333333333333333 \cdot \frac{a}{b}\right) \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (fma (* 2.0 (cos y)) (sqrt x) (* -0.3333333333333333 (/ a b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	return fma((2.0 * cos(y)), sqrt(x), (-0.3333333333333333 * (a / b)));
}

Julia

function code(x, y, z, t, a, b)
	return fma(Float64(2.0 * cos(y)), sqrt(x), Float64(-0.3333333333333333 * Float64(a / b)))
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(2.0 * N[Cos[y], $MachinePrecision]), $MachinePrecision] * N[Sqrt[x], $MachinePrecision] + N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in z around 0

   \[\leadsto \color{blue}{2 \cdot \left(\sqrt{x} \cdot \cos y\right) - \frac{1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. cancel-sign-sub-inv N/A

      \[\leadsto \color{blue}{2 \cdot \left(\sqrt{x} \cdot \cos y\right) + \left(\mathsf{neg}\left(\frac{1}{3}\right)\right) \cdot \frac{a}{b}} \]

   2. metadata-eval N/A

      \[\leadsto 2 \cdot \left(\sqrt{x} \cdot \cos y\right) + \color{blue}{\frac{-1}{3}} \cdot \frac{a}{b} \]

   3. *-commutative N/A

      \[\leadsto 2 \cdot \color{blue}{\left(\cos y \cdot \sqrt{x}\right)} + \frac{-1}{3} \cdot \frac{a}{b} \]

   4. associate-*r* N/A

      \[\leadsto \color{blue}{\left(2 \cdot \cos y\right) \cdot \sqrt{x}} + \frac{-1}{3} \cdot \frac{a}{b} \]

   5. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \cos y, \sqrt{x}, \frac{-1}{3} \cdot \frac{a}{b}\right)} \]

   6. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{2 \cdot \cos y}, \sqrt{x}, \frac{-1}{3} \cdot \frac{a}{b}\right) \]

   7. lower-cos.f64 N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \color{blue}{\cos y}, \sqrt{x}, \frac{-1}{3} \cdot \frac{a}{b}\right) \]

   8. lower-sqrt.f64 N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \cos y, \color{blue}{\sqrt{x}}, \frac{-1}{3} \cdot \frac{a}{b}\right) \]

   9. lower-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(2 \cdot \cos y, \sqrt{x}, \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}}\right) \]

   10. lower-/.f64 77.0

       \[\leadsto \mathsf{fma}\left(2 \cdot \cos y, \sqrt{x}, -0.3333333333333333 \cdot \color{blue}{\frac{a}{b}}\right) \]

5. Applied rewrites 77.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(2 \cdot \cos y, \sqrt{x}, -0.3333333333333333 \cdot \frac{a}{b}\right)} \]
6. Add Preprocessing

Alternative 5: 58.8% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{b \cdot 3}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{-110} \lor \neg \left(t\_1 \leq 10^{-78}\right):\\ \;\;\;\;\frac{a}{-3 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\frac{1}{-a} \cdot \sqrt{x}\right) \cdot -2\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ a (* b 3.0))))
   (if (or (<= t_1 -1e-110) (not (<= t_1 1e-78)))
     (/ a (* -3.0 b))
     (* (* (* (/ 1.0 (- a)) (sqrt x)) -2.0) a))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a / (b * 3.0);
	double tmp;
	if ((t_1 <= -1e-110) || !(t_1 <= 1e-78)) {
		tmp = a / (-3.0 * b);
	} else {
		tmp = (((1.0 / -a) * sqrt(x)) * -2.0) * a;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = a / (b * 3.0d0)
    if ((t_1 <= (-1d-110)) .or. (.not. (t_1 <= 1d-78))) then
        tmp = a / ((-3.0d0) * b)
    else
        tmp = (((1.0d0 / -a) * sqrt(x)) * (-2.0d0)) * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a / (b * 3.0);
	double tmp;
	if ((t_1 <= -1e-110) || !(t_1 <= 1e-78)) {
		tmp = a / (-3.0 * b);
	} else {
		tmp = (((1.0 / -a) * Math.sqrt(x)) * -2.0) * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = a / (b * 3.0)
	tmp = 0
	if (t_1 <= -1e-110) or not (t_1 <= 1e-78):
		tmp = a / (-3.0 * b)
	else:
		tmp = (((1.0 / -a) * math.sqrt(x)) * -2.0) * a
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a / Float64(b * 3.0))
	tmp = 0.0
	if ((t_1 <= -1e-110) || !(t_1 <= 1e-78))
		tmp = Float64(a / Float64(-3.0 * b));
	else
		tmp = Float64(Float64(Float64(Float64(1.0 / Float64(-a)) * sqrt(x)) * -2.0) * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = a / (b * 3.0);
	tmp = 0.0;
	if ((t_1 <= -1e-110) || ~((t_1 <= 1e-78)))
		tmp = a / (-3.0 * b);
	else
		tmp = (((1.0 / -a) * sqrt(x)) * -2.0) * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[t$95$1, -1e-110], N[Not[LessEqual[t$95$1, 1e-78]], $MachinePrecision]], N[(a / N[(-3.0 * b), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(1.0 / (-a)), $MachinePrecision] * N[Sqrt[x], $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision] * a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 a (*.f64 b #s(literal 3 binary64))) < -1.0000000000000001e-110 or 9.99999999999999999e-79 < (/.f64 a (*.f64 b #s(literal 3 binary64)))

   1. Initial program 80.0%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
   4. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]

      2. lower-/.f64 73.5

         \[\leadsto -0.3333333333333333 \cdot \color{blue}{\frac{a}{b}} \]

   5. Applied rewrites 73.5%

      \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
   6. Step-by-step derivation

   7. Applied rewrites 74.1%

      \[\leadsto \frac{a}{\color{blue}{-3 \cdot b}} \]

   if -1.0000000000000001e-110 < (/.f64 a (*.f64 b #s(literal 3 binary64))) < 9.99999999999999999e-79

   1. Initial program 49.7%

      \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right)}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]

   5. Applied rewrites 41.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \frac{\sqrt{x}}{a}, 2, \frac{-0.3333333333333333}{b}\right) \cdot a} \]

   6. Taylor expanded in x around -inf

      \[\leadsto \left(-2 \cdot \left(\frac{\cos \left(y + \frac{-1}{3} \cdot \left(t \cdot z\right)\right) \cdot {\left(\sqrt{-1}\right)}^{2}}{a} \cdot \sqrt{x}\right)\right) \cdot a \]
   7. Step-by-step derivation

   8. Applied rewrites 40.8%

      \[\leadsto \left(\left(\left(\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \frac{-1}{a}\right) \cdot \sqrt{x}\right) \cdot -2\right) \cdot a \]

   9. Taylor expanded in y around 0

      \[\leadsto \left(\left(\left(-1 \cdot \frac{\cos \left(\frac{-1}{3} \cdot \left(t \cdot z\right)\right)}{a}\right) \cdot \sqrt{x}\right) \cdot -2\right) \cdot a \]
   10. Step-by-step derivation

   11. Applied rewrites 24.4%

       \[\leadsto \left(\left(\frac{\cos \left(0.3333333333333333 \cdot \left(t \cdot z\right)\right)}{-a} \cdot \sqrt{x}\right) \cdot -2\right) \cdot a \]

   12. Taylor expanded in z around 0

       \[\leadsto \left(\left(\frac{1}{-a} \cdot \sqrt{x}\right) \cdot -2\right) \cdot a \]
   13. Step-by-step derivation

   14. Applied rewrites 24.2%

       \[\leadsto \left(\left(\frac{1}{-a} \cdot \sqrt{x}\right) \cdot -2\right) \cdot a \]
3. Recombined 2 regimes into one program.

4. Final simplification 59.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{a}{b \cdot 3} \leq -1 \cdot 10^{-110} \lor \neg \left(\frac{a}{b \cdot 3} \leq 10^{-78}\right):\\ \;\;\;\;\frac{a}{-3 \cdot b}\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\frac{1}{-a} \cdot \sqrt{x}\right) \cdot -2\right) \cdot a\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 63.5% accurate, 3.6× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\frac{2}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (* (fma (/ 2.0 a) (sqrt x) (/ -0.3333333333333333 b)) a))

C

double code(double x, double y, double z, double t, double a, double b) {
	return fma((2.0 / a), sqrt(x), (-0.3333333333333333 / b)) * a;
}

Julia

function code(x, y, z, t, a, b)
	return Float64(fma(Float64(2.0 / a), sqrt(x), Float64(-0.3333333333333333 / b)) * a)
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(N[(2.0 / a), $MachinePrecision] * N[Sqrt[x], $MachinePrecision] + N[(-0.3333333333333333 / b), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in a around inf

   \[\leadsto \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right)}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]

5. Applied rewrites 67.3%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \frac{\sqrt{x}}{a}, 2, \frac{-0.3333333333333333}{b}\right) \cdot a} \]

6. Taylor expanded in z around 0

   \[\leadsto \frac{2}{3} \cdot \left(\left(t \cdot \left(z \cdot \sin y\right)\right) \cdot \sqrt{x}\right) + \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos y}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]
7. Step-by-step derivation

8. Applied rewrites 62.7%

   \[\leadsto \mathsf{fma}\left(0.6666666666666666 \cdot \left(\left(\sin y \cdot z\right) \cdot t\right), \color{blue}{\sqrt{x}}, \mathsf{fma}\left(2 \cdot \frac{\cos y}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a\right) \]
9. Step-by-step derivation

10. Applied rewrites 63.9%

    \[\leadsto \color{blue}{\mathsf{fma}\left(\sqrt{x} \cdot \left(\left(\sin y \cdot z\right) \cdot 0.6666666666666666\right), t, \mathsf{fma}\left(2 \cdot \sqrt{x}, \frac{\cos y}{a}, \frac{-0.3333333333333333}{b}\right) \cdot a\right)} \]

11. Taylor expanded in y around 0

    \[\leadsto a \cdot \left(2 \cdot \left(\frac{1}{a} \cdot \sqrt{x}\right) - \color{blue}{\frac{1}{3} \cdot \frac{1}{b}}\right) \]
12. Step-by-step derivation

13. Applied rewrites 65.6%

    \[\leadsto \mathsf{fma}\left(\frac{2}{a}, \sqrt{x}, \frac{-0.3333333333333333}{b}\right) \cdot a \]
14. Add Preprocessing

Alternative 7: 50.4% accurate, 9.4× speedup

Math

\[\begin{array}{l} \\ \frac{a}{-3 \cdot b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (/ a (* -3.0 b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return a / (-3.0 * b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = a / ((-3.0d0) * b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return a / (-3.0 * b);
}

Python

def code(x, y, z, t, a, b):
	return a / (-3.0 * b)

Julia

function code(x, y, z, t, a, b)
	return Float64(a / Float64(-3.0 * b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = a / (-3.0 * b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(a / N[(-3.0 * b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]

   2. lower-/.f64 52.4

      \[\leadsto -0.3333333333333333 \cdot \color{blue}{\frac{a}{b}} \]

5. Applied rewrites 52.4%

   \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
6. Step-by-step derivation

7. Applied rewrites 52.8%

   \[\leadsto \frac{a}{\color{blue}{-3 \cdot b}} \]
8. Add Preprocessing

Alternative 8: 50.3% accurate, 9.4× speedup

Math

\[\begin{array}{l} \\ \frac{-0.3333333333333333}{b} \cdot a \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (* (/ -0.3333333333333333 b) a))

C

double code(double x, double y, double z, double t, double a, double b) {
	return (-0.3333333333333333 / b) * a;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((-0.3333333333333333d0) / b) * a
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return (-0.3333333333333333 / b) * a;
}

Python

def code(x, y, z, t, a, b):
	return (-0.3333333333333333 / b) * a

Julia

function code(x, y, z, t, a, b)
	return Float64(Float64(-0.3333333333333333 / b) * a)
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = (-0.3333333333333333 / b) * a;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(-0.3333333333333333 / b), $MachinePrecision] * a), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in a around inf

   \[\leadsto \color{blue}{a \cdot \left(2 \cdot \left(\frac{\cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right)}{a} \cdot \sqrt{x}\right) - \frac{1}{3} \cdot \frac{1}{b}\right)} \]

5. Applied rewrites 67.3%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \frac{\sqrt{x}}{a}, 2, \frac{-0.3333333333333333}{b}\right) \cdot a} \]

6. Taylor expanded in a around inf

   \[\leadsto \frac{\frac{-1}{3}}{b} \cdot a \]
7. Step-by-step derivation

8. Applied rewrites 52.7%

   \[\leadsto \frac{-0.3333333333333333}{b} \cdot a \]
9. Add Preprocessing

Alternative 9: 50.3% accurate, 9.4× speedup

Math

\[\begin{array}{l} \\ -0.3333333333333333 \cdot \frac{a}{b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (* -0.3333333333333333 (/ a b)))

C

double code(double x, double y, double z, double t, double a, double b) {
	return -0.3333333333333333 * (a / b);
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (-0.3333333333333333d0) * (a / b)
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	return -0.3333333333333333 * (a / b);
}

Python

def code(x, y, z, t, a, b):
	return -0.3333333333333333 * (a / b)

Julia

function code(x, y, z, t, a, b)
	return Float64(-0.3333333333333333 * Float64(a / b))
end

MATLAB

function tmp = code(x, y, z, t, a, b)
	tmp = -0.3333333333333333 * (a / b);
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(-0.3333333333333333 * N[(a / b), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 70.9%

   \[\left(2 \cdot \sqrt{x}\right) \cdot \cos \left(y - \frac{z \cdot t}{3}\right) - \frac{a}{b \cdot 3} \]
2. Add Preprocessing

3. Taylor expanded in a around inf

   \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]
4. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{-1}{3} \cdot \frac{a}{b}} \]

   2. lower-/.f64 52.4

      \[\leadsto -0.3333333333333333 \cdot \color{blue}{\frac{a}{b}} \]

5. Applied rewrites 52.4%

   \[\leadsto \color{blue}{-0.3333333333333333 \cdot \frac{a}{b}} \]
6. Add Preprocessing

Developer Target 1: 73.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\frac{0.3333333333333333}{z}}{t}\\ t_2 := \frac{\frac{a}{3}}{b}\\ t_3 := 2 \cdot \sqrt{x}\\ \mathbf{if}\;z < -1.3793337487235141 \cdot 10^{+129}:\\ \;\;\;\;t\_3 \cdot \cos \left(\frac{1}{y} - t\_1\right) - t\_2\\ \mathbf{elif}\;z < 3.516290613555987 \cdot 10^{+106}:\\ \;\;\;\;\left(\sqrt{x} \cdot 2\right) \cdot \cos \left(y - \frac{t}{3} \cdot z\right) - t\_2\\ \mathbf{else}:\\ \;\;\;\;\cos \left(y - t\_1\right) \cdot t\_3 - \frac{\frac{a}{b}}{3}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (/ 0.3333333333333333 z) t))
        (t_2 (/ (/ a 3.0) b))
        (t_3 (* 2.0 (sqrt x))))
   (if (< z -1.3793337487235141e+129)
     (- (* t_3 (cos (- (/ 1.0 y) t_1))) t_2)
     (if (< z 3.516290613555987e+106)
       (- (* (* (sqrt x) 2.0) (cos (- y (* (/ t 3.0) z)))) t_2)
       (- (* (cos (- y t_1)) t_3) (/ (/ a b) 3.0))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (0.3333333333333333 / z) / t;
	double t_2 = (a / 3.0) / b;
	double t_3 = 2.0 * sqrt(x);
	double tmp;
	if (z < -1.3793337487235141e+129) {
		tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
	} else if (z < 3.516290613555987e+106) {
		tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
	} else {
		tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t, a, b)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: t_3
    real(8) :: tmp
    t_1 = (0.3333333333333333d0 / z) / t
    t_2 = (a / 3.0d0) / b
    t_3 = 2.0d0 * sqrt(x)
    if (z < (-1.3793337487235141d+129)) then
        tmp = (t_3 * cos(((1.0d0 / y) - t_1))) - t_2
    else if (z < 3.516290613555987d+106) then
        tmp = ((sqrt(x) * 2.0d0) * cos((y - ((t / 3.0d0) * z)))) - t_2
    else
        tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (0.3333333333333333 / z) / t;
	double t_2 = (a / 3.0) / b;
	double t_3 = 2.0 * Math.sqrt(x);
	double tmp;
	if (z < -1.3793337487235141e+129) {
		tmp = (t_3 * Math.cos(((1.0 / y) - t_1))) - t_2;
	} else if (z < 3.516290613555987e+106) {
		tmp = ((Math.sqrt(x) * 2.0) * Math.cos((y - ((t / 3.0) * z)))) - t_2;
	} else {
		tmp = (Math.cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (0.3333333333333333 / z) / t
	t_2 = (a / 3.0) / b
	t_3 = 2.0 * math.sqrt(x)
	tmp = 0
	if z < -1.3793337487235141e+129:
		tmp = (t_3 * math.cos(((1.0 / y) - t_1))) - t_2
	elif z < 3.516290613555987e+106:
		tmp = ((math.sqrt(x) * 2.0) * math.cos((y - ((t / 3.0) * z)))) - t_2
	else:
		tmp = (math.cos((y - t_1)) * t_3) - ((a / b) / 3.0)
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(0.3333333333333333 / z) / t)
	t_2 = Float64(Float64(a / 3.0) / b)
	t_3 = Float64(2.0 * sqrt(x))
	tmp = 0.0
	if (z < -1.3793337487235141e+129)
		tmp = Float64(Float64(t_3 * cos(Float64(Float64(1.0 / y) - t_1))) - t_2);
	elseif (z < 3.516290613555987e+106)
		tmp = Float64(Float64(Float64(sqrt(x) * 2.0) * cos(Float64(y - Float64(Float64(t / 3.0) * z)))) - t_2);
	else
		tmp = Float64(Float64(cos(Float64(y - t_1)) * t_3) - Float64(Float64(a / b) / 3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (0.3333333333333333 / z) / t;
	t_2 = (a / 3.0) / b;
	t_3 = 2.0 * sqrt(x);
	tmp = 0.0;
	if (z < -1.3793337487235141e+129)
		tmp = (t_3 * cos(((1.0 / y) - t_1))) - t_2;
	elseif (z < 3.516290613555987e+106)
		tmp = ((sqrt(x) * 2.0) * cos((y - ((t / 3.0) * z)))) - t_2;
	else
		tmp = (cos((y - t_1)) * t_3) - ((a / b) / 3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(0.3333333333333333 / z), $MachinePrecision] / t), $MachinePrecision]}, Block[{t$95$2 = N[(N[(a / 3.0), $MachinePrecision] / b), $MachinePrecision]}, Block[{t$95$3 = N[(2.0 * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[Less[z, -1.3793337487235141e+129], N[(N[(t$95$3 * N[Cos[N[(N[(1.0 / y), $MachinePrecision] - t$95$1), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], If[Less[z, 3.516290613555987e+106], N[(N[(N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision] * N[Cos[N[(y - N[(N[(t / 3.0), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision] - t$95$2), $MachinePrecision], N[(N[(N[Cos[N[(y - t$95$1), $MachinePrecision]], $MachinePrecision] * t$95$3), $MachinePrecision] - N[(N[(a / b), $MachinePrecision] / 3.0), $MachinePrecision]), $MachinePrecision]]]]]]

Reproduce

herbie shell --seed 2024313 
(FPCore (x y z t a b)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, K"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z -1379333748723514100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* 2 (sqrt x)) (cos (- (/ 1 y) (/ (/ 3333333333333333/10000000000000000 z) t)))) (/ (/ a 3) b)) (if (< z 35162906135559870000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- (* (* (sqrt x) 2) (cos (- y (* (/ t 3) z)))) (/ (/ a 3) b)) (- (* (cos (- y (/ (/ 3333333333333333/10000000000000000 z) t))) (* 2 (sqrt x))) (/ (/ a b) 3)))))

  (- (* (* 2.0 (sqrt x)) (cos (- y (/ (* z t) 3.0)))) (/ a (* b 3.0))))