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

Percentage Accurate: 99.8% → 99.8%

Time: 9.7s

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} \\ 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. Add Preprocessing

Alternative 2: 86.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -5.2e+94) (not (<= x 2.2e+91)))
   (* x (cos y))
   (fma z (- (sin y)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -5.2e+94) || !(x <= 2.2e+91)) {
		tmp = x * cos(y);
	} else {
		tmp = fma(z, -sin(y), x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -5.2e+94) || !(x <= 2.2e+91))
		tmp = Float64(x * cos(y));
	else
		tmp = fma(z, Float64(-sin(y)), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -5.2e+94], N[Not[LessEqual[x, 2.2e+91]], $MachinePrecision]], N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(z * (-N[Sin[y], $MachinePrecision]) + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -5.1999999999999998e94 or 2.19999999999999999e91 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 92.4%

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

   if -5.1999999999999998e94 < x < 2.19999999999999999e91

   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 89.9%

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

4. Final simplification 90.6%

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

Alternative 3: 86.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.6 \cdot 10^{+94} \lor \neg \left(x \leq 6.2 \cdot 10^{+91}\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.6e+94) (not (<= x 6.2e+91)))
   (* x (cos y))
   (- x (* z (sin y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.6e+94) || !(x <= 6.2e+91)) {
		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.6d+94)) .or. (.not. (x <= 6.2d+91))) 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.6e+94) || !(x <= 6.2e+91)) {
		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.6e+94) or not (x <= 6.2e+91):
		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.6e+94) || !(x <= 6.2e+91))
		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.6e+94) || ~((x <= 6.2e+91)))
		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.6e+94], N[Not[LessEqual[x, 6.2e+91]], $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.5999999999999999e94 or 6.19999999999999995e91 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 92.4%

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

   if -2.5999999999999999e94 < x < 6.19999999999999995e91

   1. Initial program 99.8%

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

      1. add-log-exp 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in y around 0 89.9%

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

4. Final simplification 90.6%

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

Alternative 4: 75.6% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.102) (not (<= y 0.00013)))
   (* (sin y) (- z))
   (+ x (* y (- (* -0.5 (* x y)) z)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.101999999999999993 or 1.29999999999999989e-4 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0 59.3%

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

      1. neg-mul-1 59.3%

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

      2. *-commutative 59.3%

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

      3. distribute-rgt-neg-in 59.3%

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

   5. Simplified 59.3%

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

   if -0.101999999999999993 < y < 1.29999999999999989e-4

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.7%

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

      1. sub-neg 99.7%

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

      2. sub-neg 99.7%

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

      3. *-commutative 99.7%

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

   5. Simplified 99.7%

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

4. Final simplification 81.3%

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

Alternative 5: 76.0% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -0.00092], N[Not[LessEqual[y, 3.3]], $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[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -9.2000000000000003e-4 or 3.2999999999999998 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 42.8%

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

   if -9.2000000000000003e-4 < y < 3.2999999999999998

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.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 73.3%

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

Alternative 6: 42.6% accurate, 14.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7.4 \cdot 10^{+96} \lor \neg \left(z \leq 4.9 \cdot 10^{+95}\right):\\ \;\;\;\;y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -7.4e+96) (not (<= z 4.9e+95))) (* y (- z)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -7.4e+96) || !(z <= 4.9e+95)) {
		tmp = y * -z;
	} 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 ((z <= (-7.4d+96)) .or. (.not. (z <= 4.9d+95))) then
        tmp = y * -z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -7.4e+96) || !(z <= 4.9e+95)) {
		tmp = y * -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -7.4e+96) or not (z <= 4.9e+95):
		tmp = y * -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -7.4e+96) || !(z <= 4.9e+95))
		tmp = Float64(y * Float64(-z));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -7.4e+96) || ~((z <= 4.9e+95)))
		tmp = y * -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -7.4e+96], N[Not[LessEqual[z, 4.9e+95]], $MachinePrecision]], N[(y * (-z)), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if z < -7.39999999999999982e96 or 4.8999999999999999e95 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 52.2%

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

      1. mul-1-neg 52.2%

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

      2. unsub-neg 52.2%

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

      3. *-commutative 52.2%

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

   5. Simplified 52.2%

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

   6. Taylor expanded in x around 0 36.1%

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

      1. neg-mul-1 36.1%

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

      2. *-commutative 36.1%

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

      3. distribute-rgt-neg-in 36.1%

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

   8. Simplified 36.1%

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

   if -7.39999999999999982e96 < z < 4.8999999999999999e95

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 54.1%

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

4. Final simplification 47.9%

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

Alternative 7: 54.0% accurate, 41.4× 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 56.3%

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

   1. mul-1-neg 56.3%

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

   2. unsub-neg 56.3%

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

   3. *-commutative 56.3%

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

5. Simplified 56.3%

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

6. Final simplification 56.3%

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

Alternative 8: 40.8% 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. Taylor expanded in y around 0 41.7%

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

Reproduce

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