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

Percentage Accurate: 99.8% → 99.8%

Time: 8.2s

Alternatives: 9

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: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(N[Cos[y], $MachinePrecision] * z + N[(x * N[Sin[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. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 99.8

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

   6. lift-*.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 99.8

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

4. Applied rewrites 99.8%

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

5. Final simplification 99.8%

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

Alternative 3: 86.2% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= z -1.6e+126)
     (/ 1.0 (/ 1.0 t_0))
     (if (<= z 5.2e+62) (fma (sin y) x (* 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (z <= -1.6e+126) {
		tmp = 1.0 / (1.0 / t_0);
	} else if (z <= 5.2e+62) {
		tmp = fma(sin(y), x, (1.0 * z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (z <= -1.6e+126)
		tmp = Float64(1.0 / Float64(1.0 / t_0));
	elseif (z <= 5.2e+62)
		tmp = fma(sin(y), x, Float64(1.0 * 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[z, -1.6e+126], N[(1.0 / N[(1.0 / t$95$0), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5.2e+62], N[(N[Sin[y], $MachinePrecision] * x + N[(1.0 * z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.5999999999999999e126

   1. Initial program 99.9%

      \[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. lower-/.f64 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)}}} \]

      5. clear-num N/A

         \[\leadsto \frac{1}{\color{blue}{\frac{1}{\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}}}} \]

      6. flip-+ N/A

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

      7. lift-+.f64 N/A

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

      8. inv-pow N/A

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

      9. lower-pow.f64 100.0

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-cos.f64 90.7

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

   7. Applied rewrites 90.7%

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

   if -1.5999999999999999e126 < z < 5.19999999999999968e62

   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 87.5%

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

   if 5.19999999999999968e62 < z

   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 92.6

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

   5. Applied rewrites 92.6%

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

4. Final simplification 89.2%

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

Alternative 4: 86.2% accurate, 1.7× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= z -1.6e+126)
     t_0
     (if (<= z 5.2e+62) (fma (sin y) x (* 1.0 z)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (z <= -1.6e+126) {
		tmp = t_0;
	} else if (z <= 5.2e+62) {
		tmp = fma(sin(y), x, (1.0 * z));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (z <= -1.6e+126)
		tmp = t_0;
	elseif (z <= 5.2e+62)
		tmp = fma(sin(y), x, Float64(1.0 * 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[z, -1.6e+126], t$95$0, If[LessEqual[z, 5.2e+62], N[(N[Sin[y], $MachinePrecision] * x + N[(1.0 * z), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.5999999999999999e126 or 5.19999999999999968e62 < z

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

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

   5. Applied rewrites 91.7%

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

   if -1.5999999999999999e126 < z < 5.19999999999999968e62

   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 87.5%

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

4. Final simplification 89.2%

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

Alternative 5: 74.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;z \leq -5.2 \cdot 10^{-61}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-51}:\\ \;\;\;\;x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= z -5.2e-61) t_0 (if (<= z 1.6e-51) (* x (sin y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (z <= -5.2e-61) {
		tmp = t_0;
	} else if (z <= 1.6e-51) {
		tmp = x * sin(y);
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = z * cos(y)
    if (z <= (-5.2d-61)) then
        tmp = t_0
    else if (z <= 1.6d-51) then
        tmp = x * sin(y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = z * Math.cos(y);
	double tmp;
	if (z <= -5.2e-61) {
		tmp = t_0;
	} else if (z <= 1.6e-51) {
		tmp = x * Math.sin(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.cos(y)
	tmp = 0
	if z <= -5.2e-61:
		tmp = t_0
	elif z <= 1.6e-51:
		tmp = x * math.sin(y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (z <= -5.2e-61)
		tmp = t_0;
	elseif (z <= 1.6e-51)
		tmp = Float64(x * sin(y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * cos(y);
	tmp = 0.0;
	if (z <= -5.2e-61)
		tmp = t_0;
	elseif (z <= 1.6e-51)
		tmp = x * sin(y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -5.2e-61], t$95$0, If[LessEqual[z, 1.6e-51], N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.20000000000000021e-61 or 1.6e-51 < z

   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 80.4

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

   5. Applied rewrites 80.4%

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

   if -5.20000000000000021e-61 < z < 1.6e-51

   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 77.5

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

   5. Applied rewrites 77.5%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -5.2 \cdot 10^{-61}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;z \leq 1.6 \cdot 10^{-51}:\\ \;\;\;\;x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;y \leq -0.155:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 12200:\\ \;\;\;\;\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 -0.155)
     t_0
     (if (<= y 12200.0)
       (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 <= -0.155) {
		tmp = t_0;
	} else if (y <= 12200.0) {
		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 <= -0.155)
		tmp = t_0;
	elseif (y <= 12200.0)
		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, -0.155], t$95$0, If[LessEqual[y, 12200.0], 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 < -0.154999999999999999 or 12200 < 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 52.0

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

   5. Applied rewrites 52.0%

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

   if -0.154999999999999999 < y < 12200

   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 97.8

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.155:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;y \leq 12200:\\ \;\;\;\;\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 7: 40.6% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.8 \cdot 10^{-62}:\\ \;\;\;\;1 \cdot z\\ \mathbf{elif}\;z \leq 8 \cdot 10^{-110}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.8e-62) (* 1.0 z) (if (<= z 8e-110) (* x y) (* 1.0 z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.8e-62) {
		tmp = 1.0 * z;
	} else if (z <= 8e-110) {
		tmp = x * y;
	} else {
		tmp = 1.0 * z;
	}
	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 (z <= (-5.8d-62)) then
        tmp = 1.0d0 * z
    else if (z <= 8d-110) then
        tmp = x * y
    else
        tmp = 1.0d0 * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.8e-62) {
		tmp = 1.0 * z;
	} else if (z <= 8e-110) {
		tmp = x * y;
	} else {
		tmp = 1.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.8e-62:
		tmp = 1.0 * z
	elif z <= 8e-110:
		tmp = x * y
	else:
		tmp = 1.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.8e-62)
		tmp = Float64(1.0 * z);
	elseif (z <= 8e-110)
		tmp = Float64(x * y);
	else
		tmp = Float64(1.0 * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -5.8e-62)
		tmp = 1.0 * z;
	elseif (z <= 8e-110)
		tmp = x * y;
	else
		tmp = 1.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.8e-62], N[(1.0 * z), $MachinePrecision], If[LessEqual[z, 8e-110], N[(x * y), $MachinePrecision], N[(1.0 * z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -5.79999999999999971e-62 or 8.0000000000000004e-110 < z

   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. div-sub N/A

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

      4. sub-neg N/A

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

      5. lift-*.f64 N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

      9. lower-fma.f64 N/A

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

   4. Applied rewrites 57.6%

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

   5. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \cos y} \]
   6. 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 77.3

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

   7. Applied rewrites 77.3%

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

   8. Taylor expanded in y around 0

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

   10. Applied rewrites 48.8%

       \[\leadsto 1 \cdot z \]

   if -5.79999999999999971e-62 < z < 8.0000000000000004e-110

   1. Initial program 99.7%

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

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

   5. Applied rewrites 43.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 32.5%

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

Alternative 8: 52.0% 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 51.3

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

5. Applied rewrites 51.3%

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

Alternative 9: 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 51.3

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

5. Applied rewrites 51.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 16.6%

   \[\leadsto x \cdot \color{blue}{y} \]
9. Add Preprocessing

Reproduce

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