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

Percentage Accurate: 99.8% → 99.8%

Time: 8.5s

Alternatives: 8

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. fma-define 99.8%

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

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Final simplification 99.8%

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

Alternative 3: 86.8% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.52e+32) (not (<= z 62000000000000.0)))
   (* z (cos y))
   (+ z (* x (sin y)))))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.52e+32) or not (z <= 62000000000000.0):
		tmp = z * math.cos(y)
	else:
		tmp = z + (x * math.sin(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.52e+32) || !(z <= 62000000000000.0))
		tmp = Float64(z * cos(y));
	else
		tmp = Float64(z + Float64(x * sin(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.52e+32) || ~((z <= 62000000000000.0)))
		tmp = z * cos(y);
	else
		tmp = z + (x * sin(y));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.5200000000000001e32 or 6.2e13 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 87.5%

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

   if -1.5200000000000001e32 < z < 6.2e13

   1. Initial program 99.7%

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

   3. Taylor expanded in y around 0 89.9%

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

4. Final simplification 88.8%

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

Alternative 4: 74.3% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -980000.0) (not (<= y 0.118)))
   (* x (sin y))
   (+ z (* y (+ x (* y (+ (* z -0.5) (* -0.16666666666666666 (* x y)))))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -9.8e5 or 0.11799999999999999 < y

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf 51.8%

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

   if -9.8e5 < y < 0.11799999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 98.9%

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

4. Final simplification 73.5%

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

Alternative 5: 74.6% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.75e-89) (not (<= z 1.75e-20))) (* z (cos y)) (* x (sin y))))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -2.75e-89) or not (z <= 1.75e-20):
		tmp = z * math.cos(y)
	else:
		tmp = x * math.sin(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -2.75e-89) || !(z <= 1.75e-20))
		tmp = Float64(z * cos(y));
	else
		tmp = Float64(x * sin(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.75e-89) || ~((z <= 1.75e-20)))
		tmp = z * cos(y);
	else
		tmp = x * sin(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -2.75e-89], N[Not[LessEqual[z, 1.75e-20]], $MachinePrecision]], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(x * N[Sin[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -2.75000000000000006e-89 or 1.75000000000000002e-20 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 82.2%

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

   if -2.75000000000000006e-89 < z < 1.75000000000000002e-20

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 78.0%

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

4. Final simplification 80.4%

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

Alternative 6: 40.4% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.6 \cdot 10^{+29} \lor \neg \left(x \leq 3.5 \cdot 10^{+199}\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -6.6e+29) (not (<= x 3.5e+199))) (* x y) z))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -6.6e+29) || !(x <= 3.5e+199)) {
		tmp = x * y;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -6.6e+29) or not (x <= 3.5e+199):
		tmp = x * y
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -6.6e+29) || !(x <= 3.5e+199))
		tmp = Float64(x * y);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -6.6e+29) || ~((x <= 3.5e+199)))
		tmp = x * y;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -6.6e+29], N[Not[LessEqual[x, 3.5e+199]], $MachinePrecision]], N[(x * y), $MachinePrecision], z]

Derivation

1. Split input into 2 regimes

2. if x < -6.59999999999999968e29 or 3.49999999999999981e199 < x

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 49.8%

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

      1. +-commutative 49.8%

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

   5. Simplified 49.8%

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

   6. Taylor expanded in x around inf 38.8%

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

      1. *-commutative 38.8%

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

   8. Simplified 38.8%

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

   if -6.59999999999999968e29 < x < 3.49999999999999981e199

   1. Initial program 99.8%

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

      1. +-commutative 99.8%

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

      2. *-commutative 99.8%

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

      3. add-cube-cbrt 99.2%

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

      4. associate-*l* 99.2%

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

      5. fma-define 99.2%

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

      6. pow2 99.2%

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

   4. Applied egg-rr 99.2%

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

   5. Taylor expanded in y around 0 44.0%

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

4. Final simplification 42.3%

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

Alternative 7: 52.1% accurate, 41.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

3. Taylor expanded in y around 0 49.0%

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

   1. +-commutative 49.0%

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

5. Simplified 49.0%

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

6. Final simplification 49.0%

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

Alternative 8: 38.4% accurate, 207.0× speedup

Math

\[\begin{array}{l} \\ z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

function code(x, y, z)
	return z
end

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 99.8%

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

   1. +-commutative 99.8%

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

   2. *-commutative 99.8%

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

   3. add-cube-cbrt 99.3%

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

   4. associate-*l* 99.3%

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

   5. fma-define 99.3%

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

   6. pow2 99.3%

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

4. Applied egg-rr 99.3%

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

5. Taylor expanded in y around 0 34.3%

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

6. Final simplification 34.3%

   \[\leadsto z \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024078 
(FPCore (x y z)
  :name "Diagrams.ThreeD.Transform:aboutX from diagrams-lib-1.3.0.3, B"
  :precision binary64
  (+ (* x (sin y)) (* z (cos y))))