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

Percentage Accurate: 99.8% → 99.8%

Time: 9.0s

Alternatives: 8

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, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. fma-define 99.8%

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

3. Simplified 99.8%

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

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision] + 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. Final simplification 99.8%

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

Alternative 3: 85.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.38 \cdot 10^{-40} \lor \neg \left(x \leq 2.8 \cdot 10^{-136}\right):\\ \;\;\;\;z + x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.38e-40) (not (<= x 2.8e-136)))
   (+ z (* x (sin y)))
   (* z (cos y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.38e-40) || !(x <= 2.8e-136)) {
		tmp = z + (x * Math.sin(y));
	} else {
		tmp = z * Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.38e-40) or not (x <= 2.8e-136):
		tmp = z + (x * math.sin(y))
	else:
		tmp = z * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.38e-40) || !(x <= 2.8e-136))
		tmp = Float64(z + Float64(x * sin(y)));
	else
		tmp = Float64(z * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.38e-40) || ~((x <= 2.8e-136)))
		tmp = z + (x * sin(y));
	else
		tmp = z * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.38e-40], N[Not[LessEqual[x, 2.8e-136]], $MachinePrecision]], N[(z + N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.37999999999999996e-40 or 2.8000000000000001e-136 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 91.5%

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

   if -1.37999999999999996e-40 < x < 2.8000000000000001e-136

   1. Initial program 99.8%

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

      1. fma-define 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in x around 0 85.2%

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

4. Final simplification 89.2%

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

Alternative 4: 74.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.2 \cdot 10^{-6} \lor \neg \left(y \leq 0.0055\right):\\ \;\;\;\;x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -7.2e-6) (not (<= y 0.0055))) (* x (sin y)) (fma x y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7.2e-6) || !(y <= 0.0055)) {
		tmp = x * sin(y);
	} else {
		tmp = fma(x, y, z);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -7.2e-6) || !(y <= 0.0055))
		tmp = Float64(x * sin(y));
	else
		tmp = fma(x, y, z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -7.2e-6], N[Not[LessEqual[y, 0.0055]], $MachinePrecision]], N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision], N[(x * y + z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.19999999999999967e-6 or 0.0054999999999999997 < y

   1. Initial program 99.6%

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

      1. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 59.5%

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

   if -7.19999999999999967e-6 < y < 0.0054999999999999997

   1. Initial program 100.0%

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

      1. fma-define 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 100.0%

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

      1. +-commutative 100.0%

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

      2. fma-define 100.0%

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

   7. Simplified 100.0%

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

4. Final simplification 78.8%

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

Alternative 5: 74.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.033 \lor \neg \left(y \leq 0.055\right):\\ \;\;\;\;x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;z + y \cdot \left(x + y \cdot \left(z \cdot -0.5 + -0.16666666666666666 \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.033) (not (<= y 0.055)))
   (* x (sin y))
   (+ z (* y (+ x (* y (+ (* z -0.5) (* -0.16666666666666666 (* x y)))))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.033) || !(y <= 0.055)) {
		tmp = x * sin(y);
	} else {
		tmp = z + (y * (x + (y * ((z * -0.5) + (-0.16666666666666666 * (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 ((y <= (-0.033d0)) .or. (.not. (y <= 0.055d0))) then
        tmp = x * sin(y)
    else
        tmp = z + (y * (x + (y * ((z * (-0.5d0)) + ((-0.16666666666666666d0) * (x * y))))))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.033) || !(y <= 0.055)) {
		tmp = x * Math.sin(y);
	} else {
		tmp = z + (y * (x + (y * ((z * -0.5) + (-0.16666666666666666 * (x * y))))));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -0.033) or not (y <= 0.055):
		tmp = x * math.sin(y)
	else:
		tmp = z + (y * (x + (y * ((z * -0.5) + (-0.16666666666666666 * (x * y))))))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -0.033) || !(y <= 0.055))
		tmp = Float64(x * sin(y));
	else
		tmp = Float64(z + Float64(y * Float64(x + Float64(y * Float64(Float64(z * -0.5) + Float64(-0.16666666666666666 * Float64(x * y)))))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.033) || ~((y <= 0.055)))
		tmp = x * sin(y);
	else
		tmp = z + (y * (x + (y * ((z * -0.5) + (-0.16666666666666666 * (x * y))))));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.033000000000000002 or 0.0550000000000000003 < y

   1. Initial program 99.6%

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

      1. fma-define 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in x around inf 59.2%

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

   if -0.033000000000000002 < y < 0.0550000000000000003

   1. Initial program 99.9%

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

      1. fma-define 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 100.0%

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

4. Final simplification 78.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.033 \lor \neg \left(y \leq 0.055\right):\\ \;\;\;\;x \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;z + y \cdot \left(x + y \cdot \left(z \cdot -0.5 + -0.16666666666666666 \cdot \left(x \cdot y\right)\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 35.9% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{+165} \lor \neg \left(x \leq 9.5 \cdot 10^{+207}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{z}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.9e+165) (not (<= x 9.5e+207))) (* x y) (* x (/ z x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.9e+165) || !(x <= 9.5e+207)) {
		tmp = x * y;
	} else {
		tmp = x * (z / x);
	}
	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 <= (-2.9d+165)) .or. (.not. (x <= 9.5d+207))) then
        tmp = x * y
    else
        tmp = x * (z / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.9e+165) || !(x <= 9.5e+207)) {
		tmp = x * y;
	} else {
		tmp = x * (z / x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.9e+165) or not (x <= 9.5e+207):
		tmp = x * y
	else:
		tmp = x * (z / x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.9e+165) || !(x <= 9.5e+207))
		tmp = Float64(x * y);
	else
		tmp = Float64(x * Float64(z / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.9e+165) || ~((x <= 9.5e+207)))
		tmp = x * y;
	else
		tmp = x * (z / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.9e+165], N[Not[LessEqual[x, 9.5e+207]], $MachinePrecision]], N[(x * y), $MachinePrecision], N[(x * N[(z / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.90000000000000006e165 or 9.5000000000000005e207 < x

   1. Initial program 99.7%

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

      1. fma-define 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in y around 0 35.9%

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

      1. +-commutative 35.9%

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

   7. Simplified 35.9%

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

   8. Taylor expanded in x around inf 30.4%

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

      1. *-commutative 30.4%

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

   10. Simplified 30.4%

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

   if -2.90000000000000006e165 < x < 9.5000000000000005e207

   1. Initial program 99.8%

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

      1. fma-define 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around 0 54.6%

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

      1. +-commutative 54.6%

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

   7. Simplified 54.6%

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

   8. Taylor expanded in x around inf 48.4%

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

   9. Taylor expanded in y around 0 39.7%

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

4. Final simplification 37.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.9 \cdot 10^{+165} \lor \neg \left(x \leq 9.5 \cdot 10^{+207}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \frac{z}{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.6% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. fma-define 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in y around 0 50.9%

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

   1. +-commutative 50.9%

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

7. Simplified 50.9%

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

8. Final simplification 50.9%

   \[\leadsto z + x \cdot y \]
9. Add Preprocessing

Alternative 8: 16.4% accurate, 69.0× 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. Step-by-step derivation

   1. fma-define 99.8%

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

3. Simplified 99.8%

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

5. Taylor expanded in y around 0 50.9%

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

   1. +-commutative 50.9%

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

7. Simplified 50.9%

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

8. Taylor expanded in x around inf 15.5%

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

   1. *-commutative 15.5%

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

10. Simplified 15.5%

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

11. Final simplification 15.5%

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

Reproduce

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