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

Percentage Accurate: 99.8% → 99.8%

Time: 12.9s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * cos(y)) - (z * sin(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 * cos(y)) - (z * sin(y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * cos(y)) - (z * sin(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 * cos(y)) - (z * sin(y))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-cos.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-sin.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. sub-neg N/A

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

   6. +-commutative N/A

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

   7. lift-*.f64 N/A

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

   8. *-commutative N/A

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

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

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

   10. lower-fma.f64 N/A

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

   11. lower-neg.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 * cos(y)) - (sin(y) * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

   \[\leadsto x \cdot \cos y - \sin y \cdot z \]
4. Add Preprocessing

Alternative 3: 74.9% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \cos y\\ t_1 := -\sin y \cdot z\\ \mathbf{if}\;y \leq -1.85 \cdot 10^{+233}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq -0.038:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 900000:\\ \;\;\;\;\mathsf{fma}\left(y, \mathsf{fma}\left(y, \mathsf{fma}\left(z, y \cdot 0.16666666666666666, x \cdot -0.5\right), -z\right), x\right)\\ \mathbf{elif}\;y \leq 3.1 \cdot 10^{+179}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (cos y))) (t_1 (- (* (sin y) z))))
   (if (<= y -1.85e+233)
     t_0
     (if (<= y -0.038)
       t_1
       (if (<= y 900000.0)
         (fma y (fma y (fma z (* y 0.16666666666666666) (* x -0.5)) (- z)) x)
         (if (<= y 3.1e+179) t_1 t_0))))))

C

double code(double x, double y, double z) {
	double t_0 = x * cos(y);
	double t_1 = -(sin(y) * z);
	double tmp;
	if (y <= -1.85e+233) {
		tmp = t_0;
	} else if (y <= -0.038) {
		tmp = t_1;
	} else if (y <= 900000.0) {
		tmp = fma(y, fma(y, fma(z, (y * 0.16666666666666666), (x * -0.5)), -z), x);
	} else if (y <= 3.1e+179) {
		tmp = t_1;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x * cos(y))
	t_1 = Float64(-Float64(sin(y) * z))
	tmp = 0.0
	if (y <= -1.85e+233)
		tmp = t_0;
	elseif (y <= -0.038)
		tmp = t_1;
	elseif (y <= 900000.0)
		tmp = fma(y, fma(y, fma(z, Float64(y * 0.16666666666666666), Float64(x * -0.5)), Float64(-z)), x);
	elseif (y <= 3.1e+179)
		tmp = t_1;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = (-N[(N[Sin[y], $MachinePrecision] * z), $MachinePrecision])}, If[LessEqual[y, -1.85e+233], t$95$0, If[LessEqual[y, -0.038], t$95$1, If[LessEqual[y, 900000.0], N[(y * N[(y * N[(z * N[(y * 0.16666666666666666), $MachinePrecision] + N[(x * -0.5), $MachinePrecision]), $MachinePrecision] + (-z)), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[y, 3.1e+179], t$95$1, t$95$0]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.8499999999999999e233 or 3.1e179 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 63.2

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

   5. Applied rewrites 63.2%

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

   if -1.8499999999999999e233 < y < -0.0379999999999999991 or 9e5 < y < 3.1e179

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot \left(z \cdot \sin y\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z \cdot \sin y\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(z \cdot \sin y\right)} \]

      3. lower-*.f64 N/A

         \[\leadsto \mathsf{neg}\left(\color{blue}{z \cdot \sin y}\right) \]

      4. lower-sin.f64 70.5

         \[\leadsto -z \cdot \color{blue}{\sin y} \]

   5. Applied rewrites 70.5%

      \[\leadsto \color{blue}{-z \cdot \sin y} \]

   if -0.0379999999999999991 < y < 9e5

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 99.3

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

   5. Applied rewrites 99.3%

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

4. Final simplification 83.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.85 \cdot 10^{+233}:\\ \;\;\;\;x \cdot \cos y\\ \mathbf{elif}\;y \leq -0.038:\\ \;\;\;\;-\sin y \cdot z\\ \mathbf{elif}\;y \leq 900000:\\ \;\;\;\;\mathsf{fma}\left(y, \mathsf{fma}\left(y, \mathsf{fma}\left(z, y \cdot 0.16666666666666666, x \cdot -0.5\right), -z\right), x\right)\\ \mathbf{elif}\;y \leq 3.1 \cdot 10^{+179}:\\ \;\;\;\;-\sin y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 85.6% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- x (* (sin y) z))))
   (if (<= z -1.6e+35) t_0 (if (<= z 3.1e-43) (* x (cos y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x - (sin(y) * z);
	double tmp;
	if (z <= -1.6e+35) {
		tmp = t_0;
	} else if (z <= 3.1e-43) {
		tmp = x * cos(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 = x - (sin(y) * z)
    if (z <= (-1.6d+35)) then
        tmp = t_0
    else if (z <= 3.1d-43) then
        tmp = x * cos(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 = x - (Math.sin(y) * z);
	double tmp;
	if (z <= -1.6e+35) {
		tmp = t_0;
	} else if (z <= 3.1e-43) {
		tmp = x * Math.cos(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x - (math.sin(y) * z)
	tmp = 0
	if z <= -1.6e+35:
		tmp = t_0
	elif z <= 3.1e-43:
		tmp = x * math.cos(y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x - Float64(sin(y) * z))
	tmp = 0.0
	if (z <= -1.6e+35)
		tmp = t_0;
	elseif (z <= 3.1e-43)
		tmp = Float64(x * cos(y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x - (sin(y) * z);
	tmp = 0.0;
	if (z <= -1.6e+35)
		tmp = t_0;
	elseif (z <= 3.1e-43)
		tmp = x * cos(y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.59999999999999991e35 or 3.0999999999999999e-43 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 89.9%

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

   if -1.59999999999999991e35 < z < 3.0999999999999999e-43

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 87.2

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

   5. Applied rewrites 87.2%

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

4. Final simplification 88.8%

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

Alternative 5: 75.1% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (cos y))))
   (if (<= y -0.24)
     t_0
     (if (<= y 0.07)
       (fma y (fma y (fma z (* y 0.16666666666666666) (* x -0.5)) (- z)) x)
       t_0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.23999999999999999 or 0.070000000000000007 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 44.2

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

   5. Applied rewrites 44.2%

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

   if -0.23999999999999999 < y < 0.070000000000000007

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-fma.f64 N/A

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

      3. sub-neg N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower-neg.f64 100.0

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

   5. Applied rewrites 100.0%

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

Alternative 6: 40.4% accurate, 15.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 6.8 \cdot 10^{+97}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= z 6.8e+97) x (* y (- z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 6.8e+97) {
		tmp = x;
	} else {
		tmp = y * -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 <= 6.8d+97) then
        tmp = x
    else
        tmp = y * -z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 6.8e+97) {
		tmp = x;
	} else {
		tmp = y * -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 6.8e+97:
		tmp = x
	else:
		tmp = y * -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 6.8e+97)
		tmp = x;
	else
		tmp = Float64(y * Float64(-z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 6.8e+97)
		tmp = x;
	else
		tmp = y * -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 6.8e+97], x, N[(y * (-z)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 6.8000000000000002e97

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-cos.f64 64.0

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

   5. Applied rewrites 64.0%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 42.5%

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

      1. *-rgt-identity 42.5

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

   10. Applied rewrites 42.5%

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

   if 6.8000000000000002e97 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 58.1

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

   5. Applied rewrites 58.1%

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

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot \left(y \cdot z\right)} \]
   7. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(y \cdot z\right)} \]

      2. lower-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(y \cdot z\right)} \]

      3. lower-*.f64 39.7

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

   8. Applied rewrites 39.7%

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

4. Final simplification 41.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 6.8 \cdot 10^{+97}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(-z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.6% accurate, 23.8× speedup

Math

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

FPCore

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

C

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

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 * z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

   1. mul-1-neg N/A

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

   2. unsub-neg N/A

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

   3. lower--.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 52.0

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

5. Applied rewrites 52.0%

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

6. Final simplification 52.0%

   \[\leadsto x - y \cdot z \]
7. Add Preprocessing

Alternative 8: 38.9% accurate, 214.0× speedup

Math

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

FPCore

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

C

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

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
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around inf

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

   1. lower-*.f64 N/A

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

   2. lower-cos.f64 56.6

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

5. Applied rewrites 56.6%

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

6. Taylor expanded in y around 0

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

8. Applied rewrites 37.9%

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

   1. *-rgt-identity 37.9

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

10. Applied rewrites 37.9%

    \[\leadsto \color{blue}{x} \]
11. Add Preprocessing

Reproduce

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