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

Percentage Accurate: 99.8% → 99.8%

Time: 7.4s

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

FPCore

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

C

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

Julia

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

Wolfram

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

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

   4. distribute-rgt-neg-in 99.8%

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

   5. fma-def 99.8%

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

4. Applied egg-rr 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 86.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -6.2e+30) (not (<= x 2.1e-8)))
   (* x (cos y))
   (fma (sin y) (- z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -6.2e+30) || !(x <= 2.1e-8)) {
		tmp = x * cos(y);
	} else {
		tmp = fma(sin(y), -z, x);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -6.2e+30) || !(x <= 2.1e-8))
		tmp = Float64(x * cos(y));
	else
		tmp = fma(sin(y), Float64(-z), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -6.1999999999999995e30 or 2.09999999999999994e-8 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 91.1%

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

   if -6.1999999999999995e30 < x < 2.09999999999999994e-8

   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. *-commutative 99.8%

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

      4. distribute-rgt-neg-in 99.8%

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

      5. fma-def 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in y around 0 88.2%

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

4. Final simplification 89.7%

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

Alternative 3: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision] - N[(N[Sin[y], $MachinePrecision] * z), $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 - \sin y \cdot z \]
4. Add Preprocessing

Alternative 4: 73.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x \cdot \cos y\\ \mathbf{if}\;y \leq -0.00041:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 1.32 \cdot 10^{+20}:\\ \;\;\;\;x - y \cdot z\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{+220} \lor \neg \left(y \leq 1.7 \cdot 10^{+288}\right):\\ \;\;\;\;\sin y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;t_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* x (cos y))))
   (if (<= y -0.00041)
     t_0
     (if (<= y 1.32e+20)
       (- x (* y z))
       (if (or (<= y 6.2e+220) (not (<= y 1.7e+288)))
         (* (sin y) (- z))
         t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = x * cos(y);
	double tmp;
	if (y <= -0.00041) {
		tmp = t_0;
	} else if (y <= 1.32e+20) {
		tmp = x - (y * z);
	} else if ((y <= 6.2e+220) || !(y <= 1.7e+288)) {
		tmp = sin(y) * -z;
	} else {
		tmp = t_0;
	}
	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) :: t_0
    real(8) :: tmp
    t_0 = x * cos(y)
    if (y <= (-0.00041d0)) then
        tmp = t_0
    else if (y <= 1.32d+20) then
        tmp = x - (y * z)
    else if ((y <= 6.2d+220) .or. (.not. (y <= 1.7d+288))) then
        tmp = sin(y) * -z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x * Math.cos(y);
	double tmp;
	if (y <= -0.00041) {
		tmp = t_0;
	} else if (y <= 1.32e+20) {
		tmp = x - (y * z);
	} else if ((y <= 6.2e+220) || !(y <= 1.7e+288)) {
		tmp = Math.sin(y) * -z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x * math.cos(y)
	tmp = 0
	if y <= -0.00041:
		tmp = t_0
	elif y <= 1.32e+20:
		tmp = x - (y * z)
	elif (y <= 6.2e+220) or not (y <= 1.7e+288):
		tmp = math.sin(y) * -z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x * cos(y))
	tmp = 0.0
	if (y <= -0.00041)
		tmp = t_0;
	elseif (y <= 1.32e+20)
		tmp = Float64(x - Float64(y * z));
	elseif ((y <= 6.2e+220) || !(y <= 1.7e+288))
		tmp = Float64(sin(y) * Float64(-z));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x * cos(y);
	tmp = 0.0;
	if (y <= -0.00041)
		tmp = t_0;
	elseif (y <= 1.32e+20)
		tmp = x - (y * z);
	elseif ((y <= 6.2e+220) || ~((y <= 1.7e+288)))
		tmp = sin(y) * -z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -0.00041], t$95$0, If[LessEqual[y, 1.32e+20], N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[y, 6.2e+220], N[Not[LessEqual[y, 1.7e+288]], $MachinePrecision]], N[(N[Sin[y], $MachinePrecision] * (-z)), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.0999999999999999e-4 or 6.2000000000000001e220 < y < 1.70000000000000009e288

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf 67.4%

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

   if -4.0999999999999999e-4 < y < 1.32e20

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 97.8%

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

      1. mul-1-neg 97.8%

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

      2. unsub-neg 97.8%

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

   5. Simplified 97.8%

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

   if 1.32e20 < y < 6.2000000000000001e220 or 1.70000000000000009e288 < y

   1. Initial program 99.5%

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

   3. Taylor expanded in x around 0 62.8%

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

      1. mul-1-neg 62.8%

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

      2. *-commutative 62.8%

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

      3. distribute-rgt-neg-in 62.8%

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

   5. Simplified 62.8%

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

4. Final simplification 84.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.00041:\\ \;\;\;\;x \cdot \cos y\\ \mathbf{elif}\;y \leq 1.32 \cdot 10^{+20}:\\ \;\;\;\;x - y \cdot z\\ \mathbf{elif}\;y \leq 6.2 \cdot 10^{+220} \lor \neg \left(y \leq 1.7 \cdot 10^{+288}\right):\\ \;\;\;\;\sin y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 74.2% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -0.00085) (not (<= y 6.4e-35))) (* x (cos y)) (- x (* y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -0.00085) || !(y <= 6.4e-35)) {
		tmp = x * cos(y);
	} else {
		tmp = 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.00085d0)) .or. (.not. (y <= 6.4d-35))) then
        tmp = x * cos(y)
    else
        tmp = 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.00085) || !(y <= 6.4e-35)) {
		tmp = x * Math.cos(y);
	} else {
		tmp = x - (y * z);
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -0.00085) || ~((y <= 6.4e-35)))
		tmp = x * cos(y);
	else
		tmp = x - (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -8.49999999999999953e-4 or 6.3999999999999996e-35 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf 58.1%

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

   if -8.49999999999999953e-4 < y < 6.3999999999999996e-35

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 100.0%

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

      1. mul-1-neg 100.0%

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

      2. unsub-neg 100.0%

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

   5. Simplified 100.0%

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

4. Final simplification 81.2%

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

Alternative 6: 41.5% accurate, 25.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.25 \cdot 10^{+105} \lor \neg \left(z \leq 6 \cdot 10^{+129}\right):\\ \;\;\;\;z \cdot \left(-y\right)\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.25e+105) (not (<= z 6e+129))) (* z (- y)) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.25e+105) || !(z <= 6e+129)) {
		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 ((z <= (-1.25d+105)) .or. (.not. (z <= 6d+129))) 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 ((z <= -1.25e+105) || !(z <= 6e+129)) {
		tmp = z * -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.25e+105) or not (z <= 6e+129):
		tmp = z * -y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.25e+105) || !(z <= 6e+129))
		tmp = Float64(z * Float64(-y));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.25e+105) || ~((z <= 6e+129)))
		tmp = z * -y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.25000000000000011e105 or 6.0000000000000006e129 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 70.6%

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

      1. mul-1-neg 70.6%

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

      2. *-commutative 70.6%

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

      3. distribute-rgt-neg-in 70.6%

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

   5. Simplified 70.6%

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

   6. Taylor expanded in y around 0 43.1%

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

      1. mul-1-neg 43.1%

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

      2. distribute-rgt-neg-in 43.1%

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

   8. Simplified 43.1%

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

   if -1.25000000000000011e105 < z < 6.0000000000000006e129

   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. *-commutative 99.8%

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

      4. distribute-rgt-neg-in 99.8%

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

      5. fma-def 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in y around 0 50.1%

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

4. Final simplification 48.1%

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

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

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

3. Taylor expanded in y around 0 60.0%

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

   1. mul-1-neg 60.0%

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

   2. unsub-neg 60.0%

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

5. Simplified 60.0%

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

6. Final simplification 60.0%

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

Alternative 8: 38.6% 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. *-commutative 99.8%

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

   4. distribute-rgt-neg-in 99.8%

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

   5. fma-def 99.8%

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

4. Applied egg-rr 99.8%

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

5. Taylor expanded in y around 0 43.9%

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

6. Final simplification 43.9%

   \[\leadsto x \]
7. Add Preprocessing

Reproduce

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