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

Percentage Accurate: 99.9% → 99.9%

Time: 7.4s

Alternatives: 7

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, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 99.9

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

   6. lift-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lift--.f64 N/A

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

   9. associate-+r- N/A

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

   10. lower--.f64 N/A

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

   11. lower-+.f64 99.9

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

   12. lift-*.f64 N/A

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

   13. *-commutative N/A

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

   14. lower-*.f64 99.9

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

4. Applied rewrites 99.9%

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

Alternative 2: 85.3% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -145000000000.0) (not (<= x 2.3e+19)))
   (fma (- z) y (* 0.5 x))
   (fma (- (log z) z) y y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -145000000000.0) || !(x <= 2.3e+19)) {
		tmp = fma(-z, y, (0.5 * x));
	} else {
		tmp = fma((log(z) - z), y, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -145000000000.0) || !(x <= 2.3e+19))
		tmp = fma(Float64(-z), y, Float64(0.5 * x));
	else
		tmp = fma(Float64(log(z) - z), y, y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -145000000000.0], N[Not[LessEqual[x, 2.3e+19]], $MachinePrecision]], N[((-z) * y + N[(0.5 * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[Log[z], $MachinePrecision] - z), $MachinePrecision] * y + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.45e11 or 2.3e19 < x

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lift--.f64 N/A

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

      9. associate-+r- N/A

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

      10. lower--.f64 N/A

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

      11. lower-+.f64 100.0

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(z\right)}, y, \frac{1}{2} \cdot x\right) \]

      2. lower-neg.f64 92.5

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

   7. Applied rewrites 92.5%

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

   if -1.45e11 < x < 2.3e19

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 85.7

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

   5. Applied rewrites 85.7%

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

4. Final simplification 89.0%

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

Alternative 3: 57.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 #s(literal 1 binary64) z) (log.f64 z)) < -1e114

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 82.5

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

   5. Applied rewrites 82.5%

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

   if -1e114 < (+.f64 (-.f64 #s(literal 1 binary64) z) (log.f64 z))

   1. Initial program 99.8%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. lower--.f64 N/A

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

      10. +-commutative N/A

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

      11. lower-+.f64 N/A

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

      12. lower-log.f64 88.3

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

   5. Applied rewrites 88.3%

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

   6. Taylor expanded in x around inf

      \[\leadsto \frac{1}{2} \cdot x \]
   7. Step-by-step derivation

   8. Applied rewrites 53.3%

      \[\leadsto 0.5 \cdot x \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 98.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 0.0285) {
		tmp = fma(0.5, x, fma(log(z), y, y));
	} else {
		tmp = fma(-z, y, (0.5 * x));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 0.028500000000000001

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. lower-fma.f64 N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-log.f64 99.3

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

   5. Applied rewrites 99.3%

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

   if 0.028500000000000001 < z

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lift--.f64 N/A

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

      9. associate-+r- N/A

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

      10. lower--.f64 N/A

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

      11. lower-+.f64 100.0

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(z\right)}, y, \frac{1}{2} \cdot x\right) \]

      2. lower-neg.f64 99.6

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

   7. Applied rewrites 99.6%

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

Alternative 5: 74.9% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 1.66e-289) (fma (log z) y y) (fma (- z) y (* 0.5 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 1.66e-289) {
		tmp = fma(log(z), y, y);
	} else {
		tmp = fma(-z, y, (0.5 * x));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 1.6600000000000001e-289

   1. Initial program 99.8%

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

   3. Taylor expanded in x around 0

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

      1. associate--l+ N/A

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

      2. +-commutative N/A

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

      3. distribute-rgt-in N/A

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

      4. *-lft-identity N/A

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

      5. lower-fma.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-log.f64 73.5

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

   5. Applied rewrites 73.5%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 73.5%

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

   if 1.6600000000000001e-289 < z

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 99.9

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lift--.f64 N/A

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

      9. associate-+r- N/A

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

      10. lower--.f64 N/A

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

      11. lower-+.f64 99.9

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(z\right)}, y, \frac{1}{2} \cdot x\right) \]

      2. lower-neg.f64 77.4

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

   7. Applied rewrites 77.4%

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

Alternative 6: 74.9% accurate, 8.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 99.9

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

   6. lift-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lift--.f64 N/A

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

   9. associate-+r- N/A

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

   10. lower--.f64 N/A

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

   11. lower-+.f64 99.9

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

   12. lift-*.f64 N/A

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

   13. *-commutative N/A

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

   14. lower-*.f64 99.9

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

4. Applied rewrites 99.9%

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

5. Taylor expanded in z around inf

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

   1. mul-1-neg N/A

      \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{neg}\left(z\right)}, y, \frac{1}{2} \cdot x\right) \]

   2. lower-neg.f64 75.2

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

7. Applied rewrites 75.2%

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

Alternative 7: 40.2% accurate, 20.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. lower-*.f64 N/A

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

   3. +-commutative N/A

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

   4. *-commutative N/A

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

   5. associate-/l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 N/A

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

   9. lower--.f64 N/A

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

   10. +-commutative N/A

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

   11. lower-+.f64 N/A

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

   12. lower-log.f64 86.4

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

5. Applied rewrites 86.4%

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

6. Taylor expanded in x around inf

   \[\leadsto \frac{1}{2} \cdot x \]
7. Step-by-step derivation

8. Applied rewrites 42.5%

   \[\leadsto 0.5 \cdot x \]
9. Add Preprocessing

Developer Target 1: 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 2024337 
(FPCore (x y z)
  :name "System.Random.MWC.Distributions:gamma from mwc-random-0.13.3.2"
  :precision binary64

  :alt
  (! :herbie-platform default (- (+ y (* 1/2 x)) (* y (- z (log z)))))

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