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

Percentage Accurate: 70.7% → 76.8%

Time: 19.6s

Alternatives: 7

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: 70.7% 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.8% accurate, 1.1× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a, double b) {
	return (cos(y) * (sqrt(x) * 2.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 = (cos(y) * (sqrt(x) * 2.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 (Math.cos(y) * (Math.sqrt(x) * 2.0)) - (a / (b * 3.0));
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.4%

   \[\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 79.0

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

5. Applied rewrites 79.0%

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

6. Final simplification 79.0%

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

Alternative 2: 67.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{a}{b \cdot 3}\\ t_2 := \frac{a}{-3 \cdot b}\\ \mathbf{if}\;t\_1 \leq -2 \cdot 10^{+15}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-83}:\\ \;\;\;\;\cos \left(\mathsf{fma}\left(-0.3333333333333333, t \cdot z, y\right)\right) \cdot \left(\sqrt{x} \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ a (* b 3.0))) (t_2 (/ a (* -3.0 b))))
   (if (<= t_1 -2e+15)
     t_2
     (if (<= t_1 5e-83)
       (* (cos (fma -0.3333333333333333 (* t z) y)) (* (sqrt x) 2.0))
       t_2))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = a / (b * 3.0);
	double t_2 = a / (-3.0 * b);
	double tmp;
	if (t_1 <= -2e+15) {
		tmp = t_2;
	} else if (t_1 <= 5e-83) {
		tmp = cos(fma(-0.3333333333333333, (t * z), y)) * (sqrt(x) * 2.0);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(a / Float64(b * 3.0))
	t_2 = Float64(a / Float64(-3.0 * b))
	tmp = 0.0
	if (t_1 <= -2e+15)
		tmp = t_2;
	elseif (t_1 <= 5e-83)
		tmp = Float64(cos(fma(-0.3333333333333333, Float64(t * z), y)) * Float64(sqrt(x) * 2.0));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 a (*.f64 b #s(literal 3 binary64))) < -2e15 or 5e-83 < (/.f64 a (*.f64 b #s(literal 3 binary64)))

   1. Initial program 78.5%

      \[\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 83.7

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

   5. Applied rewrites 83.7%

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

   7. Applied rewrites 84.2%

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

   if -2e15 < (/.f64 a (*.f64 b #s(literal 3 binary64))) < 5e-83

   1. Initial program 60.3%

      \[\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 \cos \left(y - \frac{1}{3} \cdot \left(t \cdot z\right)\right)\right)} \]

   5. Applied rewrites 56.4%

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

4. Final simplification 73.3%

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

Alternative 3: 76.7% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 71.4%

   \[\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. *-commutative N/A

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

   3. associate-*r* N/A

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

   4. metadata-eval N/A

      \[\leadsto \left(2 \cdot \cos y\right) \cdot \sqrt{x} + \color{blue}{\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 78.7

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

5. Applied rewrites 78.7%

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

6. Final simplification 78.7%

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

Alternative 4: 59.7% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \cdot z \leq -4 \cdot 10^{-19}:\\ \;\;\;\;\frac{1}{\frac{-3 \cdot b}{a}}\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{-89}:\\ \;\;\;\;\mathsf{fma}\left(\left(t \cdot t\right) \cdot -0.05555555555555555, z \cdot z, 1\right) \cdot \left(\sqrt{x} \cdot 2\right) - \frac{a}{b \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{-0.3333333333333333 \cdot a}{b}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (if (<= (* t z) -4e-19)
   (/ 1.0 (/ (* -3.0 b) a))
   (if (<= (* t z) 2e-89)
     (-
      (* (fma (* (* t t) -0.05555555555555555) (* z z) 1.0) (* (sqrt x) 2.0))
      (/ a (* b 3.0)))
     (/ (* -0.3333333333333333 a) b))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double tmp;
	if ((t * z) <= -4e-19) {
		tmp = 1.0 / ((-3.0 * b) / a);
	} else if ((t * z) <= 2e-89) {
		tmp = (fma(((t * t) * -0.05555555555555555), (z * z), 1.0) * (sqrt(x) * 2.0)) - (a / (b * 3.0));
	} else {
		tmp = (-0.3333333333333333 * a) / b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	tmp = 0.0
	if (Float64(t * z) <= -4e-19)
		tmp = Float64(1.0 / Float64(Float64(-3.0 * b) / a));
	elseif (Float64(t * z) <= 2e-89)
		tmp = Float64(Float64(fma(Float64(Float64(t * t) * -0.05555555555555555), Float64(z * z), 1.0) * Float64(sqrt(x) * 2.0)) - Float64(a / Float64(b * 3.0)));
	else
		tmp = Float64(Float64(-0.3333333333333333 * a) / b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := If[LessEqual[N[(t * z), $MachinePrecision], -4e-19], N[(1.0 / N[(N[(-3.0 * b), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(t * z), $MachinePrecision], 2e-89], N[(N[(N[(N[(N[(t * t), $MachinePrecision] * -0.05555555555555555), $MachinePrecision] * N[(z * z), $MachinePrecision] + 1.0), $MachinePrecision] * N[(N[Sqrt[x], $MachinePrecision] * 2.0), $MachinePrecision]), $MachinePrecision] - N[(a / N[(b * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(-0.3333333333333333 * a), $MachinePrecision] / b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 z t) < -3.9999999999999999e-19

   1. Initial program 46.1%

      \[\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 59.0

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

   5. Applied rewrites 59.0%

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

   7. Applied rewrites 59.0%

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

   if -3.9999999999999999e-19 < (*.f64 z t) < 2.00000000000000008e-89

   1. Initial program 99.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 z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

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

   5. Applied rewrites 96.9%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 70.6%

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

   if 2.00000000000000008e-89 < (*.f64 z t)

   1. Initial program 56.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 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 50.7

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

   5. Applied rewrites 50.7%

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

   7. Applied rewrites 51.8%

      \[\leadsto \frac{-0.3333333333333333 \cdot a}{\color{blue}{b}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 61.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \cdot z \leq -4 \cdot 10^{-19}:\\ \;\;\;\;\frac{1}{\frac{-3 \cdot b}{a}}\\ \mathbf{elif}\;t \cdot z \leq 2 \cdot 10^{-89}:\\ \;\;\;\;\mathsf{fma}\left(\left(t \cdot t\right) \cdot -0.05555555555555555, z \cdot z, 1\right) \cdot \left(\sqrt{x} \cdot 2\right) - \frac{a}{b \cdot 3}\\ \mathbf{else}:\\ \;\;\;\;\frac{-0.3333333333333333 \cdot a}{b}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 50.8% 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 71.4%

   \[\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 54.0

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

5. Applied rewrites 54.0%

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

7. Applied rewrites 54.3%

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

Alternative 6: 50.8% 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 71.4%

   \[\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 54.0

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

5. Applied rewrites 54.0%

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

7. Applied rewrites 54.3%

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

Alternative 7: 50.8% accurate, 9.4× speedup

Math

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

FPCore

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

C

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

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 / b) * (-0.3333333333333333d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 71.4%

   \[\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 54.0

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

5. Applied rewrites 54.0%

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

6. Final simplification 54.0%

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

Developer Target 1: 74.5% 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 2024235 
(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))))