Diagrams.ThreeD.Transform:aboutX from diagrams-lib-1.3.0.3, B

Percentage Accurate: 99.8% → 99.8%

Time: 9.5s

Alternatives: 7

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x \cdot \sin y + z \cdot \cos y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (sin y)) (* z (cos y))))

C

double code(double x, double y, double z) {
	return (x * sin(y)) + (z * cos(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * sin(y)) + (z * cos(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.sin(y)) + (z * Math.cos(y));
}

Python

def code(x, y, z):
	return (x * math.sin(y)) + (z * math.cos(y))

Julia

function code(x, y, z)
	return Float64(Float64(x * sin(y)) + Float64(z * cos(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * sin(y)) + (z * cos(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot \sin y + z \cdot \cos y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ (* x (sin y)) (* z (cos y))))

C

double code(double x, double y, double z) {
	return (x * sin(y)) + (z * cos(y));
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * sin(y)) + (z * cos(y))
end function

Java

public static double code(double x, double y, double z) {
	return (x * Math.sin(y)) + (z * Math.cos(y));
}

Python

def code(x, y, z):
	return (x * math.sin(y)) + (z * math.cos(y))

Julia

function code(x, y, z)
	return Float64(Float64(x * sin(y)) + Float64(z * cos(y)))
end

MATLAB

function tmp = code(x, y, z)
	tmp = (x * sin(y)) + (z * cos(y));
end

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision] + N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\sin y, x, z \cdot \cos y\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma (sin y) x (* z (cos y))))

C

double code(double x, double y, double z) {
	return fma(sin(y), x, (z * cos(y)));
}

Julia

function code(x, y, z)
	return fma(sin(y), x, Float64(z * cos(y)))
end

Wolfram

code[x_, y_, z_] := N[(N[Sin[y], $MachinePrecision] * x + N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[x \cdot \sin y + z \cdot \cos y \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{x \cdot \sin y + z \cdot \cos y} \]

   2. lift-*.f64 N/A

      \[\leadsto \color{blue}{x \cdot \sin y} + z \cdot \cos y \]

   3. *-commutative N/A

      \[\leadsto \color{blue}{\sin y \cdot x} + z \cdot \cos y \]

   4. lower-fma.f64 99.8

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, x, z \cdot \cos y\right)} \]

   5. lift-*.f64 N/A

      \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{z \cdot \cos y}\right) \]

   6. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{\cos y \cdot z}\right) \]

   7. lower-*.f64 99.8

      \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{\cos y \cdot z}\right) \]

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, x, \cos y \cdot z\right)} \]

5. Final simplification 99.8%

   \[\leadsto \mathsf{fma}\left(\sin y, x, z \cdot \cos y\right) \]
6. Add Preprocessing

Alternative 2: 74.9% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;y \leq -2.3 \cdot 10^{+263}:\\ \;\;\;\;x \cdot \sin y\\ \mathbf{elif}\;y \leq -135:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x \cdot y, -0.5 \cdot z\right), y, x\right), y, z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= y -2.3e+263)
     (* x (sin y))
     (if (<= y -135.0)
       t_0
       (if (<= y 2.6e-11)
         (fma (fma (fma -0.16666666666666666 (* x y) (* -0.5 z)) y x) y z)
         t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (y <= -2.3e+263) {
		tmp = x * sin(y);
	} else if (y <= -135.0) {
		tmp = t_0;
	} else if (y <= 2.6e-11) {
		tmp = fma(fma(fma(-0.16666666666666666, (x * y), (-0.5 * z)), y, x), y, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (y <= -2.3e+263)
		tmp = Float64(x * sin(y));
	elseif (y <= -135.0)
		tmp = t_0;
	elseif (y <= 2.6e-11)
		tmp = fma(fma(fma(-0.16666666666666666, Float64(x * y), Float64(-0.5 * z)), y, x), y, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -2.3e+263], N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision], If[LessEqual[y, -135.0], t$95$0, If[LessEqual[y, 2.6e-11], N[(N[(N[(-0.16666666666666666 * N[(x * y), $MachinePrecision] + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision] * y + z), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -2.29999999999999997e263

   1. Initial program 99.6%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x \cdot \sin y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\sin y \cdot x} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\sin y \cdot x} \]

      3. lower-sin.f64 73.6

         \[\leadsto \color{blue}{\sin y} \cdot x \]

   5. Applied rewrites 73.6%

      \[\leadsto \color{blue}{\sin y \cdot x} \]

   if -2.29999999999999997e263 < y < -135 or 2.6000000000000001e-11 < y

   1. Initial program 99.5%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \cos y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      3. lower-cos.f64 61.6

         \[\leadsto \color{blue}{\cos y} \cdot z \]

   5. Applied rewrites 61.6%

      \[\leadsto \color{blue}{\cos y \cdot z} \]

   if -135 < y < 2.6000000000000001e-11

   1. Initial program 100.0%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{z + y \cdot \left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right) + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right) \cdot y} + z \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right), y, z\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right) + x}, y, z\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right) \cdot y} + x, y, z\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right), y, x\right)}, y, z\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{6} \cdot \left(x \cdot y\right) + \frac{-1}{2} \cdot z}, y, x\right), y, z\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{-1}{6}, x \cdot y, \frac{-1}{2} \cdot z\right)}, y, x\right), y, z\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot x}, \frac{-1}{2} \cdot z\right), y, x\right), y, z\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot x}, \frac{-1}{2} \cdot z\right), y, x\right), y, z\right) \]

      11. lower-*.f64 99.4

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y \cdot x, \color{blue}{-0.5 \cdot z}\right), y, x\right), y, z\right) \]

   5. Applied rewrites 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y \cdot x, -0.5 \cdot z\right), y, x\right), y, z\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 82.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.3 \cdot 10^{+263}:\\ \;\;\;\;x \cdot \sin y\\ \mathbf{elif}\;y \leq -135:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x \cdot y, -0.5 \cdot z\right), y, x\right), y, z\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 85.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(\sin y, x, 1 \cdot z\right)\\ \mathbf{if}\;x \leq -4.5 \cdot 10^{-74}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{+14}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (fma (sin y) x (* 1.0 z))))
   (if (<= x -4.5e-74) t_0 (if (<= x 1.65e+14) (* z (cos y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = fma(sin(y), x, (1.0 * z));
	double tmp;
	if (x <= -4.5e-74) {
		tmp = t_0;
	} else if (x <= 1.65e+14) {
		tmp = z * cos(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = fma(sin(y), x, Float64(1.0 * z))
	tmp = 0.0
	if (x <= -4.5e-74)
		tmp = t_0;
	elseif (x <= 1.65e+14)
		tmp = Float64(z * cos(y));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[Sin[y], $MachinePrecision] * x + N[(1.0 * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, -4.5e-74], t$95$0, If[LessEqual[x, 1.65e+14], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.4999999999999999e-74 or 1.65e14 < x

   1. Initial program 99.8%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x \cdot \sin y + z \cdot \cos y} \]

      2. lift-*.f64 N/A

         \[\leadsto \color{blue}{x \cdot \sin y} + z \cdot \cos y \]

      3. *-commutative N/A

         \[\leadsto \color{blue}{\sin y \cdot x} + z \cdot \cos y \]

      4. lower-fma.f64 99.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, x, z \cdot \cos y\right)} \]

      5. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{z \cdot \cos y}\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{\cos y \cdot z}\right) \]

      7. lower-*.f64 99.8

         \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{\cos y \cdot z}\right) \]

   4. Applied rewrites 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, x, \cos y \cdot z\right)} \]

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{1} \cdot z\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 90.3%

      \[\leadsto \mathsf{fma}\left(\sin y, x, \color{blue}{1} \cdot z\right) \]

   if -4.4999999999999999e-74 < x < 1.65e14

   1. Initial program 99.7%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \cos y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      3. lower-cos.f64 88.5

         \[\leadsto \color{blue}{\cos y} \cdot z \]

   5. Applied rewrites 88.5%

      \[\leadsto \color{blue}{\cos y \cdot z} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{-74}:\\ \;\;\;\;\mathsf{fma}\left(\sin y, x, 1 \cdot z\right)\\ \mathbf{elif}\;x \leq 1.65 \cdot 10^{+14}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\sin y, x, 1 \cdot z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 74.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;y \leq -135:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x \cdot y, -0.5 \cdot z\right), y, x\right), y, z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= y -135.0)
     t_0
     (if (<= y 2.6e-11)
       (fma (fma (fma -0.16666666666666666 (* x y) (* -0.5 z)) y x) y z)
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (y <= -135.0) {
		tmp = t_0;
	} else if (y <= 2.6e-11) {
		tmp = fma(fma(fma(-0.16666666666666666, (x * y), (-0.5 * z)), y, x), y, z);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (y <= -135.0)
		tmp = t_0;
	elseif (y <= 2.6e-11)
		tmp = fma(fma(fma(-0.16666666666666666, Float64(x * y), Float64(-0.5 * z)), y, x), y, z);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -135.0], t$95$0, If[LessEqual[y, 2.6e-11], N[(N[(N[(-0.16666666666666666 * N[(x * y), $MachinePrecision] + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision] * y + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -135 or 2.6000000000000001e-11 < y

   1. Initial program 99.5%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \cos y} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\cos y \cdot z} \]

      3. lower-cos.f64 58.5

         \[\leadsto \color{blue}{\cos y} \cdot z \]

   5. Applied rewrites 58.5%

      \[\leadsto \color{blue}{\cos y \cdot z} \]

   if -135 < y < 2.6000000000000001e-11

   1. Initial program 100.0%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{z + y \cdot \left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{y \cdot \left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right) + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right)\right) \cdot y} + z \]

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x + y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right), y, z\right)} \]

      4. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right) + x}, y, z\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right)\right) \cdot y} + x, y, z\right) \]

      6. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{-1}{2} \cdot z + \frac{-1}{6} \cdot \left(x \cdot y\right), y, x\right)}, y, z\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{6} \cdot \left(x \cdot y\right) + \frac{-1}{2} \cdot z}, y, x\right), y, z\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{-1}{6}, x \cdot y, \frac{-1}{2} \cdot z\right)}, y, x\right), y, z\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot x}, \frac{-1}{2} \cdot z\right), y, x\right), y, z\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{6}, \color{blue}{y \cdot x}, \frac{-1}{2} \cdot z\right), y, x\right), y, z\right) \]

      11. lower-*.f64 99.4

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y \cdot x, \color{blue}{-0.5 \cdot z}\right), y, x\right), y, z\right) \]

   5. Applied rewrites 99.4%

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

4. Final simplification 81.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -135:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-11}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, x \cdot y, -0.5 \cdot z\right), y, x\right), y, z\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 40.1% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7.6 \cdot 10^{+90}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.08 \cdot 10^{+21}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -7.6e+90) (* x y) (if (<= x 1.08e+21) (* 1.0 z) (* x y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -7.6e+90) {
		tmp = x * y;
	} else if (x <= 1.08e+21) {
		tmp = 1.0 * z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-7.6d+90)) then
        tmp = x * y
    else if (x <= 1.08d+21) then
        tmp = 1.0d0 * z
    else
        tmp = x * y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -7.6e+90) {
		tmp = x * y;
	} else if (x <= 1.08e+21) {
		tmp = 1.0 * z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -7.6e+90:
		tmp = x * y
	elif x <= 1.08e+21:
		tmp = 1.0 * z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -7.6e+90)
		tmp = Float64(x * y);
	elseif (x <= 1.08e+21)
		tmp = Float64(1.0 * z);
	else
		tmp = Float64(x * y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -7.6e+90)
		tmp = x * y;
	elseif (x <= 1.08e+21)
		tmp = 1.0 * z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -7.6e+90], N[(x * y), $MachinePrecision], If[LessEqual[x, 1.08e+21], N[(1.0 * z), $MachinePrecision], N[(x * y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -7.6000000000000002e90 or 1.08e21 < x

   1. Initial program 99.8%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0

      \[\leadsto \color{blue}{z + x \cdot y} \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \color{blue}{x \cdot y + z} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{y \cdot x} + z \]

      3. lower-fma.f64 59.4

         \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]

   5. Applied rewrites 59.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]

   6. Taylor expanded in z around 0

      \[\leadsto x \cdot \color{blue}{y} \]
   7. Step-by-step derivation

   8. Applied rewrites 42.4%

      \[\leadsto y \cdot \color{blue}{x} \]

   if -7.6000000000000002e90 < x < 1.08e21

   1. Initial program 99.8%

      \[x \cdot \sin y + z \cdot \cos y \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{x \cdot \sin y + z \cdot \cos y} \]

      2. flip-+ N/A

         \[\leadsto \color{blue}{\frac{\left(x \cdot \sin y\right) \cdot \left(x \cdot \sin y\right) - \left(z \cdot \cos y\right) \cdot \left(z \cdot \cos y\right)}{x \cdot \sin y - z \cdot \cos y}} \]

      3. clear-num N/A

         \[\leadsto \color{blue}{\frac{1}{\frac{x \cdot \sin y - z \cdot \cos y}{\left(x \cdot \sin y\right) \cdot \left(x \cdot \sin y\right) - \left(z \cdot \cos y\right) \cdot \left(z \cdot \cos y\right)}}} \]

      4. associate-/r/ N/A

         \[\leadsto \color{blue}{\frac{1}{x \cdot \sin y - z \cdot \cos y} \cdot \left(\left(x \cdot \sin y\right) \cdot \left(x \cdot \sin y\right) - \left(z \cdot \cos y\right) \cdot \left(z \cdot \cos y\right)\right)} \]

      5. flip3-- N/A

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

      6. clear-num N/A

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

   4. Applied rewrites 62.2%

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

   5. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(\cos y + \frac{x \cdot \sin y}{z}\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(\cos y + \frac{x \cdot \sin y}{z}\right) \cdot z} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\cos y + \frac{x \cdot \sin y}{z}\right) \cdot z} \]

      3. +-commutative N/A

         \[\leadsto \color{blue}{\left(\frac{x \cdot \sin y}{z} + \cos y\right)} \cdot z \]

      4. associate-/l* N/A

         \[\leadsto \left(\color{blue}{x \cdot \frac{\sin y}{z}} + \cos y\right) \cdot z \]

      5. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{\sin y}{z}, \cos y\right)} \cdot z \]

      6. lower-/.f64 N/A

         \[\leadsto \mathsf{fma}\left(x, \color{blue}{\frac{\sin y}{z}}, \cos y\right) \cdot z \]

      7. lower-sin.f64 N/A

         \[\leadsto \mathsf{fma}\left(x, \frac{\color{blue}{\sin y}}{z}, \cos y\right) \cdot z \]

      8. lower-cos.f64 99.7

         \[\leadsto \mathsf{fma}\left(x, \frac{\sin y}{z}, \color{blue}{\cos y}\right) \cdot z \]

   7. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \frac{\sin y}{z}, \cos y\right) \cdot z} \]

   8. Taylor expanded in y around 0

      \[\leadsto 1 \cdot z \]
   9. Step-by-step derivation

   10. Applied rewrites 51.9%

       \[\leadsto 1 \cdot z \]
3. Recombined 2 regimes into one program.

4. Final simplification 48.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -7.6 \cdot 10^{+90}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1.08 \cdot 10^{+21}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 52.3% accurate, 30.6× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, x, z\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (fma y x z))

C

double code(double x, double y, double z) {
	return fma(y, x, z);
}

Julia

function code(x, y, z)
	return fma(y, x, z)
end

Wolfram

code[x_, y_, z_] := N[(y * x + z), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[x \cdot \sin y + z \cdot \cos y \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{z + x \cdot y} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{x \cdot y + z} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{y \cdot x} + z \]

   3. lower-fma.f64 57.3

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]

5. Applied rewrites 57.3%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]
6. Add Preprocessing

Alternative 7: 16.7% accurate, 35.7× speedup

Math

\[\begin{array}{l} \\ x \cdot y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (* x y))

C

double code(double x, double y, double z) {
	return x * y;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x * y
end function

Java

public static double code(double x, double y, double z) {
	return x * y;
}

Python

def code(x, y, z):
	return x * y

Julia

function code(x, y, z)
	return Float64(x * y)
end

MATLAB

function tmp = code(x, y, z)
	tmp = x * y;
end

Wolfram

code[x_, y_, z_] := N[(x * y), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[x \cdot \sin y + z \cdot \cos y \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto \color{blue}{z + x \cdot y} \]
4. Step-by-step derivation

   1. +-commutative N/A

      \[\leadsto \color{blue}{x \cdot y + z} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{y \cdot x} + z \]

   3. lower-fma.f64 57.3

      \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]

5. Applied rewrites 57.3%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y, x, z\right)} \]

6. Taylor expanded in z around 0

   \[\leadsto x \cdot \color{blue}{y} \]
7. Step-by-step derivation

8. Applied rewrites 22.0%

   \[\leadsto y \cdot \color{blue}{x} \]

9. Final simplification 22.0%

   \[\leadsto x \cdot y \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2024263 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Transform:aboutX from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ (* x (sin y)) (* z (cos y))))