Statistics.Sample:$swelfordMean from math-functions-0.1.5.2

Percentage Accurate: 100.0% → 100.0%

Time: 5.9s

Alternatives: 7

Speedup: 1.0×

• 21.3% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ x + \frac{y - x}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (/ (- y x) z)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return x + ((y - x) / z)

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y - x) / z))
end

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y - x}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (/ (- y x) z)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return x + ((y - x) / z)

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y - x) / z))
end

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \frac{y - x}{z} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (+ x (/ (- y x) z)))

C

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

Fortran

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

Java

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

Python

def code(x, y, z):
	return x + ((y - x) / z)

Julia

function code(x, y, z)
	return Float64(x + Float64(Float64(y - x) / z))
end

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[x + \frac{y - x}{z} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 62.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{+36}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{-233}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 6 \cdot 10^{-108}:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{+46}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -7e+36)
   x
   (if (<= z 2.65e-233)
     (/ y z)
     (if (<= z 6e-108) (/ x (- z)) (if (<= z 3.6e+46) (/ y z) x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -7e+36) {
		tmp = x;
	} else if (z <= 2.65e-233) {
		tmp = y / z;
	} else if (z <= 6e-108) {
		tmp = x / -z;
	} else if (z <= 3.6e+46) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-7d+36)) then
        tmp = x
    else if (z <= 2.65d-233) then
        tmp = y / z
    else if (z <= 6d-108) then
        tmp = x / -z
    else if (z <= 3.6d+46) then
        tmp = y / z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -7e+36) {
		tmp = x;
	} else if (z <= 2.65e-233) {
		tmp = y / z;
	} else if (z <= 6e-108) {
		tmp = x / -z;
	} else if (z <= 3.6e+46) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -7e+36:
		tmp = x
	elif z <= 2.65e-233:
		tmp = y / z
	elif z <= 6e-108:
		tmp = x / -z
	elif z <= 3.6e+46:
		tmp = y / z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -7e+36)
		tmp = x;
	elseif (z <= 2.65e-233)
		tmp = Float64(y / z);
	elseif (z <= 6e-108)
		tmp = Float64(x / Float64(-z));
	elseif (z <= 3.6e+46)
		tmp = Float64(y / z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -7e+36)
		tmp = x;
	elseif (z <= 2.65e-233)
		tmp = y / z;
	elseif (z <= 6e-108)
		tmp = x / -z;
	elseif (z <= 3.6e+46)
		tmp = y / z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -7e+36], x, If[LessEqual[z, 2.65e-233], N[(y / z), $MachinePrecision], If[LessEqual[z, 6e-108], N[(x / (-z)), $MachinePrecision], If[LessEqual[z, 3.6e+46], N[(y / z), $MachinePrecision], x]]]]

Derivation

1. Split input into 3 regimes

2. if z < -6.9999999999999996e36 or 3.5999999999999999e46 < z

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 100.0%

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

      2. sub-neg 100.0%

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

      3. distribute-frac-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. associate-+r+ 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. sub-neg 100.0%

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

      8. associate--r- 100.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 74.0%

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

   if -6.9999999999999996e36 < z < 2.64999999999999986e-233 or 5.99999999999999986e-108 < z < 3.5999999999999999e46

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 97.6%

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

      2. sub-neg 97.6%

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

      3. distribute-frac-neg 97.6%

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

      4. +-commutative 97.6%

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

      5. associate-+r+ 97.6%

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

      6. distribute-frac-neg 97.6%

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

      7. sub-neg 97.6%

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

      8. associate--r- 97.6%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 58.8%

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

   if 2.64999999999999986e-233 < z < 5.99999999999999986e-108

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 100.0%

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

      2. sub-neg 100.0%

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

      3. distribute-frac-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. associate-+r+ 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. sub-neg 100.0%

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

      8. associate--r- 100.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 69.9%

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

      1. distribute-lft-out-- 69.9%

         \[\leadsto \color{blue}{x \cdot 1 - x \cdot \frac{1}{z}} \]

      2. *-rgt-identity 69.9%

         \[\leadsto \color{blue}{x} - x \cdot \frac{1}{z} \]

      3. associate-*r/ 70.0%

         \[\leadsto x - \color{blue}{\frac{x \cdot 1}{z}} \]

      4. *-rgt-identity 70.0%

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

   7. Simplified 70.0%

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

   8. Taylor expanded in z around 0 70.0%

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

      1. mul-1-neg 70.0%

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

      2. distribute-frac-neg 70.0%

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

   10. Simplified 70.0%

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

4. Final simplification 66.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -7 \cdot 10^{+36}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 2.65 \cdot 10^{-233}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 6 \cdot 10^{-108}:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{elif}\;z \leq 3.6 \cdot 10^{+46}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4.8 \cdot 10^{+32} \lor \neg \left(z \leq 5.7 \cdot 10^{-6}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -4.8e+32) (not (<= z 5.7e-6))) (+ x (/ y z)) (/ (- y x) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4.8e+32) || !(z <= 5.7e-6)) {
		tmp = x + (y / z);
	} else {
		tmp = (y - x) / 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+32)) .or. (.not. (z <= 5.7d-6))) then
        tmp = x + (y / z)
    else
        tmp = (y - x) / z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4.8e+32) || !(z <= 5.7e-6)) {
		tmp = x + (y / z);
	} else {
		tmp = (y - x) / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -4.8e+32) or not (z <= 5.7e-6):
		tmp = x + (y / z)
	else:
		tmp = (y - x) / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -4.8e+32) || !(z <= 5.7e-6))
		tmp = Float64(x + Float64(y / z));
	else
		tmp = Float64(Float64(y - x) / z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -4.8e+32) || ~((z <= 5.7e-6)))
		tmp = x + (y / z);
	else
		tmp = (y - x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -4.8e+32], N[Not[LessEqual[z, 5.7e-6]], $MachinePrecision]], N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision], N[(N[(y - x), $MachinePrecision] / z), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.79999999999999983e32 or 5.6999999999999996e-6 < z

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 100.0%

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

      2. sub-neg 100.0%

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

      3. distribute-frac-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. associate-+r+ 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. sub-neg 100.0%

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

      8. associate--r- 100.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.0%

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

      1. neg-mul-1 99.0%

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

   7. Simplified 99.0%

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

   8. Taylor expanded in x around 0 99.0%

      \[\leadsto \color{blue}{x - -1 \cdot \frac{y}{z}} \]
   9. Step-by-step derivation

      1. cancel-sign-sub-inv 99.0%

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

      2. metadata-eval 99.0%

         \[\leadsto x + \color{blue}{1} \cdot \frac{y}{z} \]

      3. *-lft-identity 99.0%

         \[\leadsto x + \color{blue}{\frac{y}{z}} \]

      4. +-commutative 99.0%

         \[\leadsto \color{blue}{\frac{y}{z} + x} \]

   10. Simplified 99.0%

       \[\leadsto \color{blue}{\frac{y}{z} + x} \]

   if -4.79999999999999983e32 < z < 5.6999999999999996e-6

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 97.8%

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

      2. sub-neg 97.8%

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

      3. distribute-frac-neg 97.8%

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

      4. +-commutative 97.8%

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

      5. associate-+r+ 97.8%

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

      6. distribute-frac-neg 97.8%

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

      7. sub-neg 97.8%

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

      8. associate--r- 97.8%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 99.7%

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

4. Final simplification 99.4%

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

Alternative 4: 87.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-123} \lor \neg \left(y \leq 1.45 \cdot 10^{-28}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{x}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.8e-123) (not (<= y 1.45e-28))) (+ x (/ y z)) (- x (/ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.8e-123) || !(y <= 1.45e-28)) {
		tmp = x + (y / z);
	} else {
		tmp = x - (x / z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((y <= (-2.8d-123)) .or. (.not. (y <= 1.45d-28))) then
        tmp = x + (y / z)
    else
        tmp = x - (x / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.8e-123) || !(y <= 1.45e-28)) {
		tmp = x + (y / z);
	} else {
		tmp = x - (x / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.8e-123) or not (y <= 1.45e-28):
		tmp = x + (y / z)
	else:
		tmp = x - (x / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.8e-123) || !(y <= 1.45e-28))
		tmp = Float64(x + Float64(y / z));
	else
		tmp = Float64(x - Float64(x / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.8e-123) || ~((y <= 1.45e-28)))
		tmp = x + (y / z);
	else
		tmp = x - (x / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.8e-123], N[Not[LessEqual[y, 1.45e-28]], $MachinePrecision]], N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision], N[(x - N[(x / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.7999999999999999e-123 or 1.45000000000000006e-28 < y

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 98.1%

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

      2. sub-neg 98.1%

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

      3. distribute-frac-neg 98.1%

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

      4. +-commutative 98.1%

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

      5. associate-+r+ 98.1%

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

      6. distribute-frac-neg 98.1%

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

      7. sub-neg 98.1%

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

      8. associate--r- 98.1%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 90.0%

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

      1. neg-mul-1 90.0%

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

   7. Simplified 90.0%

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

   8. Taylor expanded in x around 0 90.0%

      \[\leadsto \color{blue}{x - -1 \cdot \frac{y}{z}} \]
   9. Step-by-step derivation

      1. cancel-sign-sub-inv 90.0%

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

      2. metadata-eval 90.0%

         \[\leadsto x + \color{blue}{1} \cdot \frac{y}{z} \]

      3. *-lft-identity 90.0%

         \[\leadsto x + \color{blue}{\frac{y}{z}} \]

      4. +-commutative 90.0%

         \[\leadsto \color{blue}{\frac{y}{z} + x} \]

   10. Simplified 90.0%

       \[\leadsto \color{blue}{\frac{y}{z} + x} \]

   if -2.7999999999999999e-123 < y < 1.45000000000000006e-28

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 100.0%

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

      2. sub-neg 100.0%

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

      3. distribute-frac-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. associate-+r+ 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. sub-neg 100.0%

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

      8. associate--r- 100.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 92.1%

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

      1. distribute-lft-out-- 92.1%

         \[\leadsto \color{blue}{x \cdot 1 - x \cdot \frac{1}{z}} \]

      2. *-rgt-identity 92.1%

         \[\leadsto \color{blue}{x} - x \cdot \frac{1}{z} \]

      3. associate-*r/ 92.2%

         \[\leadsto x - \color{blue}{\frac{x \cdot 1}{z}} \]

      4. *-rgt-identity 92.2%

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

   7. Simplified 92.2%

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

4. Final simplification 90.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{-123} \lor \neg \left(y \leq 1.45 \cdot 10^{-28}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x - \frac{x}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 62.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1 \cdot 10^{+38}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 1.7 \cdot 10^{+46}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -1e+38) x (if (<= z 1.7e+46) (/ y z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -1e+38) {
		tmp = x;
	} else if (z <= 1.7e+46) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-1d+38)) then
        tmp = x
    else if (z <= 1.7d+46) then
        tmp = y / z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -1e+38) {
		tmp = x;
	} else if (z <= 1.7e+46) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -1e+38:
		tmp = x
	elif z <= 1.7e+46:
		tmp = y / z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -1e+38)
		tmp = x;
	elseif (z <= 1.7e+46)
		tmp = Float64(y / z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -1e+38)
		tmp = x;
	elseif (z <= 1.7e+46)
		tmp = y / z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -1e+38], x, If[LessEqual[z, 1.7e+46], N[(y / z), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if z < -9.99999999999999977e37 or 1.6999999999999999e46 < z

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 100.0%

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

      2. sub-neg 100.0%

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

      3. distribute-frac-neg 100.0%

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

      4. +-commutative 100.0%

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

      5. associate-+r+ 100.0%

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

      6. distribute-frac-neg 100.0%

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

      7. sub-neg 100.0%

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

      8. associate--r- 100.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 74.0%

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

   if -9.99999999999999977e37 < z < 1.6999999999999999e46

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 98.0%

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

      2. sub-neg 98.0%

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

      3. distribute-frac-neg 98.0%

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

      4. +-commutative 98.0%

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

      5. associate-+r+ 98.0%

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

      6. distribute-frac-neg 98.0%

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

      7. sub-neg 98.0%

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

      8. associate--r- 98.0%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 54.1%

      \[\leadsto \color{blue}{\frac{y}{z}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 75.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+144}:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.02e+144) (/ x (- z)) (+ x (/ y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.02e+144) {
		tmp = x / -z;
	} else {
		tmp = x + (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 (x <= (-1.02d+144)) then
        tmp = x / -z
    else
        tmp = x + (y / z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.02e+144) {
		tmp = x / -z;
	} else {
		tmp = x + (y / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.02e+144:
		tmp = x / -z
	else:
		tmp = x + (y / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.02e+144)
		tmp = Float64(x / Float64(-z));
	else
		tmp = Float64(x + Float64(y / z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.02e+144)
		tmp = x / -z;
	else
		tmp = x + (y / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.02e+144], N[(x / (-z)), $MachinePrecision], N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.02000000000000008e144

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 95.5%

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

      2. sub-neg 95.5%

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

      3. distribute-frac-neg 95.5%

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

      4. +-commutative 95.5%

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

      5. associate-+r+ 95.5%

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

      6. distribute-frac-neg 95.5%

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

      7. sub-neg 95.5%

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

      8. associate--r- 95.5%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 99.5%

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

      1. distribute-lft-out-- 99.5%

         \[\leadsto \color{blue}{x \cdot 1 - x \cdot \frac{1}{z}} \]

      2. *-rgt-identity 99.5%

         \[\leadsto \color{blue}{x} - x \cdot \frac{1}{z} \]

      3. associate-*r/ 99.5%

         \[\leadsto x - \color{blue}{\frac{x \cdot 1}{z}} \]

      4. *-rgt-identity 99.5%

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

   7. Simplified 99.5%

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

   8. Taylor expanded in z around 0 72.9%

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

      1. mul-1-neg 72.9%

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

      2. distribute-frac-neg 72.9%

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

   10. Simplified 72.9%

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

   if -1.02000000000000008e144 < x

   1. Initial program 100.0%

      \[x + \frac{y - x}{z} \]
   2. Step-by-step derivation

      1. div-sub 99.1%

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

      2. sub-neg 99.1%

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

      3. distribute-frac-neg 99.1%

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

      4. +-commutative 99.1%

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

      5. associate-+r+ 99.1%

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

      6. distribute-frac-neg 99.1%

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

      7. sub-neg 99.1%

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

      8. associate--r- 99.1%

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

      9. div-sub 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 79.4%

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

      1. neg-mul-1 79.4%

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

   7. Simplified 79.4%

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

   8. Taylor expanded in x around 0 79.4%

      \[\leadsto \color{blue}{x - -1 \cdot \frac{y}{z}} \]
   9. Step-by-step derivation

      1. cancel-sign-sub-inv 79.4%

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

      2. metadata-eval 79.4%

         \[\leadsto x + \color{blue}{1} \cdot \frac{y}{z} \]

      3. *-lft-identity 79.4%

         \[\leadsto x + \color{blue}{\frac{y}{z}} \]

      4. +-commutative 79.4%

         \[\leadsto \color{blue}{\frac{y}{z} + x} \]

   10. Simplified 79.4%

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

4. Final simplification 78.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.02 \cdot 10^{+144}:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{else}:\\ \;\;\;\;x + \frac{y}{z}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 36.1% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

   \[x + \frac{y - x}{z} \]
2. Step-by-step derivation

   1. div-sub 98.8%

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

   2. sub-neg 98.8%

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

   3. distribute-frac-neg 98.8%

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

   4. +-commutative 98.8%

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

   5. associate-+r+ 98.8%

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

   6. distribute-frac-neg 98.8%

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

   7. sub-neg 98.8%

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

   8. associate--r- 98.8%

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

   9. div-sub 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{x - \frac{x - y}{z}} \]
4. Add Preprocessing

5. Taylor expanded in z around inf 34.5%

   \[\leadsto \color{blue}{x} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2024116 
(FPCore (x y z)
  :name "Statistics.Sample:$swelfordMean from math-functions-0.1.5.2"
  :precision binary64
  (+ x (/ (- y x) z)))