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

Percentage Accurate: 99.8% → 99.8%

Time: 8.4s

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-def 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.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+115} \lor \neg \left(z \leq 4.4 \cdot 10^{+88}\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.85e+115) (not (<= z 4.4e+88)))
   (* z (cos y))
   (+ z (* x (sin y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.85e+115) || !(z <= 4.4e+88)) {
		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.85d+115)) .or. (.not. (z <= 4.4d+88))) 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.85e+115) || !(z <= 4.4e+88)) {
		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.85e+115) or not (z <= 4.4e+88):
		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.85e+115) || !(z <= 4.4e+88))
		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.85e+115) || ~((z <= 4.4e+88)))
		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.85e+115], N[Not[LessEqual[z, 4.4e+88]], $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.85000000000000003e115 or 4.40000000000000017e88 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 93.5%

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

   if -1.85000000000000003e115 < z < 4.40000000000000017e88

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 90.4%

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

4. Final simplification 91.6%

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

Alternative 4: 75.3% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -7.2e-8) (not (<= y 0.145))) (* x (sin y)) (+ z (* x y))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7.19999999999999962e-8 or 0.14499999999999999 < y

   1. Initial program 99.7%

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

   3. Taylor expanded in x around inf 53.2%

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

   if -7.19999999999999962e-8 < y < 0.14499999999999999

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.3%

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

      1. *-commutative 99.3%

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

   5. Simplified 99.3%

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

4. Final simplification 77.0%

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

Alternative 5: 71.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3 \cdot 10^{-103} \lor \neg \left(z \leq 4.3 \cdot 10^{+88}\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 -3e-103) (not (<= z 4.3e+88))) (* z (cos y)) (* x (sin y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3e-103) || !(z <= 4.3e+88)) {
		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 <= (-3d-103)) .or. (.not. (z <= 4.3d+88))) 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 <= -3e-103) || !(z <= 4.3e+88)) {
		tmp = z * Math.cos(y);
	} else {
		tmp = x * Math.sin(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3e-103) or not (z <= 4.3e+88):
		tmp = z * math.cos(y)
	else:
		tmp = x * math.sin(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3e-103) || !(z <= 4.3e+88))
		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 <= -3e-103) || ~((z <= 4.3e+88)))
		tmp = z * cos(y);
	else
		tmp = x * sin(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3e-103], N[Not[LessEqual[z, 4.3e+88]], $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 < -3e-103 or 4.29999999999999974e88 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0 86.1%

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

   if -3e-103 < z < 4.29999999999999974e88

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 72.4%

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

4. Final simplification 79.6%

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

Alternative 6: 41.0% accurate, 15.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{-103}:\\ \;\;\;\;z\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{-39}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1.8e-103) z (if (<= z 2.8e-39) (* x y) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1.8e-103) {
		tmp = z;
	} else if (z <= 2.8e-39) {
		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 (z <= (-1.8d-103)) then
        tmp = z
    else if (z <= 2.8d-39) 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 (z <= -1.8e-103) {
		tmp = z;
	} else if (z <= 2.8e-39) {
		tmp = x * y;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1.8e-103:
		tmp = z
	elif z <= 2.8e-39:
		tmp = x * y
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1.8e-103)
		tmp = z;
	elseif (z <= 2.8e-39)
		tmp = Float64(x * y);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1.8e-103)
		tmp = z;
	elseif (z <= 2.8e-39)
		tmp = x * y;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1.8e-103], z, If[LessEqual[z, 2.8e-39], N[(x * y), $MachinePrecision], z]]

Derivation

1. Split input into 2 regimes

2. if z < -1.7999999999999999e-103 or 2.8000000000000001e-39 < z

   1. Initial program 99.8%

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

      1. expm1-log1p-u 99.8%

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

   4. Applied egg-rr 99.8%

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

   5. Taylor expanded in y around 0 70.8%

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

   6. Taylor expanded in x around 0 50.5%

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

   if -1.7999999999999999e-103 < z < 2.8000000000000001e-39

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf 75.0%

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

   4. Taylor expanded in y around 0 37.9%

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

      1. *-commutative 37.9%

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

   6. Simplified 37.9%

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

4. Final simplification 45.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{-103}:\\ \;\;\;\;z\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{-39}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 53.3% 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 55.0%

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

   1. *-commutative 55.0%

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

5. Simplified 55.0%

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

6. Final simplification 55.0%

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

Alternative 8: 39.5% 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. expm1-log1p-u 99.8%

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

4. Applied egg-rr 99.8%

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

5. Taylor expanded in y around 0 79.0%

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

6. Taylor expanded in x around 0 39.3%

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

7. Final simplification 39.3%

   \[\leadsto z \]
8. Add Preprocessing

Reproduce

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