Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 8.4s

Alternatives: 13

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.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. Add Preprocessing

Alternative 2: 76.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.8 \cdot 10^{+27}:\\ \;\;\;\;x - z\\ \mathbf{elif}\;z \leq 1.8 \cdot 10^{+71}:\\ \;\;\;\;\left(x + y\right) - y \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \log y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.8e+27)
   (- x z)
   (if (<= z 1.8e+71) (- (+ x y) (* y (log y))) (- (* y (- 1.0 (log y))) z))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.8e+27) {
		tmp = x - z;
	} else if (z <= 1.8e+71) {
		tmp = (x + y) - (y * Math.log(y));
	} else {
		tmp = (y * (1.0 - Math.log(y))) - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.8e+27:
		tmp = x - z
	elif z <= 1.8e+71:
		tmp = (x + y) - (y * math.log(y))
	else:
		tmp = (y * (1.0 - math.log(y))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.8e+27)
		tmp = Float64(x - z);
	elseif (z <= 1.8e+71)
		tmp = Float64(Float64(x + y) - Float64(y * log(y)));
	else
		tmp = Float64(Float64(y * Float64(1.0 - log(y))) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -5.8e+27)
		tmp = x - z;
	elseif (z <= 1.8e+71)
		tmp = (x + y) - (y * log(y));
	else
		tmp = (y * (1.0 - log(y))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.8e+27], N[(x - z), $MachinePrecision], If[LessEqual[z, 1.8e+71], N[(N[(x + y), $MachinePrecision] - N[(y * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -5.8000000000000002e27

   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)} \]

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 99.9%

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

      1. mul-1-neg 99.9%

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

      2. distribute-rgt-neg-in 99.9%

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

      3. log-rec 99.9%

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

      4. remove-double-neg 99.9%

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

   7. Simplified 99.9%

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

   8. Taylor expanded in y around 0 86.1%

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

   if -5.8000000000000002e27 < z < 1.8e71

   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)} \]

   3. Simplified 99.7%

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

   5. Taylor expanded in y around inf 83.9%

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

      1. mul-1-neg 83.9%

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

      2. distribute-rgt-neg-in 83.9%

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

      3. log-rec 83.9%

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

      4. remove-double-neg 83.9%

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

   7. Simplified 83.9%

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

   8. Taylor expanded in z around 0 82.9%

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

      1. +-commutative 82.9%

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

   10. Simplified 82.9%

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

   if 1.8e71 < z

   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 x around inf 79.9%

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

   4. Taylor expanded in y around inf 69.6%

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

      1. mul-1-neg 69.6%

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

      2. distribute-frac-neg 69.6%

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

      3. log-rec 69.6%

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

      4. remove-double-neg 69.6%

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

   6. Simplified 69.6%

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

   7. Taylor expanded in x around 0 88.3%

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

4. Final simplification 84.7%

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

Alternative 3: 99.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 0.215) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = (x + (y * (1.0 - log(y)))) - z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 0.215d0) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = (x + (y * (1.0d0 - log(y)))) - z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 0.214999999999999997

   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 99.3%

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

   if 0.214999999999999997 < 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)} \]

   3. Simplified 99.6%

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

   5. Taylor expanded in y around inf 99.6%

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

      1. mul-1-neg 99.6%

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

      2. distribute-rgt-neg-in 99.6%

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

      3. log-rec 99.6%

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

      4. remove-double-neg 99.6%

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

   7. Simplified 99.6%

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

   8. Taylor expanded in y around 0 99.7%

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

4. Final simplification 99.5%

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

Alternative 4: 99.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 0.215) (- (- x (* (log y) 0.5)) z) (+ (- y z) (- x (* y (log y))))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 0.214999999999999997

   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 99.3%

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

   if 0.214999999999999997 < 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)} \]

   3. Simplified 99.6%

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

   5. Taylor expanded in y around inf 99.6%

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

      1. mul-1-neg 99.6%

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

      2. distribute-rgt-neg-in 99.6%

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

      3. log-rec 99.6%

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

      4. remove-double-neg 99.6%

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

   7. Simplified 99.6%

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

4. Final simplification 99.4%

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

Alternative 5: 89.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 6.4e+66) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = (y * (1.0 - log(y))) - z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 6.4d+66) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = (y * (1.0d0 - log(y))) - z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.3999999999999999e66

   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 94.4%

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

   if 6.3999999999999999e66 < y

   1. Initial program 99.5%

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

   3. Taylor expanded in x around inf 63.2%

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

   4. Taylor expanded in y around inf 53.1%

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

      1. mul-1-neg 53.1%

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

      2. distribute-frac-neg 53.1%

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

      3. log-rec 53.1%

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

      4. remove-double-neg 53.1%

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

   6. Simplified 53.1%

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

   7. Taylor expanded in x around 0 87.4%

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

4. Final simplification 91.5%

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

Alternative 6: 76.7% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 1.35e+66) (- x z) (- (* y (- 1.0 (log y))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 1.35e+66) {
		tmp = x - z;
	} else {
		tmp = (y * (1.0 - log(y))) - z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= 1.35d+66) then
        tmp = x - z
    else
        tmp = (y * (1.0d0 - log(y))) - z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.35e66

   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)} \]

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 84.3%

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

      1. mul-1-neg 84.3%

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

      2. distribute-rgt-neg-in 84.3%

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

      3. log-rec 84.3%

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

      4. remove-double-neg 84.3%

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

   7. Simplified 84.3%

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

   8. Taylor expanded in y around 0 79.0%

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

   if 1.35e66 < y

   1. Initial program 99.5%

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

   3. Taylor expanded in x around inf 63.2%

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

   4. Taylor expanded in y around inf 53.1%

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

      1. mul-1-neg 53.1%

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

      2. distribute-frac-neg 53.1%

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

      3. log-rec 53.1%

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

      4. remove-double-neg 53.1%

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

   6. Simplified 53.1%

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

   7. Taylor expanded in x around 0 87.4%

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

Alternative 7: 76.6% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 2.8e+66) (- x z) (- y (+ z (* y (log y))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 2.8e+66) {
		tmp = x - 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 <= 2.8d+66) then
        tmp = x - 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 <= 2.8e+66) {
		tmp = x - z;
	} else {
		tmp = y - (z + (y * Math.log(y)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 2.8e+66:
		tmp = x - z
	else:
		tmp = y - (z + (y * math.log(y)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 2.8e+66)
		tmp = Float64(x - z);
	else
		tmp = Float64(y - Float64(z + Float64(y * log(y))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 2.8e+66)
		tmp = x - z;
	else
		tmp = y - (z + (y * log(y)));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.8000000000000001e66

   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)} \]

   3. Simplified 100.0%

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

   5. Taylor expanded in y around inf 84.3%

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

      1. mul-1-neg 84.3%

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

      2. distribute-rgt-neg-in 84.3%

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

      3. log-rec 84.3%

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

      4. remove-double-neg 84.3%

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

   7. Simplified 84.3%

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

   8. Taylor expanded in y around 0 79.0%

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

   if 2.8000000000000001e66 < y

   1. Initial program 99.5%

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

      1. associate--l+ 99.5%

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

   3. Simplified 99.5%

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

   5. Taylor expanded in y around inf 99.5%

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

      1. mul-1-neg 99.5%

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

      2. distribute-rgt-neg-in 99.5%

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

      3. log-rec 99.5%

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

      4. remove-double-neg 99.5%

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

   7. Simplified 99.5%

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

   8. Taylor expanded in x around 0 87.3%

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

      1. +-commutative 87.3%

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

   10. Simplified 87.3%

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

4. Final simplification 82.4%

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

Alternative 8: 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 9: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(x - N[(N[Log[y], $MachinePrecision] * N[(y + 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(y - 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)} \]

3. Simplified 99.8%

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

5. Final simplification 99.8%

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

Alternative 10: 70.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 6.2e+158) (- x z) (* y (- 1.0 (log y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 6.2e+158) {
		tmp = x - 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 <= 6.2d+158) then
        tmp = x - 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 <= 6.2e+158) {
		tmp = x - z;
	} else {
		tmp = y * (1.0 - Math.log(y));
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 6.2e+158)
		tmp = Float64(x - 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 <= 6.2e+158)
		tmp = x - z;
	else
		tmp = y * (1.0 - log(y));
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6.2000000000000004e158

   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)} \]

   3. Simplified 99.9%

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

   5. Taylor expanded in y around inf 88.0%

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

      1. mul-1-neg 88.0%

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

      2. distribute-rgt-neg-in 88.0%

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

      3. log-rec 88.0%

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

      4. remove-double-neg 88.0%

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

   7. Simplified 88.0%

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

   8. Taylor expanded in y around 0 72.1%

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

   if 6.2000000000000004e158 < y

   1. Initial program 99.4%

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

      1. associate--l+ 99.3%

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

      2. sub-neg 99.3%

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

      3. associate-+l+ 99.3%

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

      4. associate-+r- 99.4%

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

      5. *-commutative 99.4%

         \[\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.4%

         \[\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 88.4%

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

      1. log-rec 88.4%

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

      2. sub-neg 88.4%

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

   7. Simplified 88.4%

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

Alternative 11: 46.8% accurate, 9.2× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -4e+56) (not (<= z 3.5e+72))) (- z) x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4e+56) || !(z <= 3.5e+72)) {
		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 ((z <= (-4d+56)) .or. (.not. (z <= 3.5d+72))) 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 ((z <= -4e+56) || !(z <= 3.5e+72)) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -4e+56) or not (z <= 3.5e+72):
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -4e+56) || !(z <= 3.5e+72))
		tmp = Float64(-z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -4e+56) || ~((z <= 3.5e+72)))
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -4e+56], N[Not[LessEqual[z, 3.5e+72]], $MachinePrecision]], (-z), x]

Derivation

1. Split input into 2 regimes

2. if z < -4.00000000000000037e56 or 3.5000000000000001e72 < z

   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 z around inf 65.3%

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

      1. neg-mul-1 65.3%

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

   7. Simplified 65.3%

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

   if -4.00000000000000037e56 < z < 3.5000000000000001e72

   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.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 x around inf 38.5%

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

4. Final simplification 49.3%

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

Alternative 12: 57.0% accurate, 37.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

3. Simplified 99.8%

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

5. Taylor expanded in y around inf 90.7%

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

   1. mul-1-neg 90.7%

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

   2. distribute-rgt-neg-in 90.7%

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

   3. log-rec 90.7%

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

   4. remove-double-neg 90.7%

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

7. Simplified 90.7%

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

8. Taylor expanded in y around 0 57.9%

   \[\leadsto \color{blue}{x - z} \]
9. Add Preprocessing

Alternative 13: 30.0% 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.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 x around inf 30.6%

   \[\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 2024186 
(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))