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

Percentage Accurate: 100.0% → 100.0%

Time: 6.6s

Alternatives: 7

Speedup: 1.0×

• 20.9% 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.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+43}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 1.18 \cdot 10^{-200}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -6.6e+43)
   x
   (if (<= z 1.18e-200) (/ y z) (if (<= z 1.0) (/ x (- z)) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -6.6e+43) {
		tmp = x;
	} else if (z <= 1.18e-200) {
		tmp = y / z;
	} else if (z <= 1.0) {
		tmp = x / -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 <= (-6.6d+43)) then
        tmp = x
    else if (z <= 1.18d-200) then
        tmp = y / z
    else if (z <= 1.0d0) then
        tmp = x / -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 <= -6.6e+43) {
		tmp = x;
	} else if (z <= 1.18e-200) {
		tmp = y / z;
	} else if (z <= 1.0) {
		tmp = x / -z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -6.6e+43:
		tmp = x
	elif z <= 1.18e-200:
		tmp = y / z
	elif z <= 1.0:
		tmp = x / -z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -6.6e+43)
		tmp = x;
	elseif (z <= 1.18e-200)
		tmp = Float64(y / z);
	elseif (z <= 1.0)
		tmp = Float64(x / Float64(-z));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -6.6e+43)
		tmp = x;
	elseif (z <= 1.18e-200)
		tmp = y / z;
	elseif (z <= 1.0)
		tmp = x / -z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -6.6e+43], x, If[LessEqual[z, 1.18e-200], N[(y / z), $MachinePrecision], If[LessEqual[z, 1.0], N[(x / (-z)), $MachinePrecision], x]]]

Derivation

1. Split input into 3 regimes

2. if z < -6.6000000000000003e43 or 1 < 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 68.4%

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

   if -6.6000000000000003e43 < z < 1.17999999999999996e-200

   1. Initial program 100.0%

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

      1. div-sub 95.3%

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

      2. sub-neg 95.3%

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

      3. distribute-frac-neg 95.3%

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

      4. +-commutative 95.3%

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

      5. associate-+r+ 95.3%

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

      6. distribute-frac-neg 95.3%

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

      7. sub-neg 95.3%

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

      8. associate--r- 95.3%

         \[\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 62.0%

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

   if 1.17999999999999996e-200 < z < 1

   1. Initial program 100.0%

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

      1. div-sub 95.9%

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

      2. sub-neg 95.9%

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

      3. distribute-frac-neg 95.9%

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

      4. +-commutative 95.9%

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

      5. associate-+r+ 95.9%

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

      6. distribute-frac-neg 95.9%

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

      7. sub-neg 95.9%

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

      8. associate--r- 95.9%

         \[\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 57.9%

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

      1. distribute-lft-out-- 57.9%

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

      2. *-rgt-identity 57.9%

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

      3. associate-*r/ 58.2%

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

      4. *-rgt-identity 58.2%

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

   7. Simplified 58.2%

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

   8. Taylor expanded in z around 0 57.8%

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

      1. mul-1-neg 57.8%

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

      2. distribute-frac-neg 57.8%

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

   10. Simplified 57.8%

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

4. Final simplification 64.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -6.6 \cdot 10^{+43}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 1.18 \cdot 10^{-200}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;\frac{x}{-z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -13.5 \lor \neg \left(z \leq 10^{-8}\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 -13.5) (not (<= z 1e-8))) (+ x (/ y z)) (/ (- y x) z)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -13.5) || !(z <= 1e-8)) {
		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 <= (-13.5d0)) .or. (.not. (z <= 1d-8))) 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 <= -13.5) || !(z <= 1e-8)) {
		tmp = x + (y / z);
	} else {
		tmp = (y - x) / z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -13.5) or not (z <= 1e-8):
		tmp = x + (y / z)
	else:
		tmp = (y - x) / z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -13.5) || !(z <= 1e-8))
		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 <= -13.5) || ~((z <= 1e-8)))
		tmp = x + (y / z);
	else
		tmp = (y - x) / z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -13.5], N[Not[LessEqual[z, 1e-8]], $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 < -13.5 or 1e-8 < 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 97.6%

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

      1. neg-mul-1 97.6%

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

   7. Simplified 97.6%

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

   8. Taylor expanded in x around 0 97.6%

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

      1. cancel-sign-sub-inv 97.6%

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

      2. metadata-eval 97.6%

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

      3. *-lft-identity 97.6%

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

      4. +-commutative 97.6%

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

   10. Simplified 97.6%

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

   if -13.5 < z < 1e-8

   1. Initial program 100.0%

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

      1. div-sub 95.4%

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

      2. sub-neg 95.4%

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

      3. distribute-frac-neg 95.4%

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

      4. +-commutative 95.4%

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

      5. associate-+r+ 95.4%

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

      6. distribute-frac-neg 95.4%

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

      7. sub-neg 95.4%

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

      8. associate--r- 95.4%

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

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

4. Final simplification 98.4%

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

Alternative 4: 86.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.7 \cdot 10^{-36} \lor \neg \left(y \leq 2700000\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.7e-36) (not (<= y 2700000.0))) (+ x (/ y z)) (- x (/ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.7e-36) || !(y <= 2700000.0)) {
		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.7d-36)) .or. (.not. (y <= 2700000.0d0))) 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.7e-36) || !(y <= 2700000.0)) {
		tmp = x + (y / z);
	} else {
		tmp = x - (x / z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.7e-36) or not (y <= 2700000.0):
		tmp = x + (y / z)
	else:
		tmp = x - (x / z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.7e-36) || !(y <= 2700000.0))
		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.7e-36) || ~((y <= 2700000.0)))
		tmp = x + (y / z);
	else
		tmp = x - (x / z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.7e-36], N[Not[LessEqual[y, 2700000.0]], $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.70000000000000007e-36 or 2.7e6 < y

   1. Initial program 100.0%

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

      1. div-sub 95.3%

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

      2. sub-neg 95.3%

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

      3. distribute-frac-neg 95.3%

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

      4. +-commutative 95.3%

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

      5. associate-+r+ 95.3%

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

      6. distribute-frac-neg 95.3%

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

      7. sub-neg 95.3%

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

      8. associate--r- 95.3%

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

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

      1. neg-mul-1 90.1%

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

   7. Simplified 90.1%

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

   8. Taylor expanded in x around 0 90.1%

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

      1. cancel-sign-sub-inv 90.1%

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

      2. metadata-eval 90.1%

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

      3. *-lft-identity 90.1%

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

      4. +-commutative 90.1%

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

   10. Simplified 90.1%

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

   if -2.70000000000000007e-36 < y < 2.7e6

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

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

      1. distribute-lft-out-- 86.2%

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

      2. *-rgt-identity 86.2%

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

      3. associate-*r/ 86.3%

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

      4. *-rgt-identity 86.3%

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

   7. Simplified 86.3%

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

4. Final simplification 88.2%

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

Alternative 5: 74.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 9.6 \cdot 10^{+152} \lor \neg \left(x \leq 2.7 \cdot 10^{+234}\right):\\ \;\;\;\;x + \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{-z}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x 9.6e+152) (not (<= x 2.7e+234))) (+ x (/ y z)) (/ x (- z))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= 9.6e+152) || !(x <= 2.7e+234)) {
		tmp = x + (y / z);
	} else {
		tmp = x / -z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= 9.6e+152) or not (x <= 2.7e+234):
		tmp = x + (y / z)
	else:
		tmp = x / -z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= 9.6e+152) || !(x <= 2.7e+234))
		tmp = Float64(x + Float64(y / z));
	else
		tmp = Float64(x / Float64(-z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= 9.6e+152) || ~((x <= 2.7e+234)))
		tmp = x + (y / z);
	else
		tmp = x / -z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, 9.6e+152], N[Not[LessEqual[x, 2.7e+234]], $MachinePrecision]], N[(x + N[(y / z), $MachinePrecision]), $MachinePrecision], N[(x / (-z)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 9.5999999999999997e152 or 2.7000000000000002e234 < x

   1. Initial program 100.0%

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

      1. div-sub 97.9%

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

      2. sub-neg 97.9%

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

      3. distribute-frac-neg 97.9%

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

      4. +-commutative 97.9%

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

      5. associate-+r+ 97.9%

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

      6. distribute-frac-neg 97.9%

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

      7. sub-neg 97.9%

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

      8. associate--r- 97.9%

         \[\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 80.7%

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

      1. neg-mul-1 80.7%

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

   7. Simplified 80.7%

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

   8. Taylor expanded in x around 0 80.7%

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

      1. cancel-sign-sub-inv 80.7%

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

      2. metadata-eval 80.7%

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

      3. *-lft-identity 80.7%

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

      4. +-commutative 80.7%

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

   10. Simplified 80.7%

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

   if 9.5999999999999997e152 < x < 2.7000000000000002e234

   1. Initial program 100.0%

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

      1. div-sub 95.2%

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

      2. sub-neg 95.2%

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

      3. distribute-frac-neg 95.2%

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

      4. +-commutative 95.2%

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

      5. associate-+r+ 95.2%

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

      6. distribute-frac-neg 95.2%

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

      7. sub-neg 95.2%

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

      8. associate--r- 95.2%

         \[\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 89.2%

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

      1. distribute-lft-out-- 89.2%

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

      2. *-rgt-identity 89.2%

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

      3. associate-*r/ 89.4%

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

      4. *-rgt-identity 89.4%

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

   7. Simplified 89.4%

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

   8. Taylor expanded in z around 0 78.0%

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

      1. mul-1-neg 78.0%

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

      2. distribute-frac-neg 78.0%

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

   10. Simplified 78.0%

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

4. Final simplification 80.4%

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

Alternative 6: 62.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5.8 \cdot 10^{+43}:\\ \;\;\;\;x\\ \mathbf{elif}\;z \leq 8.6 \cdot 10^{+22}:\\ \;\;\;\;\frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -5.8e+43) x (if (<= z 8.6e+22) (/ y z) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -5.8e+43) {
		tmp = x;
	} else if (z <= 8.6e+22) {
		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 <= (-5.8d+43)) then
        tmp = x
    else if (z <= 8.6d+22) 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 <= -5.8e+43) {
		tmp = x;
	} else if (z <= 8.6e+22) {
		tmp = y / z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -5.8e+43:
		tmp = x
	elif z <= 8.6e+22:
		tmp = y / z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -5.8e+43)
		tmp = x;
	elseif (z <= 8.6e+22)
		tmp = Float64(y / z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -5.8e+43)
		tmp = x;
	elseif (z <= 8.6e+22)
		tmp = y / z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -5.8e+43], x, If[LessEqual[z, 8.6e+22], N[(y / z), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if z < -5.8000000000000004e43 or 8.6000000000000004e22 < 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 70.7%

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

   if -5.8000000000000004e43 < z < 8.6000000000000004e22

   1. Initial program 100.0%

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

      1. div-sub 95.7%

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

      2. sub-neg 95.7%

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

      3. distribute-frac-neg 95.7%

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

      4. +-commutative 95.7%

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

      5. associate-+r+ 95.7%

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

      6. distribute-frac-neg 95.7%

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

      7. sub-neg 95.7%

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

      8. associate--r- 95.7%

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

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

Alternative 7: 36.6% 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 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 z around inf 34.2%

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

Reproduce

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