Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 9.1s

Alternatives: 11

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 + \mathsf{fma}\left(\log y, -0.5 - y, y - 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 + fma(log(y), Float64(-0.5 - y), Float64(y - z)))
end

Wolfram

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

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

   5. distribute-rgt-neg-in 99.8%

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

   6. fma-def 99.9%

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

   7. +-commutative 99.9%

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

   8. distribute-neg-in 99.9%

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

   9. unsub-neg 99.9%

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

   10. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 89.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{+77} \lor \neg \left(x \leq 2.05 \cdot 10^{+99}\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;\left(y - \log y \cdot \left(y + 0.5\right)\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.1e+77) (not (<= x 2.05e+99)))
   (- x z)
   (- (- y (* (log y) (+ y 0.5))) z)))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.1e+77) or not (x <= 2.05e+99):
		tmp = x - z
	else:
		tmp = (y - (math.log(y) * (y + 0.5))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.1e+77) || !(x <= 2.05e+99))
		tmp = Float64(x - z);
	else
		tmp = Float64(Float64(y - Float64(log(y) * Float64(y + 0.5))) - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.1e+77) || ~((x <= 2.05e+99)))
		tmp = x - z;
	else
		tmp = (y - (log(y) * (y + 0.5))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.1e+77], N[Not[LessEqual[x, 2.05e+99]], $MachinePrecision]], N[(x - z), $MachinePrecision], N[(N[(y - N[(N[Log[y], $MachinePrecision] * N[(y + 0.5), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.0999999999999999e77 or 2.0499999999999999e99 < 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. +-commutative 99.9%

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

      2. associate-+r- 99.9%

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

      3. *-commutative 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in x around inf 91.6%

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

   if -2.0999999999999999e77 < x < 2.0499999999999999e99

   1. Initial program 99.8%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]

   2. Taylor expanded in x around 0 92.6%

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

4. Final simplification 92.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.1 \cdot 10^{+77} \lor \neg \left(x \leq 2.05 \cdot 10^{+99}\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;\left(y - \log y \cdot \left(y + 0.5\right)\right) - z\\ \end{array} \]

Alternative 3: 77.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{+77} \lor \neg \left(x \leq 8.2 \cdot 10^{+99}\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \log y\right) - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -4.5e+77) (not (<= x 8.2e+99)))
   (- x z)
   (- (* y (- 1.0 (log y))) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -4.5e+77) || !(x <= 8.2e+99)) {
		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 ((x <= (-4.5d+77)) .or. (.not. (x <= 8.2d+99))) 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 ((x <= -4.5e+77) || !(x <= 8.2e+99)) {
		tmp = x - z;
	} else {
		tmp = (y * (1.0 - Math.log(y))) - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -4.5e+77) or not (x <= 8.2e+99):
		tmp = x - z
	else:
		tmp = (y * (1.0 - math.log(y))) - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -4.5e+77) || !(x <= 8.2e+99))
		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 ((x <= -4.5e+77) || ~((x <= 8.2e+99)))
		tmp = x - z;
	else
		tmp = (y * (1.0 - log(y))) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -4.5e+77], N[Not[LessEqual[x, 8.2e+99]], $MachinePrecision]], 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 x < -4.50000000000000024e77 or 8.19999999999999959e99 < 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. +-commutative 99.9%

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

      2. associate-+r- 99.9%

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

      3. *-commutative 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in x around inf 91.6%

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

   if -4.50000000000000024e77 < x < 8.19999999999999959e99

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

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

      2. associate-+r- 99.8%

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

      3. *-commutative 99.8%

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

   3. Applied egg-rr 99.8%

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

   4. Taylor expanded in y around inf 81.9%

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

      1. sub-neg 81.9%

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

      2. distribute-rgt-in 81.8%

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

      3. log-rec 81.8%

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

      4. mul-1-neg 81.8%

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

      5. remove-double-neg 81.8%

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

      6. distribute-rgt-in 81.9%

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

      7. sub-neg 81.9%

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

   6. Simplified 81.9%

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

4. Final simplification 85.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.5 \cdot 10^{+77} \lor \neg \left(x \leq 8.2 \cdot 10^{+99}\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - \log y\right) - z\\ \end{array} \]

Alternative 4: 89.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - \log y\right)\\ \mathbf{if}\;y \leq 61000000000000:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{elif}\;y \leq 2 \cdot 10^{+122}:\\ \;\;\;\;x + t_0\\ \mathbf{else}:\\ \;\;\;\;t_0 - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 (log y)))))
   (if (<= y 61000000000000.0)
     (- (- x (* (log y) 0.5)) z)
     (if (<= y 2e+122) (+ x t_0) (- t_0 z)))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 - log(y));
	double tmp;
	if (y <= 61000000000000.0) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else if (y <= 2e+122) {
		tmp = x + t_0;
	} else {
		tmp = t_0 - 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) :: t_0
    real(8) :: tmp
    t_0 = y * (1.0d0 - log(y))
    if (y <= 61000000000000.0d0) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else if (y <= 2d+122) then
        tmp = x + t_0
    else
        tmp = t_0 - z
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = y * (1.0 - math.log(y))
	tmp = 0
	if y <= 61000000000000.0:
		tmp = (x - (math.log(y) * 0.5)) - z
	elif y <= 2e+122:
		tmp = x + t_0
	else:
		tmp = t_0 - z
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 - log(y)))
	tmp = 0.0
	if (y <= 61000000000000.0)
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	elseif (y <= 2e+122)
		tmp = Float64(x + t_0);
	else
		tmp = Float64(t_0 - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 - log(y));
	tmp = 0.0;
	if (y <= 61000000000000.0)
		tmp = (x - (log(y) * 0.5)) - z;
	elseif (y <= 2e+122)
		tmp = x + t_0;
	else
		tmp = t_0 - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, 61000000000000.0], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], If[LessEqual[y, 2e+122], N[(x + t$95$0), $MachinePrecision], N[(t$95$0 - z), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < 6.1e13

   1. Initial program 100.0%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]

   2. Taylor expanded in y around 0 99.4%

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

   if 6.1e13 < y < 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. *-commutative 99.8%

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

      5. distribute-rgt-neg-in 99.8%

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

      6. fma-def 99.8%

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

      7. +-commutative 99.8%

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

      8. distribute-neg-in 99.8%

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

      9. unsub-neg 99.8%

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

      10. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in y around inf 79.5%

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

      1. log-rec 79.5%

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

      2. sub-neg 79.5%

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

   6. Simplified 79.5%

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

   if 2.00000000000000003e122 < 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. +-commutative 99.6%

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

      2. associate-+r- 99.6%

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

      3. *-commutative 99.6%

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

   3. Applied egg-rr 99.6%

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

   4. Taylor expanded in y around inf 87.2%

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

      1. sub-neg 87.2%

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

      2. distribute-rgt-in 87.2%

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

      3. log-rec 87.2%

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

      4. mul-1-neg 87.2%

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

      5. remove-double-neg 87.2%

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

      6. distribute-rgt-in 87.3%

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

      7. sub-neg 87.3%

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

   6. Simplified 87.3%

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

4. Final simplification 92.1%

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

Alternative 5: 99.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 0.0145) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else {
		tmp = ((x + y) - (y * 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.0145d0) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else
        tmp = ((x + y) - (y * 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.0145) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else {
		tmp = ((x + y) - (y * Math.log(y))) - z;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 0.0145000000000000007

   1. Initial program 100.0%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]

   2. Taylor expanded in y around 0 99.4%

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

   if 0.0145000000000000007 < y

   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. +-commutative 99.7%

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

      2. associate-+r- 99.7%

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

      3. *-commutative 99.7%

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

   3. Applied egg-rr 99.7%

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

   4. Taylor expanded in y around inf 99.6%

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

      1. mul-1-neg 99.6%

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

      2. log-rec 99.6%

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

      3. distribute-rgt-neg-in 99.6%

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

      4. remove-double-neg 99.6%

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

   6. Simplified 99.6%

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

4. Final simplification 99.5%

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

Alternative 6: 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. Final simplification 99.8%

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

Alternative 7: 69.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -120.0) (not (<= x 2000000.0))) (- x z) (- (* (log y) -0.5) z)))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -120 or 2e6 < 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. +-commutative 99.9%

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

      2. associate-+r- 99.9%

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

      3. *-commutative 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in x around inf 83.9%

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

   if -120 < x < 2e6

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]

   2. Taylor expanded in y around 0 55.8%

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

   3. Taylor expanded in x around 0 54.8%

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

      1. *-commutative 54.8%

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

   5. Simplified 54.8%

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

4. Final simplification 70.7%

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

Alternative 8: 77.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 1.45e13

   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. +-commutative 100.0%

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

      2. associate-+r- 100.0%

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

      3. *-commutative 100.0%

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

   3. Applied egg-rr 100.0%

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

   4. Taylor expanded in x around inf 86.5%

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

   if 1.45e13 < y

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

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

      5. distribute-rgt-neg-in 99.6%

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

      6. fma-def 99.7%

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

      7. +-commutative 99.7%

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

      8. distribute-neg-in 99.7%

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

      9. unsub-neg 99.7%

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

      10. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in y around inf 79.3%

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

      1. log-rec 79.3%

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

      2. sub-neg 79.3%

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

   6. Simplified 79.3%

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

4. Final simplification 83.0%

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

Alternative 9: 48.4% accurate, 18.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -2.3e+56) (not (<= z 5.2e+86))) (- z) x))

C

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -2.3e+56) or not (z <= 5.2e+86):
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -2.3e+56) || ~((z <= 5.2e+86)))
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.30000000000000015e56 or 5.1999999999999995e86 < 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. +-commutative 99.9%

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

      2. associate-+r- 99.9%

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

      3. *-commutative 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in z around inf 65.5%

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

      1. neg-mul-1 65.5%

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

   6. Simplified 65.5%

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

   if -2.30000000000000015e56 < z < 5.1999999999999995e86

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

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

      5. distribute-rgt-neg-in 99.8%

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

      6. fma-def 99.8%

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

      7. +-commutative 99.8%

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

      8. distribute-neg-in 99.8%

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

      9. unsub-neg 99.8%

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

      10. metadata-eval 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in x around inf 48.5%

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

4. Final simplification 55.5%

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

Alternative 10: 57.4% 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. +-commutative 99.8%

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

   2. associate-+r- 99.8%

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

   3. *-commutative 99.8%

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

3. Applied egg-rr 99.8%

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

4. Taylor expanded in x around inf 64.2%

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

5. Final simplification 64.2%

   \[\leadsto x - z \]

Alternative 11: 29.5% 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. *-commutative 99.8%

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

   5. distribute-rgt-neg-in 99.8%

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

   6. fma-def 99.9%

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

   7. +-commutative 99.9%

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

   8. distribute-neg-in 99.9%

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

   9. unsub-neg 99.9%

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

   10. metadata-eval 99.9%

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

3. Simplified 99.9%

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

4. Taylor expanded in x around inf 35.3%

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

5. Final simplification 35.3%

   \[\leadsto x \]

Developer target: 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 2023312 
(FPCore (x y z)
  :name "Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (- (- (+ y x) z) (* (+ y 0.5) (log y)))

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