System.Random.MWC.Distributions:gamma from mwc-random-0.13.3.2

Percentage Accurate: 99.9% → 99.9%

Time: 13.6s

Alternatives: 11

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. +-commutative 99.8%

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

   2. *-commutative 99.8%

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

   3. fma-def 99.9%

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

   4. sub-neg 99.9%

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

   5. associate-+l+ 99.9%

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

   6. +-commutative 99.9%

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

   7. sub-neg 99.9%

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

3. Applied egg-rr 99.9%

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

4. Final simplification 99.9%

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

Alternative 2: 85.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \cdot 0.5 \leq -2 \cdot 10^{-24}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, x \cdot 0.5\right)\\ \mathbf{elif}\;x \cdot 0.5 \leq 10^{-81}:\\ \;\;\;\;y + \left(\log z - z\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.5 - z \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* x 0.5) -2e-24)
   (fma (- z) y (* x 0.5))
   (if (<= (* x 0.5) 1e-81) (+ y (* (- (log z) z) y)) (- (* x 0.5) (* z y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x * 0.5) <= -2e-24) {
		tmp = fma(-z, y, (x * 0.5));
	} else if ((x * 0.5) <= 1e-81) {
		tmp = y + ((log(z) - z) * y);
	} else {
		tmp = (x * 0.5) - (z * y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x * 0.5) <= -2e-24)
		tmp = fma(Float64(-z), y, Float64(x * 0.5));
	elseif (Float64(x * 0.5) <= 1e-81)
		tmp = Float64(y + Float64(Float64(log(z) - z) * y));
	else
		tmp = Float64(Float64(x * 0.5) - Float64(z * y));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 x 1/2) < -1.99999999999999985e-24

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. *-commutative 99.9%

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

      3. fma-def 100.0%

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

      4. sub-neg 100.0%

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

      5. associate-+l+ 100.0%

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

      6. +-commutative 100.0%

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

      7. sub-neg 100.0%

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

   3. Applied egg-rr 100.0%

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

   4. Taylor expanded in z around inf 91.8%

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

      1. mul-1-neg 91.8%

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

   6. Simplified 91.8%

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

   if -1.99999999999999985e-24 < (*.f64 x 1/2) < 9.9999999999999996e-82

   1. Initial program 99.7%

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

      1. sub-neg 99.7%

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

      2. associate-+l+ 99.7%

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

      3. distribute-lft-in 99.7%

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

      4. *-rgt-identity 99.7%

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

      5. associate-+r+ 99.7%

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

      6. fma-def 99.7%

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

      7. +-commutative 99.7%

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

      8. unsub-neg 99.7%

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

   3. Simplified 99.7%

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

   4. Taylor expanded in x around 0 90.5%

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

   if 9.9999999999999996e-82 < (*.f64 x 1/2)

   1. Initial program 100.0%

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

   2. Taylor expanded in z around inf 89.1%

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

      1. mul-1-neg 89.1%

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

      2. distribute-rgt-neg-out 89.1%

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

   4. Simplified 89.1%

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

      1. distribute-rgt-neg-out 89.1%

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

      2. unsub-neg 89.1%

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

   6. Applied egg-rr 89.1%

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

4. Final simplification 90.5%

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

Alternative 3: 75.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 + \log z\right)\\ \mathbf{if}\;z \leq 9 \cdot 10^{-251}:\\ \;\;\;\;x \cdot 0.5 - z \cdot y\\ \mathbf{elif}\;z \leq 5 \cdot 10^{-211}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{-203}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{elif}\;z \leq 3 \cdot 10^{-167}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, x \cdot 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (+ 1.0 (log z)))))
   (if (<= z 9e-251)
     (- (* x 0.5) (* z y))
     (if (<= z 5e-211)
       t_0
       (if (<= z 3.1e-203)
         (* x 0.5)
         (if (<= z 3e-167) t_0 (fma (- z) y (* x 0.5))))))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 + log(z));
	double tmp;
	if (z <= 9e-251) {
		tmp = (x * 0.5) - (z * y);
	} else if (z <= 5e-211) {
		tmp = t_0;
	} else if (z <= 3.1e-203) {
		tmp = x * 0.5;
	} else if (z <= 3e-167) {
		tmp = t_0;
	} else {
		tmp = fma(-z, y, (x * 0.5));
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 + log(z)))
	tmp = 0.0
	if (z <= 9e-251)
		tmp = Float64(Float64(x * 0.5) - Float64(z * y));
	elseif (z <= 5e-211)
		tmp = t_0;
	elseif (z <= 3.1e-203)
		tmp = Float64(x * 0.5);
	elseif (z <= 3e-167)
		tmp = t_0;
	else
		tmp = fma(Float64(-z), y, Float64(x * 0.5));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 + N[Log[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, 9e-251], N[(N[(x * 0.5), $MachinePrecision] - N[(z * y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 5e-211], t$95$0, If[LessEqual[z, 3.1e-203], N[(x * 0.5), $MachinePrecision], If[LessEqual[z, 3e-167], t$95$0, N[((-z) * y + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if z < 8.99999999999999956e-251

   1. Initial program 100.0%

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

   2. Taylor expanded in z around inf 67.9%

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

      1. mul-1-neg 67.9%

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

      2. distribute-rgt-neg-out 67.9%

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

   4. Simplified 67.9%

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

      1. distribute-rgt-neg-out 67.9%

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

      2. unsub-neg 67.9%

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

   6. Applied egg-rr 67.9%

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

   if 8.99999999999999956e-251 < z < 5.0000000000000002e-211 or 3.09999999999999977e-203 < z < 2.9999999999999998e-167

   1. Initial program 99.6%

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

      1. sub-neg 99.6%

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

      2. associate-+l+ 99.6%

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

      3. distribute-lft-in 99.5%

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

      4. *-rgt-identity 99.5%

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

      5. associate-+r+ 99.5%

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

      6. fma-def 99.5%

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

      7. +-commutative 99.5%

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

      8. unsub-neg 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in z around 0 99.5%

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

   5. Taylor expanded in y around inf 86.9%

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

   if 5.0000000000000002e-211 < z < 3.09999999999999977e-203

   1. Initial program 100.0%

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

   2. Taylor expanded in x around inf 100.0%

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

   if 2.9999999999999998e-167 < z

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. *-commutative 99.9%

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

      3. fma-def 99.9%

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

      4. sub-neg 99.9%

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

      5. associate-+l+ 99.9%

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

      6. +-commutative 99.9%

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

      7. sub-neg 99.9%

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

   3. Applied egg-rr 99.9%

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

   4. Taylor expanded in z around inf 84.8%

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

      1. mul-1-neg 84.8%

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

   6. Simplified 84.8%

      \[\leadsto \mathsf{fma}\left(\color{blue}{-z}, y, x \cdot 0.5\right) \]
3. Recombined 4 regimes into one program.

4. Final simplification 84.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 9 \cdot 10^{-251}:\\ \;\;\;\;x \cdot 0.5 - z \cdot y\\ \mathbf{elif}\;z \leq 5 \cdot 10^{-211}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \mathbf{elif}\;z \leq 3.1 \cdot 10^{-203}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{elif}\;z \leq 3 \cdot 10^{-167}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-z, y, x \cdot 0.5\right)\\ \end{array} \]

Alternative 4: 75.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 + \log z\right)\\ t_1 := x \cdot 0.5 - z \cdot y\\ \mathbf{if}\;z \leq 1.1 \cdot 10^{-250}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-211}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-203}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-167}:\\ \;\;\;\;t_0\\ \mathbf{else}:\\ \;\;\;\;t_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (+ 1.0 (log z)))) (t_1 (- (* x 0.5) (* z y))))
   (if (<= z 1.1e-250)
     t_1
     (if (<= z 6.2e-211)
       t_0
       (if (<= z 1.1e-203) (* x 0.5) (if (<= z 6.2e-167) t_0 t_1))))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 + log(z));
	double t_1 = (x * 0.5) - (z * y);
	double tmp;
	if (z <= 1.1e-250) {
		tmp = t_1;
	} else if (z <= 6.2e-211) {
		tmp = t_0;
	} else if (z <= 1.1e-203) {
		tmp = x * 0.5;
	} else if (z <= 6.2e-167) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_0 = y * (1.0d0 + log(z))
    t_1 = (x * 0.5d0) - (z * y)
    if (z <= 1.1d-250) then
        tmp = t_1
    else if (z <= 6.2d-211) then
        tmp = t_0
    else if (z <= 1.1d-203) then
        tmp = x * 0.5d0
    else if (z <= 6.2d-167) then
        tmp = t_0
    else
        tmp = t_1
    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(z));
	double t_1 = (x * 0.5) - (z * y);
	double tmp;
	if (z <= 1.1e-250) {
		tmp = t_1;
	} else if (z <= 6.2e-211) {
		tmp = t_0;
	} else if (z <= 1.1e-203) {
		tmp = x * 0.5;
	} else if (z <= 6.2e-167) {
		tmp = t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = y * (1.0 + math.log(z))
	t_1 = (x * 0.5) - (z * y)
	tmp = 0
	if z <= 1.1e-250:
		tmp = t_1
	elif z <= 6.2e-211:
		tmp = t_0
	elif z <= 1.1e-203:
		tmp = x * 0.5
	elif z <= 6.2e-167:
		tmp = t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(y * Float64(1.0 + log(z)))
	t_1 = Float64(Float64(x * 0.5) - Float64(z * y))
	tmp = 0.0
	if (z <= 1.1e-250)
		tmp = t_1;
	elseif (z <= 6.2e-211)
		tmp = t_0;
	elseif (z <= 1.1e-203)
		tmp = Float64(x * 0.5);
	elseif (z <= 6.2e-167)
		tmp = t_0;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = y * (1.0 + log(z));
	t_1 = (x * 0.5) - (z * y);
	tmp = 0.0;
	if (z <= 1.1e-250)
		tmp = t_1;
	elseif (z <= 6.2e-211)
		tmp = t_0;
	elseif (z <= 1.1e-203)
		tmp = x * 0.5;
	elseif (z <= 6.2e-167)
		tmp = t_0;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(y * N[(1.0 + N[Log[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(x * 0.5), $MachinePrecision] - N[(z * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, 1.1e-250], t$95$1, If[LessEqual[z, 6.2e-211], t$95$0, If[LessEqual[z, 1.1e-203], N[(x * 0.5), $MachinePrecision], If[LessEqual[z, 6.2e-167], t$95$0, t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < 1.1e-250 or 6.2e-167 < z

   1. Initial program 99.9%

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

   2. Taylor expanded in z around inf 83.3%

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

      1. mul-1-neg 83.3%

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

      2. distribute-rgt-neg-out 83.3%

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

   4. Simplified 83.3%

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

      1. distribute-rgt-neg-out 83.3%

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

      2. unsub-neg 83.3%

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

   6. Applied egg-rr 83.3%

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

   if 1.1e-250 < z < 6.1999999999999999e-211 or 1.1e-203 < z < 6.2e-167

   1. Initial program 99.6%

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

      1. sub-neg 99.6%

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

      2. associate-+l+ 99.6%

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

      3. distribute-lft-in 99.5%

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

      4. *-rgt-identity 99.5%

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

      5. associate-+r+ 99.5%

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

      6. fma-def 99.5%

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

      7. +-commutative 99.5%

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

      8. unsub-neg 99.5%

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

   3. Simplified 99.5%

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

   4. Taylor expanded in z around 0 99.5%

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

   5. Taylor expanded in y around inf 86.9%

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

   if 6.1999999999999999e-211 < z < 1.1e-203

   1. Initial program 100.0%

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

   2. Taylor expanded in x around inf 100.0%

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

4. Final simplification 84.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 1.1 \cdot 10^{-250}:\\ \;\;\;\;x \cdot 0.5 - z \cdot y\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-211}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \mathbf{elif}\;z \leq 1.1 \cdot 10^{-203}:\\ \;\;\;\;x \cdot 0.5\\ \mathbf{elif}\;z \leq 6.2 \cdot 10^{-167}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 0.5 - z \cdot y\\ \end{array} \]

Alternative 5: 98.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.3499999999999999e-12

   1. Initial program 99.8%

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

   2. Taylor expanded in z around 0 99.7%

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

   if 1.3499999999999999e-12 < z

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. *-commutative 99.9%

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

      3. fma-def 100.0%

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

      4. sub-neg 100.0%

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

      5. associate-+l+ 100.0%

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

      6. +-commutative 100.0%

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

      7. sub-neg 100.0%

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

   3. Applied egg-rr 100.0%

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

   4. Taylor expanded in z around inf 97.8%

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

      1. mul-1-neg 97.8%

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

   6. Simplified 97.8%

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

4. Final simplification 98.8%

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

Alternative 6: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

   1. sub-neg 99.8%

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

   2. associate-+l+ 99.8%

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

   3. distribute-lft-in 99.8%

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

   4. *-rgt-identity 99.8%

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

   5. associate-+r+ 99.8%

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

   6. fma-def 99.8%

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

   7. +-commutative 99.8%

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

   8. unsub-neg 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in x around 0 99.8%

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

5. Final simplification 99.8%

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

Alternative 7: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

2. Final simplification 99.8%

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

Alternative 8: 75.7% accurate, 15.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.8%

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

2. Taylor expanded in z around inf 73.8%

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

   1. mul-1-neg 73.8%

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

   2. distribute-rgt-neg-out 73.8%

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

4. Simplified 73.8%

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

   1. distribute-rgt-neg-out 73.8%

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

   2. unsub-neg 73.8%

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

6. Applied egg-rr 73.8%

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

7. Final simplification 73.8%

   \[\leadsto x \cdot 0.5 - z \cdot y \]

Alternative 9: 58.2% accurate, 18.3× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (if (<= z 6.2e+105) (* x 0.5) (* z (- y))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 6.2e+105) {
		tmp = x * 0.5;
	} else {
		tmp = z * -y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 6.2e+105:
		tmp = x * 0.5
	else:
		tmp = z * -y
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 6.20000000000000008e105

   1. Initial program 99.8%

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

   2. Taylor expanded in x around inf 50.8%

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

   if 6.20000000000000008e105 < z

   1. Initial program 100.0%

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

      1. +-commutative 100.0%

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

      2. *-commutative 100.0%

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

      3. fma-def 100.0%

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

      4. sub-neg 100.0%

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

      5. associate-+l+ 100.0%

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

      6. +-commutative 100.0%

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

      7. sub-neg 100.0%

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

   3. Applied egg-rr 100.0%

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

   4. Taylor expanded in z around inf 70.5%

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

      1. mul-1-neg 70.5%

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

      2. *-commutative 70.5%

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

      3. distribute-rgt-neg-in 70.5%

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

   6. Simplified 70.5%

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

4. Final simplification 57.2%

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

Alternative 10: 40.7% accurate, 37.0× speedup

Math

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

FPCore

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

C

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

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 * 0.5d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x * 0.5), $MachinePrecision]

Derivation

1. Initial program 99.8%

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

2. Taylor expanded in x around inf 44.2%

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

3. Final simplification 44.2%

   \[\leadsto x \cdot 0.5 \]

Alternative 11: 1.9% accurate, 111.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := y

Derivation

1. Initial program 99.8%

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

   1. sub-neg 99.8%

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

   2. associate-+l+ 99.8%

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

   3. distribute-lft-in 99.8%

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

   4. *-rgt-identity 99.8%

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

   5. associate-+r+ 99.8%

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

   6. fma-def 99.8%

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

   7. +-commutative 99.8%

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

   8. unsub-neg 99.8%

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

3. Simplified 99.8%

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

4. Taylor expanded in x around 0 57.0%

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

5. Taylor expanded in z around 0 27.0%

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

   1. add-cube-cbrt 26.6%

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

   2. pow3 26.6%

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

   3. *-commutative 26.6%

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

7. Applied egg-rr 26.6%

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

8. Taylor expanded in y around 0 1.8%

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

9. Final simplification 1.8%

   \[\leadsto y \]

Developer target: 99.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023187 
(FPCore (x y z)
  :name "System.Random.MWC.Distributions:gamma from mwc-random-0.13.3.2"
  :precision binary64

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

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