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

Percentage Accurate: 99.9% → 99.9%

Time: 8.7s

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

code[x_, y_, z_] := N[(y * N[(N[(1.0 - z), $MachinePrecision] + N[Log[z], $MachinePrecision]), $MachinePrecision] + 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-def 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. Final simplification 99.9%

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

Alternative 2: 74.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \left(1 + \log z\right)\\ t_1 := x \cdot 0.5 - y \cdot z\\ \mathbf{if}\;z \leq 7.6 \cdot 10^{-172}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{-88}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 10^{-39}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-12}:\\ \;\;\;\;t\_0\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y, -z, x \cdot 0.5\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* y (+ 1.0 (log z)))) (t_1 (- (* x 0.5) (* y z))))
   (if (<= z 7.6e-172)
     t_1
     (if (<= z 2.25e-88)
       t_0
       (if (<= z 1e-39)
         t_1
         (if (<= z 4.5e-12) t_0 (fma y (- z) (* x 0.5))))))))

C

double code(double x, double y, double z) {
	double t_0 = y * (1.0 + log(z));
	double t_1 = (x * 0.5) - (y * z);
	double tmp;
	if (z <= 7.6e-172) {
		tmp = t_1;
	} else if (z <= 2.25e-88) {
		tmp = t_0;
	} else if (z <= 1e-39) {
		tmp = t_1;
	} else if (z <= 4.5e-12) {
		tmp = t_0;
	} else {
		tmp = fma(y, -z, (x * 0.5));
	}
	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(y * z))
	tmp = 0.0
	if (z <= 7.6e-172)
		tmp = t_1;
	elseif (z <= 2.25e-88)
		tmp = t_0;
	elseif (z <= 1e-39)
		tmp = t_1;
	elseif (z <= 4.5e-12)
		tmp = t_0;
	else
		tmp = fma(y, Float64(-z), 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]}, Block[{t$95$1 = N[(N[(x * 0.5), $MachinePrecision] - N[(y * z), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, 7.6e-172], t$95$1, If[LessEqual[z, 2.25e-88], t$95$0, If[LessEqual[z, 1e-39], t$95$1, If[LessEqual[z, 4.5e-12], t$95$0, N[(y * (-z) + N[(x * 0.5), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if z < 7.59999999999999974e-172 or 2.24999999999999996e-88 < z < 9.99999999999999929e-40

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

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

      1. mul-1-neg 68.1%

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

      2. *-commutative 68.1%

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

      3. distribute-rgt-neg-in 68.1%

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

   5. Simplified 68.1%

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

      1. distribute-rgt-neg-out 68.1%

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

      2. unsub-neg 68.1%

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

   7. Applied egg-rr 68.1%

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

   if 7.59999999999999974e-172 < z < 2.24999999999999996e-88 or 9.99999999999999929e-40 < z < 4.49999999999999981e-12

   1. Initial program 99.7%

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

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

   4. Taylor expanded in x around 0 73.6%

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

   if 4.49999999999999981e-12 < 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-def 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 97.6%

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

      1. mul-1-neg 97.6%

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

   7. Simplified 97.6%

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

4. Final simplification 84.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 7.6 \cdot 10^{-172}:\\ \;\;\;\;x \cdot 0.5 - y \cdot z\\ \mathbf{elif}\;z \leq 2.25 \cdot 10^{-88}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \mathbf{elif}\;z \leq 10^{-39}:\\ \;\;\;\;x \cdot 0.5 - y \cdot z\\ \mathbf{elif}\;z \leq 4.5 \cdot 10^{-12}:\\ \;\;\;\;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 3: 74.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 4 \cdot 10^{-167} \lor \neg \left(z \leq 1.35 \cdot 10^{-88}\right) \land \left(z \leq 4.5 \cdot 10^{-39} \lor \neg \left(z \leq 4.5 \cdot 10^{-12}\right)\right):\\ \;\;\;\;x \cdot 0.5 - y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z 4e-167)
         (and (not (<= z 1.35e-88)) (or (<= z 4.5e-39) (not (<= z 4.5e-12)))))
   (- (* x 0.5) (* y z))
   (* y (+ 1.0 (log z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= 4e-167) || (!(z <= 1.35e-88) && ((z <= 4.5e-39) || !(z <= 4.5e-12)))) {
		tmp = (x * 0.5) - (y * z);
	} else {
		tmp = y * (1.0 + log(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 <= 4d-167) .or. (.not. (z <= 1.35d-88)) .and. (z <= 4.5d-39) .or. (.not. (z <= 4.5d-12))) then
        tmp = (x * 0.5d0) - (y * z)
    else
        tmp = y * (1.0d0 + log(z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= 4e-167) || (!(z <= 1.35e-88) && ((z <= 4.5e-39) || !(z <= 4.5e-12)))) {
		tmp = (x * 0.5) - (y * z);
	} else {
		tmp = y * (1.0 + Math.log(z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= 4e-167) or (not (z <= 1.35e-88) and ((z <= 4.5e-39) or not (z <= 4.5e-12))):
		tmp = (x * 0.5) - (y * z)
	else:
		tmp = y * (1.0 + math.log(z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= 4e-167) || (!(z <= 1.35e-88) && ((z <= 4.5e-39) || !(z <= 4.5e-12))))
		tmp = Float64(Float64(x * 0.5) - Float64(y * z));
	else
		tmp = Float64(y * Float64(1.0 + log(z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= 4e-167) || (~((z <= 1.35e-88)) && ((z <= 4.5e-39) || ~((z <= 4.5e-12)))))
		tmp = (x * 0.5) - (y * z);
	else
		tmp = y * (1.0 + log(z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, 4e-167], And[N[Not[LessEqual[z, 1.35e-88]], $MachinePrecision], Or[LessEqual[z, 4.5e-39], N[Not[LessEqual[z, 4.5e-12]], $MachinePrecision]]]], N[(N[(x * 0.5), $MachinePrecision] - N[(y * z), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 + N[Log[z], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 4.00000000000000001e-167 or 1.34999999999999997e-88 < z < 4.5000000000000001e-39 or 4.49999999999999981e-12 < z

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

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

      1. mul-1-neg 86.2%

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

      2. *-commutative 86.2%

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

      3. distribute-rgt-neg-in 86.2%

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

   5. Simplified 86.2%

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

      1. distribute-rgt-neg-out 86.2%

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

      2. unsub-neg 86.2%

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

   7. Applied egg-rr 86.2%

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

   if 4.00000000000000001e-167 < z < 1.34999999999999997e-88 or 4.5000000000000001e-39 < z < 4.49999999999999981e-12

   1. Initial program 99.7%

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

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

   4. Taylor expanded in x around 0 73.6%

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

4. Final simplification 84.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq 4 \cdot 10^{-167} \lor \neg \left(z \leq 1.35 \cdot 10^{-88}\right) \land \left(z \leq 4.5 \cdot 10^{-39} \lor \neg \left(z \leq 4.5 \cdot 10^{-12}\right)\right):\\ \;\;\;\;x \cdot 0.5 - y \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 + \log z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 0.00075:\\ \;\;\;\;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.00075)
   (+ (* 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.00075) {
		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.00075)
		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.00075], 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 < 7.5000000000000002e-4

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

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

   if 7.5000000000000002e-4 < 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-def 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 98.2%

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

      1. mul-1-neg 98.2%

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

   7. Simplified 98.2%

      \[\leadsto \mathsf{fma}\left(y, \color{blue}{-z}, 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 0.00075:\\ \;\;\;\;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 5: 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]

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(\left(1 - z\right) + \log z\right) \]
4. Add Preprocessing

Alternative 6: 74.3% 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 76.7%

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

   1. mul-1-neg 76.7%

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

   2. *-commutative 76.7%

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

   3. distribute-rgt-neg-in 76.7%

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

5. Simplified 76.7%

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

   1. distribute-rgt-neg-out 76.7%

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

   2. unsub-neg 76.7%

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

7. Applied egg-rr 76.7%

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

8. Final simplification 76.7%

   \[\leadsto x \cdot 0.5 - y \cdot z \]
9. Add Preprocessing

Alternative 7: 39.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.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 42.8%

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

4. Final simplification 42.8%

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

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 2024027 
(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)))))