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

Percentage Accurate: 99.8% → 99.8%

Time: 9.2s

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. cancel-sign-sub-inv 99.9%

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

   2. +-commutative 99.9%

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

   3. distribute-lft-neg-out 99.9%

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

   4. distribute-rgt-neg-in 99.9%

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

   5. sin-neg 99.9%

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

   6. fma-define 99.9%

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

   7. sin-neg 99.9%

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

3. Simplified 99.9%

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

5. Final simplification 99.9%

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

Alternative 2: 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]

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 - z \cdot \sin y \]
4. Add Preprocessing

Alternative 3: 86.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.5 \cdot 10^{+28} \lor \neg \left(x \leq 1.05 \cdot 10^{-7}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;x - z \cdot \sin y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.5e+28) (not (<= x 1.05e-7)))
   (* x (cos y))
   (- x (* z (sin y)))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.5e+28) || !(x <= 1.05e-7)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x - (z * Math.sin(y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.5e+28) or not (x <= 1.05e-7):
		tmp = x * math.cos(y)
	else:
		tmp = x - (z * math.sin(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.5e+28) || !(x <= 1.05e-7))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(x - Float64(z * sin(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.5e+28) || ~((x <= 1.05e-7)))
		tmp = x * cos(y);
	else
		tmp = x - (z * sin(y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.5e+28], N[Not[LessEqual[x, 1.05e-7]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.49999999999999979e28 or 1.05e-7 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 86.4%

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

   if -2.49999999999999979e28 < x < 1.05e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 92.2%

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

4. Final simplification 89.3%

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

Alternative 4: 74.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.7 \cdot 10^{-57} \lor \neg \left(x \leq 5.5 \cdot 10^{-41}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-\sin y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.7e-57) (not (<= x 5.5e-41)))
   (* x (cos y))
   (* z (- (sin y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.7e-57) || !(x <= 5.5e-41)) {
		tmp = x * cos(y);
	} else {
		tmp = z * -sin(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-3.7d-57)) .or. (.not. (x <= 5.5d-41))) then
        tmp = x * cos(y)
    else
        tmp = z * -sin(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.7e-57) || !(x <= 5.5e-41)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = z * -Math.sin(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -3.7e-57) or not (x <= 5.5e-41):
		tmp = x * math.cos(y)
	else:
		tmp = z * -math.sin(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.7e-57) || !(x <= 5.5e-41))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(z * Float64(-sin(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -3.7e-57) || ~((x <= 5.5e-41)))
		tmp = x * cos(y);
	else
		tmp = z * -sin(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.7e-57], N[Not[LessEqual[x, 5.5e-41]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(z * (-N[Sin[y], $MachinePrecision])), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.7e-57 or 5.50000000000000022e-41 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 83.7%

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

   if -3.7e-57 < x < 5.50000000000000022e-41

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 78.6%

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

      1. neg-mul-1 78.6%

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

      2. distribute-rgt-neg-in 78.6%

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

   5. Simplified 78.6%

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

4. Final simplification 81.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.7 \cdot 10^{-57} \lor \neg \left(x \leq 5.5 \cdot 10^{-41}\right):\\ \;\;\;\;x \cdot \cos y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(-\sin y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.9% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.19) (not (<= y 1600000.0)))
   (* x (cos y))
   (+ x (* y (- (* y (+ (* x -0.5) (* 0.16666666666666666 (* z y)))) z)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.19 or 1.6e6 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 54.6%

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

   if -0.19 < y < 1.6e6

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 98.4%

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

4. Final simplification 77.9%

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

Alternative 6: 41.3% accurate, 14.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -8.2 \cdot 10^{-157}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{-62}:\\ \;\;\;\;z \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -8.2e-157) x (if (<= x 1.3e-62) (* z (- y)) x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -8.2e-157) {
		tmp = x;
	} else if (x <= 1.3e-62) {
		tmp = z * -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -8.2e-157:
		tmp = x
	elif x <= 1.3e-62:
		tmp = z * -y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -8.2e-157)
		tmp = x;
	elseif (x <= 1.3e-62)
		tmp = Float64(z * Float64(-y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -8.2e-157)
		tmp = x;
	elseif (x <= 1.3e-62)
		tmp = z * -y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -8.2e-157], x, If[LessEqual[x, 1.3e-62], N[(z * (-y)), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -8.2000000000000004e-157 or 1.3e-62 < x

   1. Initial program 99.9%

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

      1. sub-neg 99.9%

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

      2. +-commutative 99.9%

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

      3. add-cube-cbrt 99.5%

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

      4. distribute-rgt-neg-in 99.5%

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

      5. fma-define 99.5%

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

      6. pow2 99.5%

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

   4. Applied egg-rr 99.5%

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

   5. Taylor expanded in y around 0 47.2%

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

   if -8.2000000000000004e-157 < x < 1.3e-62

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 58.1%

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

      1. mul-1-neg 58.1%

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

      2. unsub-neg 58.1%

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

   5. Simplified 58.1%

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

   6. Taylor expanded in x around 0 46.6%

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

      1. mul-1-neg 46.6%

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

      2. *-commutative 46.6%

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

      3. distribute-rgt-neg-in 46.6%

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

   8. Simplified 46.6%

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

4. Final simplification 47.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -8.2 \cdot 10^{-157}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.3 \cdot 10^{-62}:\\ \;\;\;\;z \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 52.9% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x - N[(z * y), $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 54.9%

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

   1. mul-1-neg 54.9%

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

   2. unsub-neg 54.9%

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

5. Simplified 54.9%

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

6. Final simplification 54.9%

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

Alternative 8: 39.4% accurate, 207.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. Step-by-step derivation

   1. sub-neg 99.9%

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

   2. +-commutative 99.9%

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

   3. add-cube-cbrt 99.2%

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

   4. distribute-rgt-neg-in 99.2%

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

   5. fma-define 99.2%

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

   6. pow2 99.2%

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

4. Applied egg-rr 99.2%

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

5. Taylor expanded in y around 0 37.1%

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

6. Final simplification 37.1%

   \[\leadsto x \]
7. Add Preprocessing

Reproduce

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