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

Percentage Accurate: 99.8% → 99.8%

Time: 9.5s

Alternatives: 9

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

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

   1. cancel-sign-sub-inv 99.8%

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

   2. +-commutative 99.8%

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

   3. distribute-lft-neg-out 99.8%

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

   4. distribute-rgt-neg-in 99.8%

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

   5. sin-neg 99.8%

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

   6. fma-define 99.8%

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

   7. sin-neg 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 86.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.9) (not (<= z 7.6e-78)))
   (fma z (- (sin y)) x)
   (* x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.9) || !(z <= 7.6e-78)) {
		tmp = fma(z, -sin(y), x);
	} else {
		tmp = x * cos(y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.9) || !(z <= 7.6e-78))
		tmp = fma(z, Float64(-sin(y)), x);
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.9], N[Not[LessEqual[z, 7.6e-78]], $MachinePrecision]], N[(z * (-N[Sin[y], $MachinePrecision]) + x), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.8999999999999999 or 7.5999999999999998e-78 < z

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. distribute-lft-neg-out 99.8%

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

      4. distribute-rgt-neg-in 99.8%

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

      5. sin-neg 99.8%

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

      6. fma-define 99.8%

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

      7. sin-neg 99.8%

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

   3. Simplified 99.8%

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

   5. Taylor expanded in y around 0 87.0%

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

   if -1.8999999999999999 < z < 7.5999999999999998e-78

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 90.9%

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

4. Final simplification 88.9%

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

Alternative 3: 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.8%

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

3. Final simplification 99.8%

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

Alternative 4: 86.5% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.6) (not (<= z 8.2e-81))) (- x (* z (sin y))) (* x (cos y))))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -2.6) or not (z <= 8.2e-81):
		tmp = x - (z * math.sin(y))
	else:
		tmp = x * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -2.6) || !(z <= 8.2e-81))
		tmp = Float64(x - Float64(z * sin(y)));
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.6) || ~((z <= 8.2e-81)))
		tmp = x - (z * sin(y));
	else
		tmp = x * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -2.6], N[Not[LessEqual[z, 8.2e-81]], $MachinePrecision]], N[(x - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.60000000000000009 or 8.19999999999999968e-81 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 87.0%

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

   if -2.60000000000000009 < z < 8.19999999999999968e-81

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 90.9%

      \[\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 -2.6 \lor \neg \left(z \leq 8.2 \cdot 10^{-81}\right):\\ \;\;\;\;x - z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 73.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{+171} \lor \neg \left(z \leq 2.7 \cdot 10^{+105}\right):\\ \;\;\;\;z \cdot \left(-\sin y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -8e+171) (not (<= z 2.7e+105)))
   (* z (- (sin y)))
   (* x (cos y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -8e+171) || !(z <= 2.7e+105)) {
		tmp = z * -Math.sin(y);
	} else {
		tmp = x * Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -8e+171) or not (z <= 2.7e+105):
		tmp = z * -math.sin(y)
	else:
		tmp = x * math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -8e+171) || !(z <= 2.7e+105))
		tmp = Float64(z * Float64(-sin(y)));
	else
		tmp = Float64(x * cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -8e+171) || ~((z <= 2.7e+105)))
		tmp = z * -sin(y);
	else
		tmp = x * cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -8e+171], N[Not[LessEqual[z, 2.7e+105]], $MachinePrecision]], N[(z * (-N[Sin[y], $MachinePrecision])), $MachinePrecision], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -7.99999999999999963e171 or 2.70000000000000016e105 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 77.5%

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

      1. neg-mul-1 77.5%

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

      2. distribute-rgt-neg-in 77.5%

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

   5. Simplified 77.5%

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

   if -7.99999999999999963e171 < z < 2.70000000000000016e105

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 80.9%

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

4. Final simplification 79.9%

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

Alternative 6: 74.3% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -3600000000.0) (not (<= y 1.06e-10)))
   (* x (cos y))
   (- x (* z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3600000000.0) || !(y <= 1.06e-10)) {
		tmp = x * cos(y);
	} else {
		tmp = x - (z * 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 <= (-3600000000.0d0)) .or. (.not. (y <= 1.06d-10))) then
        tmp = x * cos(y)
    else
        tmp = x - (z * y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -3600000000.0) || !(y <= 1.06e-10)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x - (z * y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -3600000000.0) or not (y <= 1.06e-10):
		tmp = x * math.cos(y)
	else:
		tmp = x - (z * y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -3600000000.0) || !(y <= 1.06e-10))
		tmp = Float64(x * cos(y));
	else
		tmp = Float64(x - Float64(z * y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -3600000000.0) || ~((y <= 1.06e-10)))
		tmp = x * cos(y);
	else
		tmp = x - (z * y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -3600000000.0], N[Not[LessEqual[y, 1.06e-10]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x - N[(z * y), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.6e9 or 1.06e-10 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf 56.6%

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

   if -3.6e9 < y < 1.06e-10

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 99.0%

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

      1. mul-1-neg 99.0%

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

      2. unsub-neg 99.0%

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

   5. Simplified 99.0%

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

4. Final simplification 77.4%

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

Alternative 7: 40.3% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.85000000000000011e102

   1. Initial program 99.8%

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

      1. sub-neg 99.8%

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

      2. +-commutative 99.8%

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

      3. distribute-lft-neg-in 99.8%

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

      4. add-cube-cbrt 99.3%

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

      5. associate-*r* 99.3%

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

      6. fma-define 99.3%

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

      7. pow2 99.3%

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

   4. Applied egg-rr 99.3%

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

   5. Taylor expanded in y around 0 45.0%

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

   if 1.85000000000000011e102 < z

   1. Initial program 99.7%

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

   3. Taylor expanded in y around 0 51.9%

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

      1. mul-1-neg 51.9%

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

      2. unsub-neg 51.9%

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

   5. Simplified 51.9%

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

   6. Taylor expanded in x around 0 38.4%

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

      1. associate-*r* 38.4%

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

      2. neg-mul-1 38.4%

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

   8. Simplified 38.4%

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

4. Final simplification 43.7%

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

Alternative 8: 52.6% 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.8%

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

3. Taylor expanded in y around 0 52.6%

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

   1. mul-1-neg 52.6%

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

   2. unsub-neg 52.6%

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

5. Simplified 52.6%

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

6. Final simplification 52.6%

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

Alternative 9: 39.3% 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.8%

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

   1. sub-neg 99.8%

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

   2. +-commutative 99.8%

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

   3. distribute-lft-neg-in 99.8%

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

   4. add-cube-cbrt 99.1%

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

   5. associate-*r* 99.1%

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

   6. fma-define 99.1%

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

   7. pow2 99.1%

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

4. Applied egg-rr 99.1%

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

5. Taylor expanded in y around 0 39.6%

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

6. Final simplification 39.6%

   \[\leadsto x \]
7. Add Preprocessing

Reproduce

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