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

Percentage Accurate: 99.8% → 99.8%

Time: 8.6s

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: 76.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ t_1 := x \cdot \sin y\\ \mathbf{if}\;y \leq -9.5 \cdot 10^{+123}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -0.68:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 0.0076:\\ \;\;\;\;\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{elif}\;y \leq 1.9 \cdot 10^{+48}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))) (t_1 (* x (sin y))))
   (if (<= y -9.5e+123)
     t_0
     (if (<= y -0.68)
       t_1
       (if (<= y 0.0076)
         (fma (fma (fma -0.16666666666666666 (* x y) (* -0.5 z)) y x) y z)
         (if (<= y 1.9e+48) t_0 t_1))))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double t_1 = x * sin(y);
	double tmp;
	if (y <= -9.5e+123) {
		tmp = t_0;
	} else if (y <= -0.68) {
		tmp = t_1;
	} else if (y <= 0.0076) {
		tmp = fma(fma(fma(-0.16666666666666666, (x * y), (-0.5 * z)), y, x), y, z);
	} else if (y <= 1.9e+48) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	t_1 = Float64(x * sin(y))
	tmp = 0.0
	if (y <= -9.5e+123)
		tmp = t_0;
	elseif (y <= -0.68)
		tmp = t_1;
	elseif (y <= 0.0076)
		tmp = fma(fma(fma(-0.16666666666666666, Float64(x * y), Float64(-0.5 * z)), y, x), y, z);
	elseif (y <= 1.9e+48)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9.5e+123], t$95$0, If[LessEqual[y, -0.68], t$95$1, If[LessEqual[y, 0.0076], N[(N[(N[(-0.16666666666666666 * N[(x * y), $MachinePrecision] + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision] * y + z), $MachinePrecision], If[LessEqual[y, 1.9e+48], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -9.4999999999999996e123 or 0.00759999999999999998 < y < 1.9e48

   1. Initial program 99.4%

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

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

   5. Applied rewrites 64.3%

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

   if -9.4999999999999996e123 < y < -0.680000000000000049 or 1.9e48 < y

   1. Initial program 99.7%

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

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

   5. Applied rewrites 64.0%

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

   if -0.680000000000000049 < y < 0.00759999999999999998

   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.5

          \[\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.5%

      \[\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.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9.5 \cdot 10^{+123}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;y \leq -0.68:\\ \;\;\;\;x \cdot \sin y\\ \mathbf{elif}\;y \leq 0.0076:\\ \;\;\;\;\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{elif}\;y \leq 1.9 \cdot 10^{+48}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 86.5% 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 -8.2 \cdot 10^{-49}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{-66}:\\ \;\;\;\;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 -8.2e-49) t_0 (if (<= x 5.2e-66) (* 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 <= -8.2e-49) {
		tmp = t_0;
	} else if (x <= 5.2e-66) {
		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 <= -8.2e-49)
		tmp = t_0;
	elseif (x <= 5.2e-66)
		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, -8.2e-49], t$95$0, If[LessEqual[x, 5.2e-66], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if x < -8.2000000000000003e-49 or 5.1999999999999998e-66 < 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 89.6%

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

   if -8.2000000000000003e-49 < x < 5.1999999999999998e-66

   1. Initial program 99.8%

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

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

   5. Applied rewrites 91.6%

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

4. Final simplification 90.4%

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

Alternative 4: 75.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;y \leq -0.019:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 0.0076:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.5 \cdot y, z, 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 -0.019)
     t_0
     (if (<= y 0.0076) (fma (fma (* -0.5 y) z x) y z) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (y <= -0.019) {
		tmp = t_0;
	} else if (y <= 0.0076) {
		tmp = fma(fma((-0.5 * y), z, 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 <= -0.019)
		tmp = t_0;
	elseif (y <= 0.0076)
		tmp = fma(fma(Float64(-0.5 * y), z, 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, -0.019], t$95$0, If[LessEqual[y, 0.0076], N[(N[(N[(-0.5 * y), $MachinePrecision] * z + x), $MachinePrecision] * y + z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -0.0189999999999999995 or 0.00759999999999999998 < y

   1. Initial program 99.6%

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

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

   5. Applied rewrites 48.2%

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

   if -0.0189999999999999995 < y < 0.00759999999999999998

   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 + \frac{-1}{2} \cdot \left(y \cdot z\right)\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. associate-*r* N/A

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

      10. *-commutative N/A

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

      11. associate-*r* N/A

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

      12. lower-fma.f64 N/A

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

      13. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 75.3%

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

Alternative 5: 40.8% accurate, 17.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 3.4 \cdot 10^{+174}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= x 3.4e+174) (* 1.0 z) (* x y)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= 3.4e+174) {
		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 <= 3.4d+174) 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 <= 3.4e+174) {
		tmp = 1.0 * z;
	} else {
		tmp = x * y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= 3.4e+174:
		tmp = 1.0 * z
	else:
		tmp = x * y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= 3.4e+174)
		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 <= 3.4e+174)
		tmp = 1.0 * z;
	else
		tmp = x * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, 3.4e+174], N[(1.0 * z), $MachinePrecision], N[(x * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 3.4000000000000001e174

   1. Initial program 99.8%

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

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

   5. Applied rewrites 66.5%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 44.2%

      \[\leadsto 1 \cdot z \]

   if 3.4000000000000001e174 < 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 62.3

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

   5. Applied rewrites 62.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 43.6%

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

4. Final simplification 44.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 3.4 \cdot 10^{+174}:\\ \;\;\;\;1 \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 52.7% 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 55.2

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

5. Applied rewrites 55.2%

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

Alternative 7: 16.6% 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 55.2

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

5. Applied rewrites 55.2%

   \[\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 18.0%

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

9. Final simplification 18.0%

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

Reproduce

herbie shell --seed 2024256 
(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))))