Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 9.0s

Alternatives: 12

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ (- x (* (+ y 0.5) (log y))) y) z))

C

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

Java

public static double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * Math.log(y))) + y) - z;
}

Python

def code(x, y, z):
	return ((x - ((y + 0.5) * math.log(y))) + y) - z

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ (- x (* (+ y 0.5) (log y))) y) z))

C

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

Java

public static double code(double x, double y, double z) {
	return ((x - ((y + 0.5) * Math.log(y))) + y) - z;
}

Python

def code(x, y, z):
	return ((x - ((y + 0.5) * math.log(y))) + y) - z

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right) \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (- (fma (log y) (- -0.5 y) y) z)))

C

double code(double x, double y, double z) {
	return x + (fma(log(y), (-0.5 - y), y) - z);
}

Julia

function code(x, y, z)
	return Float64(x + Float64(fma(log(y), Float64(-0.5 - y), y) - z))
end

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Step-by-step derivation

   1. associate--l+ 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-+l+ 99.8%

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

   4. associate-+r- 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-define 99.9%

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

   8. +-commutative 99.9%

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

   9. distribute-neg-in 99.9%

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

   10. unsub-neg 99.9%

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

   11. metadata-eval 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 88.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.3 \cdot 10^{+97} \lor \neg \left(x \leq 3.6 \cdot 10^{+50}\right):\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(y + \left(y + 0.5\right) \cdot \log \left(\frac{1}{y}\right)\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.3e+97) (not (<= x 3.6e+50)))
   (- (- x (* (log y) 0.5)) z)
   (- (+ y (* (+ y 0.5) (log (/ 1.0 y)))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.3e+97) || !(x <= 3.6e+50)) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = (y + ((y + 0.5) * log((1.0 / 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 <= (-1.3d+97)) .or. (.not. (x <= 3.6d+50))) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = (y + ((y + 0.5d0) * log((1.0d0 / y)))) - z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.3e+97) || !(x <= 3.6e+50)) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else {
		tmp = (y + ((y + 0.5) * Math.log((1.0 / y)))) - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.3e+97) or not (x <= 3.6e+50):
		tmp = (x - (math.log(y) * 0.5)) - z
	else:
		tmp = (y + ((y + 0.5) * math.log((1.0 / y)))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.3e+97) || !(x <= 3.6e+50))
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	else
		tmp = Float64(Float64(y + Float64(Float64(y + 0.5) * log(Float64(1.0 / y)))) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.3e+97) || ~((x <= 3.6e+50)))
		tmp = (x - (log(y) * 0.5)) - z;
	else
		tmp = (y + ((y + 0.5) * log((1.0 / y)))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.3e+97], N[Not[LessEqual[x, 3.6e+50]], $MachinePrecision]], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(N[(y + N[(N[(y + 0.5), $MachinePrecision] * N[Log[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.3e97 or 3.59999999999999986e50 < x

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 89.4%

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

   if -1.3e97 < x < 3.59999999999999986e50

   1. Initial program 99.8%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.8%

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

   4. Taylor expanded in x around 0 95.5%

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

4. Final simplification 93.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.3 \cdot 10^{+97} \lor \neg \left(x \leq 3.6 \cdot 10^{+50}\right):\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(y + \left(y + 0.5\right) \cdot \log \left(\frac{1}{y}\right)\right) - z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 49.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+69}:\\ \;\;\;\;-z\\ \mathbf{elif}\;z \leq -1.55 \cdot 10^{-16}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 3.5 \cdot 10^{+26}:\\ \;\;\;\;y \cdot \left(1 - \log y\right)\\ \mathbf{else}:\\ \;\;\;\;-z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1e+69)
   (- z)
   (if (<= z -1.55e-16) x (if (<= z 3.5e+26) (* y (- 1.0 (log y))) (- z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1e+69) {
		tmp = -z;
	} else if (z <= -1.55e-16) {
		tmp = x;
	} else if (z <= 3.5e+26) {
		tmp = y * (1.0 - log(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 <= (-1d+69)) then
        tmp = -z
    else if (z <= (-1.55d-16)) then
        tmp = x
    else if (z <= 3.5d+26) then
        tmp = y * (1.0d0 - log(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 <= -1e+69) {
		tmp = -z;
	} else if (z <= -1.55e-16) {
		tmp = x;
	} else if (z <= 3.5e+26) {
		tmp = y * (1.0 - Math.log(y));
	} else {
		tmp = -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1e+69:
		tmp = -z
	elif z <= -1.55e-16:
		tmp = x
	elif z <= 3.5e+26:
		tmp = y * (1.0 - math.log(y))
	else:
		tmp = -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1e+69)
		tmp = Float64(-z);
	elseif (z <= -1.55e-16)
		tmp = x;
	elseif (z <= 3.5e+26)
		tmp = Float64(y * Float64(1.0 - log(y)));
	else
		tmp = Float64(-z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1e+69)
		tmp = -z;
	elseif (z <= -1.55e-16)
		tmp = x;
	elseif (z <= 3.5e+26)
		tmp = y * (1.0 - log(y));
	else
		tmp = -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1e+69], (-z), If[LessEqual[z, -1.55e-16], x, If[LessEqual[z, 3.5e+26], N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], (-z)]]]

Derivation

1. Split input into 3 regimes

2. if z < -1.0000000000000001e69 or 3.4999999999999999e26 < z

   1. Initial program 100.0%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-+l+ 100.0%

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

      4. associate-+r- 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-rgt-neg-in 100.0%

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

      7. fma-define 100.0%

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

      8. +-commutative 100.0%

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

      9. distribute-neg-in 100.0%

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

      10. unsub-neg 100.0%

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

      11. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 66.4%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   6. Step-by-step derivation

      1. neg-mul-1 66.4%

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

   7. Simplified 66.4%

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

   if -1.0000000000000001e69 < z < -1.55e-16

   1. Initial program 99.8%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-define 99.9%

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

      8. +-commutative 99.9%

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

      9. distribute-neg-in 99.9%

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

      10. unsub-neg 99.9%

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

      11. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 62.8%

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

   if -1.55e-16 < z < 3.4999999999999999e26

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-+l+ 99.7%

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

      4. associate-+r- 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-define 99.7%

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

      8. +-commutative 99.7%

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

      9. distribute-neg-in 99.7%

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

      10. unsub-neg 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 43.1%

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

      1. log-rec 43.1%

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

      2. sub-neg 43.1%

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

   7. Simplified 43.1%

      \[\leadsto \color{blue}{y \cdot \left(1 - \log y\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 88.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -7200000000000.0) (not (<= z 0.43)))
   (- (- x (* (log y) 0.5)) z)
   (+ x (- y (* (log y) (+ y 0.5))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -7200000000000.0) || ~((z <= 0.43)))
		tmp = (x - (log(y) * 0.5)) - z;
	else
		tmp = x + (y - (log(y) * (y + 0.5)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -7.2e12 or 0.429999999999999993 < z

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 87.1%

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

   if -7.2e12 < z < 0.429999999999999993

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.7%

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

      2. sub-neg 99.7%

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

      3. associate-+l+ 99.7%

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

      4. associate-+r- 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-define 99.7%

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

      8. +-commutative 99.7%

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

      9. distribute-neg-in 99.7%

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

      10. unsub-neg 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 99.7%

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

      1. associate-*r* 99.7%

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

      2. neg-mul-1 99.7%

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

      3. +-commutative 99.7%

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

      4. cancel-sign-sub-inv 99.7%

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

   7. Simplified 99.7%

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

4. Final simplification 92.9%

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

Alternative 5: 60.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+69} \lor \neg \left(z \leq 1.15 \cdot 10^{+118}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x - \log y \cdot 0.5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1e+69) (not (<= z 1.15e+118))) (- z) (- x (* (log y) 0.5))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1e+69) || !(z <= 1.15e+118)) {
		tmp = -z;
	} else {
		tmp = x - (log(y) * 0.5);
	}
	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 <= (-1d+69)) .or. (.not. (z <= 1.15d+118))) then
        tmp = -z
    else
        tmp = x - (log(y) * 0.5d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1e+69) || !(z <= 1.15e+118)) {
		tmp = -z;
	} else {
		tmp = x - (Math.log(y) * 0.5);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1e+69) or not (z <= 1.15e+118):
		tmp = -z
	else:
		tmp = x - (math.log(y) * 0.5)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1e+69) || !(z <= 1.15e+118))
		tmp = Float64(-z);
	else
		tmp = Float64(x - Float64(log(y) * 0.5));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1e+69) || ~((z <= 1.15e+118)))
		tmp = -z;
	else
		tmp = x - (log(y) * 0.5);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1e+69], N[Not[LessEqual[z, 1.15e+118]], $MachinePrecision]], (-z), N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.0000000000000001e69 or 1.15000000000000008e118 < z

   1. Initial program 100.0%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-+l+ 100.0%

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

      4. associate-+r- 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-rgt-neg-in 100.0%

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

      7. fma-define 100.0%

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

      8. +-commutative 100.0%

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

      9. distribute-neg-in 100.0%

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

      10. unsub-neg 100.0%

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

      11. metadata-eval 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 71.9%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   6. Step-by-step derivation

      1. neg-mul-1 71.9%

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

   7. Simplified 71.9%

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

   if -1.0000000000000001e69 < z < 1.15000000000000008e118

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 65.1%

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

   4. Taylor expanded in z around 0 56.5%

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

4. Final simplification 62.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+69} \lor \neg \left(z \leq 1.15 \cdot 10^{+118}\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x - \log y \cdot 0.5\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 60.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.75 \cdot 10^{+83}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 6 \cdot 10^{+121}:\\ \;\;\;\;\log y \cdot -0.5 - z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.75e+83) x (if (<= x 6e+121) (- (* (log y) -0.5) z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.75e+83) {
		tmp = x;
	} else if (x <= 6e+121) {
		tmp = (log(y) * -0.5) - 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 (x <= (-1.75d+83)) then
        tmp = x
    else if (x <= 6d+121) then
        tmp = (log(y) * (-0.5d0)) - z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.75e+83) {
		tmp = x;
	} else if (x <= 6e+121) {
		tmp = (Math.log(y) * -0.5) - z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.75e+83:
		tmp = x
	elif x <= 6e+121:
		tmp = (math.log(y) * -0.5) - z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.75e+83)
		tmp = x;
	elseif (x <= 6e+121)
		tmp = Float64(Float64(log(y) * -0.5) - z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.75e+83)
		tmp = x;
	elseif (x <= 6e+121)
		tmp = (log(y) * -0.5) - z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.75e+83], x, If[LessEqual[x, 6e+121], N[(N[(N[Log[y], $MachinePrecision] * -0.5), $MachinePrecision] - z), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.74999999999999989e83 or 6.0000000000000005e121 < x

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-+l+ 99.9%

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

      4. associate-+r- 99.9%

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

      5. *-commutative 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. fma-define 99.9%

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

      8. +-commutative 99.9%

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

      9. distribute-neg-in 99.9%

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

      10. unsub-neg 99.9%

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

      11. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 69.9%

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

   if -1.74999999999999989e83 < x < 6.0000000000000005e121

   1. Initial program 99.8%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 66.4%

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

   4. Taylor expanded in x around 0 60.5%

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

      1. *-commutative 60.5%

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

   6. Simplified 60.5%

      \[\leadsto \color{blue}{\log y \cdot -0.5} - z \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(y + \left(x + \left(y + 0.5\right) \cdot \log \left(\frac{1}{y}\right)\right)\right) - z \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (- (+ y (+ x (* (+ y 0.5) (log (/ 1.0 y))))) z))

C

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

Java

public static double code(double x, double y, double z) {
	return (y + (x + ((y + 0.5) * Math.log((1.0 / y))))) - z;
}

Python

def code(x, y, z):
	return (y + (x + ((y + 0.5) * math.log((1.0 / y))))) - z

Julia

function code(x, y, z)
	return Float64(Float64(y + Float64(x + Float64(Float64(y + 0.5) * log(Float64(1.0 / y))))) - z)
end

MATLAB

function tmp = code(x, y, z)
	tmp = (y + (x + ((y + 0.5) * log((1.0 / y))))) - z;
end

Wolfram

code[x_, y_, z_] := N[(N[(y + N[(x + N[(N[(y + 0.5), $MachinePrecision] * N[Log[N[(1.0 / y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Add Preprocessing

3. Taylor expanded in y around inf 99.8%

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

4. Final simplification 99.8%

   \[\leadsto \left(y + \left(x + \left(y + 0.5\right) \cdot \log \left(\frac{1}{y}\right)\right)\right) - z \]
5. Add Preprocessing

Alternative 8: 87.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 3.5 \cdot 10^{-13}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) - y \cdot \log y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 3.5e-13) (- (- x (* (log y) 0.5)) z) (- (- y z) (* y (log y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 3.5e-13) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = (y - z) - (y * log(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 <= 3.5d-13) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = (y - z) - (y * log(y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 3.5e-13) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else {
		tmp = (y - z) - (y * Math.log(y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 3.5e-13:
		tmp = (x - (math.log(y) * 0.5)) - z
	else:
		tmp = (y - z) - (y * math.log(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 3.5e-13)
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	else
		tmp = Float64(Float64(y - z) - Float64(y * log(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 3.5e-13)
		tmp = (x - (log(y) * 0.5)) - z;
	else
		tmp = (y - z) - (y * log(y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 3.5e-13], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(N[(y - z), $MachinePrecision] - N[(y * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 3.5000000000000002e-13

   1. Initial program 100.0%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 100.0%

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

   if 3.5000000000000002e-13 < y

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf 99.7%

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

   4. Taylor expanded in y around inf 77.5%

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

      1. *-commutative 77.5%

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

      2. log-rec 77.5%

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

      3. distribute-lft-neg-in 77.5%

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

      4. distribute-rgt-neg-in 77.5%

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

   6. Simplified 77.5%

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

   7. Taylor expanded in z around 0 77.5%

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

      1. neg-mul-1 77.5%

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

      2. associate-+r+ 77.5%

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

      3. sub-neg 77.5%

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

      4. mul-1-neg 77.5%

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

      5. unsub-neg 77.5%

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

   9. Simplified 77.5%

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

4. Final simplification 89.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 3.5 \cdot 10^{-13}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;\left(y - z\right) - y \cdot \log y\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 83.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5.5 \cdot 10^{+184}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \log y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 5.5e+184) (- (- x (* (log y) 0.5)) z) (* y (- 1.0 (log y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 5.5e+184) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = y * (1.0 - log(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 <= 5.5d+184) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = y * (1.0d0 - log(y))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 5.5e+184) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else {
		tmp = y * (1.0 - Math.log(y));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 5.5e+184:
		tmp = (x - (math.log(y) * 0.5)) - z
	else:
		tmp = y * (1.0 - math.log(y))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 5.5e+184)
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	else
		tmp = Float64(y * Float64(1.0 - log(y)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 5.5e+184)
		tmp = (x - (log(y) * 0.5)) - z;
	else
		tmp = y * (1.0 - log(y));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 5.5e+184], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 5.5000000000000002e184

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 84.6%

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

   if 5.5000000000000002e184 < y

   1. Initial program 99.6%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.6%

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

      2. sub-neg 99.6%

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

      3. associate-+l+ 99.6%

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

      4. associate-+r- 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-define 99.6%

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

      8. +-commutative 99.6%

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

      9. distribute-neg-in 99.6%

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

      10. unsub-neg 99.6%

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

      11. metadata-eval 99.6%

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

   3. Simplified 99.6%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 86.2%

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

      1. log-rec 86.2%

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

      2. sub-neg 86.2%

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

   7. Simplified 86.2%

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

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 5.5 \cdot 10^{+184}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \log y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(y + \left(x - \log y \cdot \left(y + 0.5\right)\right)\right) - z \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (+ y (- x (* (log y) (+ y 0.5)))) z))

C

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

Java

public static double code(double x, double y, double z) {
	return (y + (x - (Math.log(y) * (y + 0.5)))) - z;
}

Python

def code(x, y, z):
	return (y + (x - (math.log(y) * (y + 0.5)))) - z

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Add Preprocessing

3. Final simplification 99.8%

   \[\leadsto \left(y + \left(x - \log y \cdot \left(y + 0.5\right)\right)\right) - z \]
4. Add Preprocessing

Alternative 11: 48.2% accurate, 9.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.65 \cdot 10^{+83}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 2 \cdot 10^{+122}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.65e+83) x (if (<= x 2e+122) (- z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.65e+83) {
		tmp = x;
	} else if (x <= 2e+122) {
		tmp = -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 (x <= (-1.65d+83)) then
        tmp = x
    else if (x <= 2d+122) then
        tmp = -z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.65e+83) {
		tmp = x;
	} else if (x <= 2e+122) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.65e+83:
		tmp = x
	elif x <= 2e+122:
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.65e+83)
		tmp = x;
	elseif (x <= 2e+122)
		tmp = Float64(-z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.65e+83)
		tmp = x;
	elseif (x <= 2e+122)
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.65e+83], x, If[LessEqual[x, 2e+122], (-z), x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.64999999999999992e83 or 2.00000000000000003e122 < x

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-+l+ 99.9%

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

      4. associate-+r- 99.9%

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

      5. *-commutative 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. fma-define 99.9%

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

      8. +-commutative 99.9%

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

      9. distribute-neg-in 99.9%

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

      10. unsub-neg 99.9%

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

      11. metadata-eval 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 69.9%

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

   if -1.64999999999999992e83 < x < 2.00000000000000003e122

   1. Initial program 99.8%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Step-by-step derivation

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-define 99.8%

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

      8. +-commutative 99.8%

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

      9. distribute-neg-in 99.8%

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

      10. unsub-neg 99.8%

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

      11. metadata-eval 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 43.6%

      \[\leadsto \color{blue}{-1 \cdot z} \]
   6. Step-by-step derivation

      1. neg-mul-1 43.6%

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

   7. Simplified 43.6%

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

Alternative 12: 30.4% accurate, 111.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%

   \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
2. Step-by-step derivation

   1. associate--l+ 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-+l+ 99.8%

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

   4. associate-+r- 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-define 99.9%

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

   8. +-commutative 99.9%

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

   9. distribute-neg-in 99.9%

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

   10. unsub-neg 99.9%

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

   11. metadata-eval 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{x + \left(\mathsf{fma}\left(\log y, -0.5 - y, y\right) - z\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf 30.1%

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

Developer Target 1: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(y + x\right) - z\right) - \left(y + 0.5\right) \cdot \log y \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (- (- (+ y x) z) (* (+ y 0.5) (log y))))

C

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

Java

public static double code(double x, double y, double z) {
	return ((y + x) - z) - ((y + 0.5) * Math.log(y));
}

Python

def code(x, y, z):
	return ((y + x) - z) - ((y + 0.5) * math.log(y))

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024132 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2"
  :precision binary64

  :alt
  (! :herbie-platform default (- (- (+ y x) z) (* (+ y 1/2) (log y))))

  (- (+ (- x (* (+ y 0.5) (log y))) y) z))