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

Percentage Accurate: 99.8% → 99.8%

Time: 6.7s

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, \cos y \cdot z\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Alternative 2: 86.0% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.8 \cdot 10^{-160} \lor \neg \left(x \leq 9.2 \cdot 10^{-66}\right):\\ \;\;\;\;\mathsf{fma}\left(\sin y, x, 1 \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\cos y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -9.8e-160) (not (<= x 9.2e-66)))
   (fma (sin y) x (* 1.0 z))
   (* (cos y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -9.8e-160) || !(x <= 9.2e-66)) {
		tmp = fma(sin(y), x, (1.0 * z));
	} else {
		tmp = cos(y) * z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -9.8e-160) || !(x <= 9.2e-66))
		tmp = fma(sin(y), x, Float64(1.0 * z));
	else
		tmp = Float64(cos(y) * z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -9.8e-160], N[Not[LessEqual[x, 9.2e-66]], $MachinePrecision]], N[(N[Sin[y], $MachinePrecision] * x + N[(1.0 * z), $MachinePrecision]), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.7999999999999998e-160 or 9.19999999999999967e-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 88.6%

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

   if -9.7999999999999998e-160 < x < 9.19999999999999967e-66

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

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

   5. Applied rewrites 94.6%

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

4. Final simplification 90.7%

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

Alternative 3: 74.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+93} \lor \neg \left(x \leq 1.22 \cdot 10^{+144}\right):\\ \;\;\;\;\sin y \cdot x\\ \mathbf{else}:\\ \;\;\;\;\cos y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.02e+93) (not (<= x 1.22e+144))) (* (sin y) x) (* (cos y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.02e+93) || !(x <= 1.22e+144)) {
		tmp = sin(y) * x;
	} else {
		tmp = cos(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 ((x <= (-1.02d+93)) .or. (.not. (x <= 1.22d+144))) then
        tmp = sin(y) * x
    else
        tmp = cos(y) * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.02e+93) || !(x <= 1.22e+144)) {
		tmp = Math.sin(y) * x;
	} else {
		tmp = Math.cos(y) * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.02e+93) or not (x <= 1.22e+144):
		tmp = math.sin(y) * x
	else:
		tmp = math.cos(y) * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.02e+93) || !(x <= 1.22e+144))
		tmp = Float64(sin(y) * x);
	else
		tmp = Float64(cos(y) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.02e+93) || ~((x <= 1.22e+144)))
		tmp = sin(y) * x;
	else
		tmp = cos(y) * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.02e+93], N[Not[LessEqual[x, 1.22e+144]], $MachinePrecision]], N[(N[Sin[y], $MachinePrecision] * x), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.0200000000000001e93 or 1.2200000000000001e144 < x

   1. Initial program 99.7%

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

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

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around inf

      \[\leadsto \color{blue}{x \cdot \sin y} \]
   6. 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 83.5

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

   7. Applied rewrites 83.5%

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

   if -1.0200000000000001e93 < x < 1.2200000000000001e144

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

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

   5. Applied rewrites 78.8%

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

4. Final simplification 80.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+93} \lor \neg \left(x \leq 1.22 \cdot 10^{+144}\right):\\ \;\;\;\;\sin y \cdot x\\ \mathbf{else}:\\ \;\;\;\;\cos y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -115000000000 \lor \neg \left(y \leq 0.05\right):\\ \;\;\;\;\cos y \cdot z\\ \mathbf{else}:\\ \;\;\;\;\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)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -115000000000.0) (not (<= y 0.05)))
   (* (cos y) z)
   (fma (fma (fma -0.16666666666666666 (* y x) (* -0.5 z)) y x) y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -115000000000.0) || !(y <= 0.05)) {
		tmp = cos(y) * z;
	} else {
		tmp = fma(fma(fma(-0.16666666666666666, (y * x), (-0.5 * z)), y, x), y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -115000000000.0) || !(y <= 0.05))
		tmp = Float64(cos(y) * z);
	else
		tmp = fma(fma(fma(-0.16666666666666666, Float64(y * x), Float64(-0.5 * z)), y, x), y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -115000000000.0], N[Not[LessEqual[y, 0.05]], $MachinePrecision]], N[(N[Cos[y], $MachinePrecision] * z), $MachinePrecision], N[(N[(N[(-0.16666666666666666 * N[(y * x), $MachinePrecision] + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision] * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.15e11 or 0.050000000000000003 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

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

   5. Applied rewrites 49.7%

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

   if -1.15e11 < y < 0.050000000000000003

   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 98.9

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

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -115000000000 \lor \neg \left(y \leq 0.05\right):\\ \;\;\;\;\cos y \cdot z\\ \mathbf{else}:\\ \;\;\;\;\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)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 42.7% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -7.2 \cdot 10^{+88} \lor \neg \left(x \leq 1.12 \cdot 10^{+200}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -7.2e+88) (not (<= x 1.12e+200))) (* x y) (* 1.0 z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -7.2e+88) || !(x <= 1.12e+200)) {
		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 ((x <= (-7.2d+88)) .or. (.not. (x <= 1.12d+200))) 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 ((x <= -7.2e+88) || !(x <= 1.12e+200)) {
		tmp = x * y;
	} else {
		tmp = 1.0 * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -7.2e+88) or not (x <= 1.12e+200):
		tmp = x * y
	else:
		tmp = 1.0 * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -7.2e+88) || !(x <= 1.12e+200))
		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 ((x <= -7.2e+88) || ~((x <= 1.12e+200)))
		tmp = x * y;
	else
		tmp = 1.0 * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -7.2e+88], N[Not[LessEqual[x, 1.12e+200]], $MachinePrecision]], N[(x * y), $MachinePrecision], N[(1.0 * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -7.2000000000000004e88 or 1.12000000000000004e200 < x

   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 41.4

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

   5. Applied rewrites 41.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 32.4%

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

   if -7.2000000000000004e88 < x < 1.12000000000000004e200

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

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

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

   5. Applied rewrites 76.1%

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

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

4. Final simplification 44.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -7.2 \cdot 10^{+88} \lor \neg \left(x \leq 1.12 \cdot 10^{+200}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;1 \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 54.1% 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.1

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

5. Applied rewrites 51.1%

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

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

5. Applied rewrites 51.1%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 14.8%

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

Reproduce

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