Numeric.SpecFunctions:stirlingError from math-functions-0.1.5.2

Percentage Accurate: 99.8% → 99.9%

Time: 13.4s

Alternatives: 11

Speedup: 1.0×

• could not determine a ground truth

  1. x = 7.112419605687471e+255
  2. y = 3.640804452630486e+147
  3. z = -6.146515718863213e+257

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x - ((y + 0.5d0) * log(y))) + y) - z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = ((x - ((y + 0.5d0) * log(y))) + y) - z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. associate--l+ 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-+l+ 99.8%

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

   4. associate-+r- 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-def 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: 89.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - \log y\right)\\ \mathbf{if}\;y \leq 550000000:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{elif}\;y \leq 4.9 \cdot 10^{+32} \lor \neg \left(y \leq 7.9 \cdot 10^{+93}\right) \land \left(y \leq 7.4 \cdot 10^{+160} \lor \neg \left(y \leq 7.2 \cdot 10^{+194}\right)\right):\\ \;\;\;\;t\_0 - z\\ \mathbf{else}:\\ \;\;\;\;x + t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 (log y)))))
   (if (<= y 550000000.0)
     (- (- x (* (log y) 0.5)) z)
     (if (or (<= y 4.9e+32)
             (and (not (<= y 7.9e+93))
                  (or (<= y 7.4e+160) (not (<= y 7.2e+194)))))
       (- t_0 z)
       (+ x t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 - log(y));
	double tmp;
	if (y <= 550000000.0) {
		tmp = (x - (log(y) * 0.5)) - z;
	} else if ((y <= 4.9e+32) || (!(y <= 7.9e+93) && ((y <= 7.4e+160) || !(y <= 7.2e+194)))) {
		tmp = t_0 - z;
	} else {
		tmp = x + t_0;
	}
	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 <= 550000000.0d0) then
        tmp = (x - (log(y) * 0.5d0)) - z
    else if ((y <= 4.9d+32) .or. (.not. (y <= 7.9d+93)) .and. (y <= 7.4d+160) .or. (.not. (y <= 7.2d+194))) then
        tmp = t_0 - z
    else
        tmp = x + t_0
    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 <= 550000000.0) {
		tmp = (x - (Math.log(y) * 0.5)) - z;
	} else if ((y <= 4.9e+32) || (!(y <= 7.9e+93) && ((y <= 7.4e+160) || !(y <= 7.2e+194)))) {
		tmp = t_0 - z;
	} else {
		tmp = x + t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (1.0 - math.log(y))
	tmp = 0
	if y <= 550000000.0:
		tmp = (x - (math.log(y) * 0.5)) - z
	elif (y <= 4.9e+32) or (not (y <= 7.9e+93) and ((y <= 7.4e+160) or not (y <= 7.2e+194))):
		tmp = t_0 - z
	else:
		tmp = x + t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 - log(y)))
	tmp = 0.0
	if (y <= 550000000.0)
		tmp = Float64(Float64(x - Float64(log(y) * 0.5)) - z);
	elseif ((y <= 4.9e+32) || (!(y <= 7.9e+93) && ((y <= 7.4e+160) || !(y <= 7.2e+194))))
		tmp = Float64(t_0 - z);
	else
		tmp = Float64(x + t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 - log(y));
	tmp = 0.0;
	if (y <= 550000000.0)
		tmp = (x - (log(y) * 0.5)) - z;
	elseif ((y <= 4.9e+32) || (~((y <= 7.9e+93)) && ((y <= 7.4e+160) || ~((y <= 7.2e+194)))))
		tmp = t_0 - z;
	else
		tmp = x + t_0;
	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, 550000000.0], N[(N[(x - N[(N[Log[y], $MachinePrecision] * 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision], If[Or[LessEqual[y, 4.9e+32], And[N[Not[LessEqual[y, 7.9e+93]], $MachinePrecision], Or[LessEqual[y, 7.4e+160], N[Not[LessEqual[y, 7.2e+194]], $MachinePrecision]]]], N[(t$95$0 - z), $MachinePrecision], N[(x + t$95$0), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if y < 5.5e8

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.6%

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

   if 5.5e8 < y < 4.9000000000000001e32 or 7.8999999999999999e93 < y < 7.40000000000000033e160 or 7.19999999999999999e194 < y

   1. Initial program 99.7%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing
   3. 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 \]

   4. Applied egg-rr 99.7%

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

   5. Taylor expanded in y around inf 89.6%

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

      1. log-rec 89.6%

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

      2. *-commutative 89.6%

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

      3. cancel-sign-sub 89.6%

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

      4. *-commutative 89.6%

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

      5. neg-mul-1 89.6%

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

      6. sub-neg 89.6%

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

   7. Simplified 89.6%

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

   if 4.9000000000000001e32 < y < 7.8999999999999999e93 or 7.40000000000000033e160 < y < 7.19999999999999999e194

   1. Initial program 99.8%

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

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 99.6%

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

      8. +-commutative 99.6%

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

      9. distribute-neg-in 99.6%

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

      10. unsub-neg 99.6%

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

      11. metadata-eval 99.6%

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

   3. Simplified 99.6%

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

   5. Taylor expanded in y around inf 99.6%

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

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

      2. sub-neg 99.6%

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

   7. Simplified 99.6%

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

   8. Taylor expanded in z around 0 84.5%

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

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 550000000:\\ \;\;\;\;\left(x - \log y \cdot 0.5\right) - z\\ \mathbf{elif}\;y \leq 4.9 \cdot 10^{+32} \lor \neg \left(y \leq 7.9 \cdot 10^{+93}\right) \land \left(y \leq 7.4 \cdot 10^{+160} \lor \neg \left(y \leq 7.2 \cdot 10^{+194}\right)\right):\\ \;\;\;\;y \cdot \left(1 - \log y\right) - z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \log y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 76.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7.2 \cdot 10^{+115} \lor \neg \left(z \leq -3.15 \cdot 10^{+59}\right) \land \left(z \leq -1 \cdot 10^{+14} \lor \neg \left(z \leq 1.2 \cdot 10^{+48}\right)\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \log y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -7.2e+115)
         (and (not (<= z -3.15e+59)) (or (<= z -1e+14) (not (<= z 1.2e+48)))))
   (- x z)
   (+ x (* y (- 1.0 (log y))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -7.2e+115) || (!(z <= -3.15e+59) && ((z <= -1e+14) || !(z <= 1.2e+48)))) {
		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 ((z <= (-7.2d+115)) .or. (.not. (z <= (-3.15d+59))) .and. (z <= (-1d+14)) .or. (.not. (z <= 1.2d+48))) 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 ((z <= -7.2e+115) || (!(z <= -3.15e+59) && ((z <= -1e+14) || !(z <= 1.2e+48)))) {
		tmp = x - z;
	} else {
		tmp = x + (y * (1.0 - Math.log(y)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -7.2e+115) or (not (z <= -3.15e+59) and ((z <= -1e+14) or not (z <= 1.2e+48))):
		tmp = x - z
	else:
		tmp = x + (y * (1.0 - math.log(y)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -7.2e+115) || (!(z <= -3.15e+59) && ((z <= -1e+14) || !(z <= 1.2e+48))))
		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 ((z <= -7.2e+115) || (~((z <= -3.15e+59)) && ((z <= -1e+14) || ~((z <= 1.2e+48)))))
		tmp = x - z;
	else
		tmp = x + (y * (1.0 - log(y)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -7.2e+115], And[N[Not[LessEqual[z, -3.15e+59]], $MachinePrecision], Or[LessEqual[z, -1e+14], N[Not[LessEqual[z, 1.2e+48]], $MachinePrecision]]]], 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 z < -7.2000000000000001e115 or -3.15e59 < z < -1e14 or 1.2000000000000001e48 < z

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing
   3. 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 \]

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in x around inf 86.3%

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

   if -7.2000000000000001e115 < z < -3.15e59 or -1e14 < z < 1.2000000000000001e48

   1. Initial program 99.8%

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

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 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 y around inf 85.6%

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

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

      2. sub-neg 85.6%

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

   7. Simplified 85.6%

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

   8. Taylor expanded in z around 0 82.9%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7.2 \cdot 10^{+115} \lor \neg \left(z \leq -3.15 \cdot 10^{+59}\right) \land \left(z \leq -1 \cdot 10^{+14} \lor \neg \left(z \leq 1.2 \cdot 10^{+48}\right)\right):\\ \;\;\;\;x - z\\ \mathbf{else}:\\ \;\;\;\;x + y \cdot \left(1 - \log y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 77.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 - \log y\right)\\ \mathbf{if}\;z \leq -1.55 \cdot 10^{+19} \lor \neg \left(z \leq 1.65 \cdot 10^{+16}\right):\\ \;\;\;\;t\_0 - z\\ \mathbf{else}:\\ \;\;\;\;x + t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (- 1.0 (log y)))))
   (if (or (<= z -1.55e+19) (not (<= z 1.65e+16))) (- t_0 z) (+ x t_0))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 - log(y));
	double tmp;
	if ((z <= -1.55e+19) || !(z <= 1.65e+16)) {
		tmp = t_0 - z;
	} else {
		tmp = x + t_0;
	}
	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 ((z <= (-1.55d+19)) .or. (.not. (z <= 1.65d+16))) then
        tmp = t_0 - z
    else
        tmp = x + t_0
    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 ((z <= -1.55e+19) || !(z <= 1.65e+16)) {
		tmp = t_0 - z;
	} else {
		tmp = x + t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (1.0 - math.log(y))
	tmp = 0
	if (z <= -1.55e+19) or not (z <= 1.65e+16):
		tmp = t_0 - z
	else:
		tmp = x + t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 - log(y)))
	tmp = 0.0
	if ((z <= -1.55e+19) || !(z <= 1.65e+16))
		tmp = Float64(t_0 - z);
	else
		tmp = Float64(x + t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 - log(y));
	tmp = 0.0;
	if ((z <= -1.55e+19) || ~((z <= 1.65e+16)))
		tmp = t_0 - z;
	else
		tmp = x + t_0;
	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[Or[LessEqual[z, -1.55e+19], N[Not[LessEqual[z, 1.65e+16]], $MachinePrecision]], N[(t$95$0 - z), $MachinePrecision], N[(x + t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.55e19 or 1.65e16 < z

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing
   3. 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 \]

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in y around inf 87.8%

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

      1. log-rec 87.8%

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

      2. *-commutative 87.8%

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

      3. cancel-sign-sub 87.8%

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

      4. *-commutative 87.8%

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

      5. neg-mul-1 87.8%

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

      6. sub-neg 87.8%

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

   7. Simplified 87.8%

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

   if -1.55e19 < z < 1.65e16

   1. Initial program 99.8%

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

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 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 y around inf 83.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 83.7%

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

      2. sub-neg 83.7%

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

   7. Simplified 83.7%

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

   8. Taylor expanded in z around 0 82.6%

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

4. Final simplification 85.1%

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

Alternative 5: 69.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -160 \lor \neg \left(x \leq 1.6 \cdot 10^{+22}\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 -160.0) (not (<= x 1.6e+22))) (- x z) (- (* (log y) -0.5) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -160.0) || !(x <= 1.6e+22)) {
		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 <= (-160.0d0)) .or. (.not. (x <= 1.6d+22))) 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 <= -160.0) || !(x <= 1.6e+22)) {
		tmp = x - z;
	} else {
		tmp = (Math.log(y) * -0.5) - z;
	}
	return tmp;
}

Python

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

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -160.0) || !(x <= 1.6e+22))
		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 <= -160.0) || ~((x <= 1.6e+22)))
		tmp = x - z;
	else
		tmp = (log(y) * -0.5) - z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -160.0], N[Not[LessEqual[x, 1.6e+22]], $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 < -160 or 1.6e22 < x

   1. Initial program 99.9%

      \[\left(\left(x - \left(y + 0.5\right) \cdot \log y\right) + y\right) - z \]
   2. Add Preprocessing
   3. 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 \]

   4. Applied egg-rr 99.9%

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

   5. Taylor expanded in x around inf 77.7%

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

   if -160 < x < 1.6e22

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 59.9%

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

   4. Taylor expanded in x around 0 59.9%

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

      1. *-commutative 59.9%

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

   6. Simplified 59.9%

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

4. Final simplification 68.8%

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

Alternative 6: 99.2% accurate, 1.0× speedup

Math

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

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 99.6%

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

   if 1.24999999999999994e-7 < 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.7%

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

      2. sub-neg 99.7%

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

      3. associate-+l+ 99.7%

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

      4. associate-+r- 99.7%

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

      5. *-commutative 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. fma-def 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.4%

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

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

      2. sub-neg 99.4%

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

   7. Simplified 99.4%

      \[\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 1.25 \cdot 10^{-7}:\\ \;\;\;\;\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 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: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

4. Applied egg-rr 99.8%

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

5. Final simplification 99.8%

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

Alternative 9: 47.7% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+116} \lor \neg \left(z \leq -3.2 \cdot 10^{+56}\right) \land \left(z \leq -1.6 \cdot 10^{+31} \lor \neg \left(z \leq 9 \cdot 10^{+15}\right)\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.8e+116)
         (and (not (<= z -3.2e+56)) (or (<= z -1.6e+31) (not (<= z 9e+15)))))
   (- z)
   x))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.8e+116) || (!(z <= -3.2e+56) && ((z <= -1.6e+31) || !(z <= 9e+15)))) {
		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 <= (-1.8d+116)) .or. (.not. (z <= (-3.2d+56))) .and. (z <= (-1.6d+31)) .or. (.not. (z <= 9d+15))) 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 <= -1.8e+116) || (!(z <= -3.2e+56) && ((z <= -1.6e+31) || !(z <= 9e+15)))) {
		tmp = -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.8e+116) or (not (z <= -3.2e+56) and ((z <= -1.6e+31) or not (z <= 9e+15))):
		tmp = -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.8e+116) || (!(z <= -3.2e+56) && ((z <= -1.6e+31) || !(z <= 9e+15))))
		tmp = Float64(-z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.8e+116) || (~((z <= -3.2e+56)) && ((z <= -1.6e+31) || ~((z <= 9e+15)))))
		tmp = -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.8e+116], And[N[Not[LessEqual[z, -3.2e+56]], $MachinePrecision], Or[LessEqual[z, -1.6e+31], N[Not[LessEqual[z, 9e+15]], $MachinePrecision]]]], (-z), x]

Derivation

1. Split input into 2 regimes

2. if z < -1.79999999999999985e116 or -3.20000000000000003e56 < z < -1.6e31 or 9e15 < z

   1. Initial program 99.9%

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

      1. associate--l+ 99.9%

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

      2. sub-neg 99.9%

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

      3. associate-+l+ 99.9%

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

      4. associate-+r- 99.9%

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

      5. *-commutative 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. fma-def 99.9%

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

      8. +-commutative 99.9%

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

      9. distribute-neg-in 99.9%

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

      10. unsub-neg 99.9%

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

      11. metadata-eval 99.9%

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

   3. Simplified 99.9%

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

   5. Taylor expanded in z around inf 74.7%

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

      1. neg-mul-1 74.7%

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

   7. Simplified 74.7%

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

   if -1.79999999999999985e116 < z < -3.20000000000000003e56 or -1.6e31 < z < 9e15

   1. Initial program 99.8%

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

      1. associate--l+ 99.8%

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

      2. sub-neg 99.8%

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

      3. associate-+l+ 99.8%

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

      4. associate-+r- 99.8%

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

      5. *-commutative 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. fma-def 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 41.7%

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

4. Final simplification 55.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.8 \cdot 10^{+116} \lor \neg \left(z \leq -3.2 \cdot 10^{+56}\right) \land \left(z \leq -1.6 \cdot 10^{+31} \lor \neg \left(z \leq 9 \cdot 10^{+15}\right)\right):\\ \;\;\;\;-z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 57.6% 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. 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 \]

4. Applied egg-rr 99.8%

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

5. Taylor expanded in x around inf 60.2%

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

6. Final simplification 60.2%

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

Alternative 11: 29.4% accurate, 111.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.8%

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

   1. associate--l+ 99.8%

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

   2. sub-neg 99.8%

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

   3. associate-+l+ 99.8%

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

   4. associate-+r- 99.8%

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

   5. *-commutative 99.8%

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

   6. distribute-rgt-neg-in 99.8%

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

   7. fma-def 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 28.5%

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

6. Final simplification 28.5%

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