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

Percentage Accurate: 99.9% → 99.6%

Time: 10.7s

Alternatives: 8

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.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   1. mul-1-neg 99.9%

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

5. Applied egg-rr 99.9%

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

   1. +-commutative 99.9%

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

   2. *-commutative 99.9%

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

   3. add-sqr-sqrt 51.5%

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

   4. unpow2 51.5%

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

   5. unsub-neg 51.5%

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

   6. unpow2 51.5%

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

   7. add-sqr-sqrt 99.9%

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

   8. *-commutative 99.9%

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

7. Applied egg-rr 99.9%

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

Alternative 2: 86.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* x 0.5) -2e-82)
   (fma y (- z) (* x 0.5))
   (if (<= (* x 0.5) 4e-28)
     (* y (- (+ 1.0 (log z)) z))
     (- (* x 0.5) (* y z)))))

C

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

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x * 0.5) <= -2e-82)
		tmp = fma(y, Float64(-z), Float64(x * 0.5));
	elseif (Float64(x * 0.5) <= 4e-28)
		tmp = Float64(y * Float64(Float64(1.0 + log(z)) - z));
	else
		tmp = Float64(Float64(x * 0.5) - Float64(y * z));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 x #s(literal 1/2 binary64)) < -2e-82

   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. fma-define 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around inf 87.9%

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

      1. neg-mul-1 87.9%

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

   7. Simplified 87.9%

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

   if -2e-82 < (*.f64 x #s(literal 1/2 binary64)) < 3.99999999999999988e-28

   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 y around inf 99.8%

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

   4. Taylor expanded in x around 0 87.1%

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

   if 3.99999999999999988e-28 < (*.f64 x #s(literal 1/2 binary64))

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

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

      1. associate-*r* 98.3%

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

      2. neg-mul-1 98.3%

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

   5. Simplified 98.3%

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

      1. fma-define 98.3%

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

      2. distribute-lft-neg-out 98.3%

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

      3. fmm-undef 98.3%

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

   7. Applied egg-rr 98.3%

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

Alternative 3: 98.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 0.28000000000000003

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

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

      1. *-commutative 98.8%

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

   5. Simplified 98.8%

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

   if 0.28000000000000003 < 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. fma-define 100.0%

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

   3. Simplified 100.0%

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

   5. Taylor expanded in z around inf 99.3%

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

      1. neg-mul-1 99.3%

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

   7. Simplified 99.3%

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

4. Final simplification 99.0%

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

Alternative 4: 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.9%

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

3. Final simplification 99.9%

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

Alternative 5: 75.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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. fma-define 99.9%

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

3. Simplified 99.9%

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

5. Taylor expanded in z around inf 78.3%

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

   1. neg-mul-1 78.3%

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

7. Simplified 78.3%

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

Alternative 6: 60.5% accurate, 12.3× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 4.8e53

   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 inf 61.8%

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

      1. associate-*r* 61.8%

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

      2. neg-mul-1 61.8%

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

   5. Simplified 61.8%

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

   6. Taylor expanded in x around inf 56.2%

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

   if 4.8e53 < z

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

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

      1. associate-*r* 100.0%

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

      2. neg-mul-1 100.0%

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

   5. Simplified 100.0%

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

   6. Taylor expanded in x around 0 76.1%

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

      1. neg-mul-1 76.1%

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

      2. distribute-lft-neg-in 76.1%

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

      3. *-commutative 76.1%

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

   8. Simplified 76.1%

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

4. Final simplification 64.8%

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

Alternative 7: 75.2% accurate, 15.9× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

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

   1. associate-*r* 78.3%

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

   2. neg-mul-1 78.3%

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

5. Simplified 78.3%

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

   1. fma-define 78.3%

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

   2. distribute-lft-neg-out 78.3%

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

   3. fmm-undef 78.3%

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

7. Applied egg-rr 78.3%

   \[\leadsto \color{blue}{x \cdot 0.5 - y \cdot z} \]
8. Add Preprocessing

Alternative 8: 40.1% 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.9%

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

3. Taylor expanded in z around inf 78.3%

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

   1. associate-*r* 78.3%

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

   2. neg-mul-1 78.3%

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

5. Simplified 78.3%

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

6. Taylor expanded in x around inf 42.8%

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

7. Final simplification 42.8%

   \[\leadsto x \cdot 0.5 \]
8. 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 2024165 
(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)))))