Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 11.3s

Alternatives: 10

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

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

Alternative 2: 71.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 6.5 \cdot 10^{+51}:\\ \;\;\;\;\left(x + y\right) - z\\ \mathbf{elif}\;y \leq 5 \cdot 10^{+73} \lor \neg \left(y \leq 8.8 \cdot 10^{+102}\right):\\ \;\;\;\;y - y \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;x - z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 6.5e+51)
   (- (+ x y) z)
   (if (or (<= y 5e+73) (not (<= y 8.8e+102))) (- y (* y (log y))) (- x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 6.5e+51) {
		tmp = (x + y) - z;
	} else if ((y <= 5e+73) || !(y <= 8.8e+102)) {
		tmp = y - (y * log(y));
	} else {
		tmp = x - 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.5d+51) then
        tmp = (x + y) - z
    else if ((y <= 5d+73) .or. (.not. (y <= 8.8d+102))) then
        tmp = y - (y * log(y))
    else
        tmp = x - z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= 6.5e+51) {
		tmp = (x + y) - z;
	} else if ((y <= 5e+73) || !(y <= 8.8e+102)) {
		tmp = y - (y * Math.log(y));
	} else {
		tmp = x - z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 6.5e+51:
		tmp = (x + y) - z
	elif (y <= 5e+73) or not (y <= 8.8e+102):
		tmp = y - (y * math.log(y))
	else:
		tmp = x - z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 6.5e+51)
		tmp = Float64(Float64(x + y) - z);
	elseif ((y <= 5e+73) || !(y <= 8.8e+102))
		tmp = Float64(y - Float64(y * log(y)));
	else
		tmp = Float64(x - z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= 6.5e+51)
		tmp = (x + y) - z;
	elseif ((y <= 5e+73) || ~((y <= 8.8e+102)))
		tmp = y - (y * log(y));
	else
		tmp = x - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 6.5e+51], N[(N[(x + y), $MachinePrecision] - z), $MachinePrecision], If[Or[LessEqual[y, 5e+73], N[Not[LessEqual[y, 8.8e+102]], $MachinePrecision]], N[(y - N[(y * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x - z), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 6.5e51

   1. Initial program 99.9%

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

      1. add-cube-cbrt 98.8%

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

      2. pow3 98.9%

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

      3. sub-neg 98.9%

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

      4. *-commutative 98.9%

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

      5. distribute-rgt-neg-in 98.9%

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

      6. +-commutative 98.9%

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

      7. distribute-neg-in 98.9%

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

      8. metadata-eval 98.9%

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

      9. sub-neg 98.9%

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

   4. Applied egg-rr 98.9%

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

   5. Taylor expanded in x around inf 79.8%

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

   if 6.5e51 < y < 4.99999999999999976e73 or 8.8000000000000003e102 < 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 y around inf 84.3%

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

      1. *-commutative 84.3%

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

      2. log-rec 84.3%

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

      3. distribute-lft-neg-in 84.3%

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

      4. distribute-rgt-neg-in 84.3%

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

   5. Simplified 84.3%

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

   6. Taylor expanded in z around 0 84.3%

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

      1. neg-mul-1 84.3%

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

      2. associate-+r+ 84.3%

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

      3. sub-neg 84.3%

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

      4. neg-mul-1 84.3%

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

      5. sub-neg 84.3%

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

   8. Simplified 84.3%

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

   9. Taylor expanded in z around 0 73.4%

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

   if 4.99999999999999976e73 < y < 8.8000000000000003e102

   1. Initial program 99.9%

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

   3. Taylor expanded in x around -inf 91.1%

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

      1. mul-1-neg 91.1%

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

      2. sub-neg 91.1%

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

      3. associate-/l* 91.1%

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

      4. +-commutative 91.1%

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

      5. metadata-eval 91.1%

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

   5. Simplified 91.1%

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

      1. clear-num 91.1%

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

      2. inv-pow 91.1%

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

   7. Applied egg-rr 91.1%

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

      1. unpow-1 91.1%

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

   9. Simplified 91.1%

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

   10. Taylor expanded in x around inf 82.5%

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

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 6.5 \cdot 10^{+51}:\\ \;\;\;\;\left(x + y\right) - z\\ \mathbf{elif}\;y \leq 5 \cdot 10^{+73} \lor \neg \left(y \leq 8.8 \cdot 10^{+102}\right):\\ \;\;\;\;y - y \cdot \log y\\ \mathbf{else}:\\ \;\;\;\;x - z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 99.2% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 5e-8)
   (- (+ 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 <= 5e-8) {
		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 <= 5d-8) 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 <= 5e-8) {
		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 <= 5e-8:
		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 <= 5e-8)
		tmp = Float64(Float64(x + Float64(log(y) * -0.5)) - z);
	else
		tmp = Float64(x + 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 <= 5e-8)
		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, 5e-8], N[(N[(x + N[(N[Log[y], $MachinePrecision] * -0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(x + N[(N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 4.9999999999999998e-8

   1. Initial program 100.0%

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

      1. associate--l+ 100.0%

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

      2. sub-neg 100.0%

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

      3. associate-+l+ 100.0%

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

      4. associate-+r- 100.0%

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

      5. *-commutative 100.0%

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

      6. distribute-rgt-neg-in 100.0%

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

      7. fma-define 100.0%

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

      8. +-commutative 100.0%

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

      9. distribute-neg-in 100.0%

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

      10. unsub-neg 100.0%

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

      11. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in y around 0 99.3%

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

   if 4.9999999999999998e-8 < 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.5%

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

      2. sub-neg 99.5%

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

      3. associate-+l+ 99.5%

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

      4. associate-+r- 99.6%

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

      5. *-commutative 99.6%

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

      6. distribute-rgt-neg-in 99.6%

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

      7. fma-define 99.7%

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

      8. +-commutative 99.7%

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

      9. distribute-neg-in 99.7%

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

      10. unsub-neg 99.7%

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

      11. metadata-eval 99.7%

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

   3. Simplified 99.7%

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

   5. Taylor expanded in y around inf 99.7%

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

      1. log-rec 99.7%

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

      2. sub-neg 99.7%

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

   7. Simplified 99.7%

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

4. Final simplification 99.5%

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

Alternative 4: 77.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+51}:\\ \;\;\;\;\left(x + y\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 4e+51) (- (+ x y) z) (- (* y (- 1.0 (log y))) z)))

C

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

Python

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

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 4e+51], N[(N[(x + y), $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 < 4e51

   1. Initial program 99.9%

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

      1. add-cube-cbrt 98.8%

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

      2. pow3 98.9%

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

      3. sub-neg 98.9%

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

      4. *-commutative 98.9%

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

      5. distribute-rgt-neg-in 98.9%

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

      6. +-commutative 98.9%

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

      7. distribute-neg-in 98.9%

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

      8. metadata-eval 98.9%

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

      9. sub-neg 98.9%

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

   4. Applied egg-rr 98.9%

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

   5. Taylor expanded in x around inf 79.8%

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

   if 4e51 < 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. Step-by-step derivation

      1. add-cube-cbrt 98.3%

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

      2. pow3 98.3%

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

      3. sub-neg 98.3%

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

      4. *-commutative 98.3%

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

      5. distribute-rgt-neg-in 98.3%

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

      6. +-commutative 98.3%

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

      7. distribute-neg-in 98.3%

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

      8. metadata-eval 98.3%

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

      9. sub-neg 98.3%

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

   4. Applied egg-rr 98.3%

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

   5. Taylor expanded in y around inf 82.4%

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

      1. log-rec 82.4%

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

      2. sub-neg 82.4%

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

   7. Simplified 82.4%

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

4. Final simplification 80.9%

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

Alternative 5: 90.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 5.4 \cdot 10^{+54}:\\ \;\;\;\;\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 5.4e+54) (- (+ 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 <= 5.4e+54) {
		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 <= 5.4d+54) 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 <= 5.4e+54) {
		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 <= 5.4e+54:
		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 <= 5.4e+54)
		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 <= 5.4e+54)
		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, 5.4e+54], 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 < 5.40000000000000022e54

   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 y around 0 95.3%

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

   if 5.40000000000000022e54 < 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. Step-by-step derivation

      1. add-cube-cbrt 98.3%

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

      2. pow3 98.4%

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

      3. sub-neg 98.4%

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

      4. *-commutative 98.4%

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

      5. distribute-rgt-neg-in 98.4%

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

      6. +-commutative 98.4%

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

      7. distribute-neg-in 98.4%

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

      8. metadata-eval 98.4%

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

      9. sub-neg 98.4%

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

   4. Applied egg-rr 98.4%

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

   5. Taylor expanded in y around inf 83.5%

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

      1. log-rec 83.5%

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

      2. sub-neg 83.5%

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

   7. Simplified 83.5%

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

4. Final simplification 90.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 5.4 \cdot 10^{+54}:\\ \;\;\;\;\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: 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.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. Final simplification 99.7%

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

Alternative 7: 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 8: 48.2% accurate, 9.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{+67}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+79}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -3.1e+67) x (if (<= x 8e+79) (- z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.1e+67) {
		tmp = x;
	} else if (x <= 8e+79) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-3.1d+67)) then
        tmp = x
    else if (x <= 8d+79) then
        tmp = -z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -3.1e+67) {
		tmp = x;
	} else if (x <= 8e+79) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -3.1e+67:
		tmp = x
	elif x <= 8e+79:
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -3.1e+67)
		tmp = x;
	elseif (x <= 8e+79)
		tmp = Float64(-z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -3.1e+67)
		tmp = x;
	elseif (x <= 8e+79)
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -3.1e+67], x, If[LessEqual[x, 8e+79], (-z), x]]

Derivation

1. Split input into 2 regimes

2. if x < -3.09999999999999996e67 or 7.99999999999999974e79 < x

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-+l+ 99.9%

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

      4. associate-+r- 99.9%

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

      5. *-commutative 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. fma-define 100.0%

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

      8. +-commutative 100.0%

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

      9. distribute-neg-in 100.0%

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

      10. unsub-neg 100.0%

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

      11. metadata-eval 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in x around inf 67.1%

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

   if -3.09999999999999996e67 < x < 7.99999999999999974e79

   1. Initial program 99.6%

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

   3. Taylor expanded in y around inf 80.6%

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

      1. *-commutative 80.6%

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

      2. log-rec 80.6%

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

      3. distribute-lft-neg-in 80.6%

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

      4. distribute-rgt-neg-in 80.6%

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

   5. Simplified 80.6%

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

   6. Taylor expanded in y around 0 37.8%

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

      1. neg-mul-1 37.8%

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

   8. Simplified 37.8%

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

4. Final simplification 50.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.1 \cdot 10^{+67}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+79}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 58.2% 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. Add Preprocessing

3. Taylor expanded in x around -inf 88.1%

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

   1. mul-1-neg 88.1%

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

   2. sub-neg 88.1%

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

   3. associate-/l* 88.0%

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

   4. +-commutative 88.0%

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

   5. metadata-eval 88.0%

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

5. Simplified 88.0%

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

   1. clear-num 88.0%

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

   2. inv-pow 88.0%

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

7. Applied egg-rr 88.0%

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

   1. unpow-1 88.0%

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

9. Simplified 88.0%

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

10. Taylor expanded in x around inf 59.3%

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

11. Final simplification 59.3%

    \[\leadsto x - z \]
12. Add Preprocessing

Alternative 10: 29.9% 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.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.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 31.9%

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

6. Final simplification 31.9%

   \[\leadsto x \]
7. Add Preprocessing

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

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

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