Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 14.1s

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} \\ \left(\left(x + y \cdot \left(1 - \log y\right)\right) - \log y \cdot 0.5\right) - z \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(N[(x + N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[Log[y], $MachinePrecision] * 0.5), $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. Taylor expanded in y around 0 99.8%

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

3. Final simplification 99.8%

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

Alternative 2: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. *-commutative 99.8%

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

   2. flip-+ 73.8%

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

   3. associate-*r/ 73.9%

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

   4. fma-neg 73.9%

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

   5. metadata-eval 73.9%

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

   6. metadata-eval 73.9%

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

   7. sub-neg 73.9%

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

   8. metadata-eval 73.9%

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

3. Applied egg-rr 73.9%

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

   1. associate-/l* 73.9%

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

   2. +-commutative 73.9%

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

5. Simplified 73.9%

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

   1. div-inv 73.8%

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

   2. clear-num 73.8%

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

   3. metadata-eval 73.8%

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

   4. metadata-eval 73.8%

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

   5. fma-neg 73.8%

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

   6. metadata-eval 73.8%

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

   7. metadata-eval 73.8%

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

   8. +-commutative 73.8%

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

   9. *-un-lft-identity 73.8%

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

   10. fma-def 73.8%

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

   11. metadata-eval 73.8%

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

   12. fma-neg 73.8%

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

   13. *-un-lft-identity 73.8%

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

   14. flip-+ 99.8%

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

7. Applied egg-rr 99.8%

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

8. Final simplification 99.8%

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

Alternative 3: 90.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 7.5 \cdot 10^{+42}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+107} \lor \neg \left(y \leq 2.2 \cdot 10^{+162}\right):\\ \;\;\;\;\left(y - y \cdot \log y\right) - z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \log y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y 7.5e+42)
   (- (- x (* (log y) 0.5)) z)
   (if (or (<= y 5.8e+107) (not (<= y 2.2e+162)))
     (- (- y (* y (log y))) z)
     (+ x (* y (- 1.0 (log y)))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= 7.5e+42) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else if ((y <= 5.8e+107) || !(y <= 2.2e+162)) {
		tmp = (y - (y * log(y))) - 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 <= 7.5d+42) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else if ((y <= 5.8d+107) .or. (.not. (y <= 2.2d+162))) then
        tmp = (y - (y * log(y))) - 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 <= 7.5e+42) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else if ((y <= 5.8e+107) || !(y <= 2.2e+162)) {
		tmp = (y - (y * Math.log(y))) - z;
	} else {
		tmp = x + (y * (1.0 - Math.log(y)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= 7.5e+42:
		tmp = (x - (math.log(y) * 0.5)) - z
	elif (y <= 5.8e+107) or not (y <= 2.2e+162):
		tmp = (y - (y * math.log(y))) - z
	else:
		tmp = x + (y * (1.0 - math.log(y)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= 7.5e+42)
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	elseif ((y <= 5.8e+107) || !(y <= 2.2e+162))
		tmp = Float64(Float64(y - Float64(y * log(y))) - 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 <= 7.5e+42)
		tmp = (x - (log(y) * 0.5)) - z;
	elseif ((y <= 5.8e+107) || ~((y <= 2.2e+162)))
		tmp = (y - (y * log(y))) - z;
	else
		tmp = x + (y * (1.0 - log(y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 7.5e+42], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], If[Or[LessEqual[y, 5.8e+107], N[Not[LessEqual[y, 2.2e+162]], $MachinePrecision]], N[(N[(y - N[(y * N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], N[(x + N[(y * N[(1.0 - N[Log[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < 7.50000000000000041e42

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 96.0%

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

      1. *-commutative 96.0%

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

   4. Simplified 96.0%

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

   if 7.50000000000000041e42 < y < 5.79999999999999975e107 or 2.2000000000000002e162 < y

   1. Initial program 99.6%

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

   2. Taylor expanded in y around inf 91.0%

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

      1. *-commutative 91.0%

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

      2. log-rec 91.0%

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

      3. distribute-lft-neg-in 91.0%

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

      4. distribute-rgt-neg-in 91.0%

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

   4. Simplified 91.0%

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

   if 5.79999999999999975e107 < y < 2.2000000000000002e162

   1. Initial program 99.4%

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

      1. associate--l+ 99.4%

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

      2. sub-neg 99.4%

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

      3. associate-+l+ 99.4%

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

      4. *-commutative 99.4%

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

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

      6. fma-def 99.5%

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

      7. +-commutative 99.5%

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

      8. distribute-neg-in 99.5%

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

      9. unsub-neg 99.5%

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

      10. metadata-eval 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in y around inf 85.6%

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

      1. log-rec 53.8%

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

      2. sub-neg 53.8%

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

   6. Simplified 85.6%

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

4. Final simplification 93.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 7.5 \cdot 10^{+42}:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{elif}\;y \leq 5.8 \cdot 10^{+107} \lor \neg \left(y \leq 2.2 \cdot 10^{+162}\right):\\ \;\;\;\;\left(y - y \cdot \log y\right) - z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \log y\right)\\ \end{array} \]

Alternative 4: 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 5: 76.8% accurate, 1.0× speedup

Math

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

C

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

Python

def code(x, y, z):
	tmp = 0
	if y <= 1.65e+71:
		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 <= 1.65e+71)
		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 <= 1.65e+71)
		tmp = x - z;
	else
		tmp = x + (y * (1.0 - log(y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 1.65e+71], 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.6499999999999999e71

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 99.9%

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

   3. Taylor expanded in x around inf 74.2%

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

   if 1.6499999999999999e71 < y

   1. Initial program 99.5%

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

      1. associate--l+ 99.5%

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

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

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

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

      6. fma-def 99.5%

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

      7. +-commutative 99.5%

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

      8. distribute-neg-in 99.5%

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

      9. unsub-neg 99.5%

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

      10. metadata-eval 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in y around inf 81.1%

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

      1. log-rec 69.3%

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

      2. sub-neg 69.3%

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

   6. Simplified 81.1%

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

4. Final simplification 76.8%

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

Alternative 6: 89.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

Wolfram

code[x_, y_, z_] := If[LessEqual[y, 1.32e+70], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - 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.3199999999999999e70

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 92.6%

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

      1. *-commutative 92.6%

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

   4. Simplified 92.6%

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

   if 1.3199999999999999e70 < y

   1. Initial program 99.5%

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

      1. associate--l+ 99.5%

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

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

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

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

      6. fma-def 99.5%

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

      7. +-commutative 99.5%

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

      8. distribute-neg-in 99.5%

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

      9. unsub-neg 99.5%

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

      10. metadata-eval 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in y around inf 81.1%

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

      1. log-rec 69.3%

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

      2. sub-neg 69.3%

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

   6. Simplified 81.1%

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

4. Final simplification 88.2%

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

Alternative 7: 71.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 2.40000000000000002e147

   1. Initial program 99.9%

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

   2. Taylor expanded in y around 0 99.9%

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

   3. Taylor expanded in x around inf 71.2%

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

   if 2.40000000000000002e147 < y

   1. Initial program 99.5%

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

   2. Taylor expanded in y around 0 99.5%

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

   3. Taylor expanded in x around 0 92.4%

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

   5. Simplified 92.4%

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

   6. Taylor expanded in y around inf 75.9%

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

      1. log-rec 75.9%

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

      2. sub-neg 75.9%

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

   8. Simplified 75.9%

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

4. Final simplification 72.6%

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

Alternative 8: 45.9% accurate, 18.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{+30}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4 \cdot 10^{+179}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.25e+30) x (if (<= x 1.4e+179) (- z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.25e+30) {
		tmp = x;
	} else if (x <= 1.4e+179) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-1.25d+30)) then
        tmp = x
    else if (x <= 1.4d+179) then
        tmp = -z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.25e+30) {
		tmp = x;
	} else if (x <= 1.4e+179) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.25e+30:
		tmp = x
	elif x <= 1.4e+179:
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.25e+30)
		tmp = x;
	elseif (x <= 1.4e+179)
		tmp = Float64(-z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.25e+30)
		tmp = x;
	elseif (x <= 1.4e+179)
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.25e+30], x, If[LessEqual[x, 1.4e+179], (-z), x]]

Derivation

1. Split input into 2 regimes

2. if x < -1.25e30 or 1.4e179 < x

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

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

   if -1.25e30 < x < 1.4e179

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

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

   3. Taylor expanded in z around inf 43.0%

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

      1. neg-mul-1 43.0%

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

   5. Simplified 43.0%

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

4. Final simplification 50.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.25 \cdot 10^{+30}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4 \cdot 10^{+179}:\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

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. Taylor expanded in y around 0 99.8%

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

3. Taylor expanded in x around inf 57.8%

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

4. Final simplification 57.8%

   \[\leadsto x - z \]

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

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

5. Final simplification 26.5%

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