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

Percentage Accurate: 99.8% → 99.8%

Time: 7.5s

Alternatives: 7

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} \\ \mathsf{fma}\left(\sin y, -z, \cos y \cdot x\right) \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. distribute-rgt-neg-in N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-neg.f64 99.8

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

   9. lift-*.f64 N/A

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

   10. *-commutative N/A

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

   11. lower-*.f64 99.8

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

4. Applied rewrites 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\sin y, -z, \cos y \cdot x\right)} \]
5. 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.8%

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

Alternative 3: 85.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.7 \cdot 10^{+67} \lor \neg \left(x \leq 1.1 \cdot 10^{-38}\right):\\ \;\;\;\;\cos y \cdot x\\ \mathbf{else}:\\ \;\;\;\;x \cdot 1 - z \cdot \sin y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.7e+67) (not (<= x 1.1e-38)))
   (* (cos y) x)
   (- (* x 1.0) (* z (sin y)))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.7e+67) || !(x <= 1.1e-38)) {
		tmp = Math.cos(y) * x;
	} else {
		tmp = (x * 1.0) - (z * Math.sin(y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.7e+67) or not (x <= 1.1e-38):
		tmp = math.cos(y) * x
	else:
		tmp = (x * 1.0) - (z * math.sin(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.7e+67) || !(x <= 1.1e-38))
		tmp = Float64(cos(y) * x);
	else
		tmp = Float64(Float64(x * 1.0) - Float64(z * sin(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.7e+67) || ~((x <= 1.1e-38)))
		tmp = cos(y) * x;
	else
		tmp = (x * 1.0) - (z * sin(y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.7e+67], N[Not[LessEqual[x, 1.1e-38]], $MachinePrecision]], N[(N[Cos[y], $MachinePrecision] * x), $MachinePrecision], N[(N[(x * 1.0), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.7000000000000001e67 or 1.10000000000000004e-38 < x

   1. Initial program 99.8%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.8

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 99.8

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

   4. Applied rewrites 99.8%

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

   6. Applied rewrites 99.7%

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

   7. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 87.9

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

   9. Applied rewrites 87.9%

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

   if -1.7000000000000001e67 < x < 1.10000000000000004e-38

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 86.4%

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

4. Final simplification 87.1%

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

Alternative 4: 75.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -0.07 \lor \neg \left(y \leq 0.135\right):\\ \;\;\;\;\cos y \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, z \cdot y, -0.5 \cdot x\right) \cdot y - z, y, x\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -0.070000000000000007 or 0.13500000000000001 < y

   1. Initial program 99.6%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. distribute-rgt-neg-in N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-neg.f64 99.6

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

      9. lift-*.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 99.6

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

   4. Applied rewrites 99.6%

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

   6. Applied rewrites 99.6%

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

   7. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 55.1

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

   9. Applied rewrites 55.1%

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

   if -0.070000000000000007 < y < 0.13500000000000001

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left(y \cdot \left(\frac{-1}{2} \cdot x + \frac{1}{6} \cdot \left(y \cdot z\right)\right) - z, y, x\right)} \]

      4. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{y \cdot \left(\frac{-1}{2} \cdot x + \frac{1}{6} \cdot \left(y \cdot z\right)\right) - z}, y, x\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{2} \cdot x + \frac{1}{6} \cdot \left(y \cdot z\right)\right) \cdot y} - z, y, x\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{-1}{2} \cdot x + \frac{1}{6} \cdot \left(y \cdot z\right)\right) \cdot y} - z, y, x\right) \]

      7. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left(\frac{1}{6} \cdot \left(y \cdot z\right) + \frac{-1}{2} \cdot x\right)} \cdot y - z, y, x\right) \]

      8. lower-fma.f64 N/A

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower-*.f64 100.0

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

   5. Applied rewrites 100.0%

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

4. Final simplification 78.2%

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

Alternative 5: 41.6% accurate, 10.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.15 \cdot 10^{-229} \lor \neg \left(x \leq 6.2 \cdot 10^{-144}\right):\\ \;\;\;\;1 \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(-y\right) \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.15e-229) (not (<= x 6.2e-144))) (* 1.0 x) (* (- y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.15e-229) || !(x <= 6.2e-144)) {
		tmp = 1.0 * x;
	} else {
		tmp = -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 <= (-2.15d-229)) .or. (.not. (x <= 6.2d-144))) then
        tmp = 1.0d0 * x
    else
        tmp = -y * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.15e-229) || !(x <= 6.2e-144)) {
		tmp = 1.0 * x;
	} else {
		tmp = -y * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.15e-229) or not (x <= 6.2e-144):
		tmp = 1.0 * x
	else:
		tmp = -y * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.15e-229) || !(x <= 6.2e-144))
		tmp = Float64(1.0 * x);
	else
		tmp = Float64(Float64(-y) * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.15e-229) || ~((x <= 6.2e-144)))
		tmp = 1.0 * x;
	else
		tmp = -y * z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.15e-229], N[Not[LessEqual[x, 6.2e-144]], $MachinePrecision]], N[(1.0 * x), $MachinePrecision], N[((-y) * z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.15000000000000005e-229 or 6.2000000000000001e-144 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 54.4

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

   5. Applied rewrites 54.4%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 53.0%

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

   9. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 47.5%

       \[\leadsto 1 \cdot x \]

   if -2.15000000000000005e-229 < x < 6.2000000000000001e-144

   1. Initial program 99.7%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 52.9

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

   5. Applied rewrites 52.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 41.6%

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

4. Final simplification 46.3%

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

Alternative 6: 52.6% accurate, 23.8× 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

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

   1. mul-1-neg N/A

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

   2. unsub-neg N/A

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

   3. lower--.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 54.1

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

5. Applied rewrites 54.1%

   \[\leadsto \color{blue}{x - z \cdot y} \]
6. Add Preprocessing

Alternative 7: 39.2% accurate, 35.7× speedup

Math

\[\begin{array}{l} \\ 1 \cdot x \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   1. mul-1-neg N/A

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

   2. unsub-neg N/A

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

   3. lower--.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 54.1

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

5. Applied rewrites 54.1%

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

6. Taylor expanded in x around inf

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

8. Applied rewrites 49.2%

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

9. Taylor expanded in x around inf

   \[\leadsto 1 \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 41.2%

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

Reproduce

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