Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, B

Percentage Accurate: 99.9% → 100.0%

Time: 4.5s

Alternatives: 6

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ x - \frac{y}{1 + \frac{x \cdot y}{2}} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))

C

double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x - (y / (1.0d0 + ((x * y) / 2.0d0)))
end function

Java

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

Python

def code(x, y):
	return x - (y / (1.0 + ((x * y) / 2.0)))

Julia

function code(x, y)
	return Float64(x - Float64(y / Float64(1.0 + Float64(Float64(x * y) / 2.0))))
end

MATLAB

function tmp = code(x, y)
	tmp = x - (y / (1.0 + ((x * y) / 2.0)));
end

Wolfram

code[x_, y_] := N[(x - N[(y / N[(1.0 + N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x - \frac{y}{1 + \frac{x \cdot y}{2}} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))

C

double code(double x, double y) {
	return x - (y / (1.0 + ((x * y) / 2.0)));
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x - (y / (1.0d0 + ((x * y) / 2.0d0)))
end function

Java

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

Python

def code(x, y):
	return x - (y / (1.0 + ((x * y) / 2.0)))

Julia

function code(x, y)
	return Float64(x - Float64(y / Float64(1.0 + Float64(Float64(x * y) / 2.0))))
end

MATLAB

function tmp = code(x, y)
	tmp = x - (y / (1.0 + ((x * y) / 2.0)));
end

Wolfram

code[x_, y_] := N[(x - N[(y / N[(1.0 + N[(N[(x * y), $MachinePrecision] / 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- x (/ y (+ 1.0 (/ y (/ 2.0 x))))))

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. associate-/l* 100.0%

      \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

4. Final simplification 100.0%

   \[\leadsto x - \frac{y}{1 + \frac{y}{\frac{2}{x}}} \]

Alternative 2: 85.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-7}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -1.12 \cdot 10^{-89}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-124}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-111}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -5e-7)
   x
   (if (<= x -1.12e-89)
     (/ -2.0 x)
     (if (<= x 3.2e-124)
       (- x y)
       (if (<= x 3.8e-111) (/ -2.0 x) (if (<= x 1.4) (- x y) x))))))

C

double code(double x, double y) {
	double tmp;
	if (x <= -5e-7) {
		tmp = x;
	} else if (x <= -1.12e-89) {
		tmp = -2.0 / x;
	} else if (x <= 3.2e-124) {
		tmp = x - y;
	} else if (x <= 3.8e-111) {
		tmp = -2.0 / x;
	} else if (x <= 1.4) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-5d-7)) then
        tmp = x
    else if (x <= (-1.12d-89)) then
        tmp = (-2.0d0) / x
    else if (x <= 3.2d-124) then
        tmp = x - y
    else if (x <= 3.8d-111) then
        tmp = (-2.0d0) / x
    else if (x <= 1.4d0) then
        tmp = x - y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -5e-7) {
		tmp = x;
	} else if (x <= -1.12e-89) {
		tmp = -2.0 / x;
	} else if (x <= 3.2e-124) {
		tmp = x - y;
	} else if (x <= 3.8e-111) {
		tmp = -2.0 / x;
	} else if (x <= 1.4) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -5e-7:
		tmp = x
	elif x <= -1.12e-89:
		tmp = -2.0 / x
	elif x <= 3.2e-124:
		tmp = x - y
	elif x <= 3.8e-111:
		tmp = -2.0 / x
	elif x <= 1.4:
		tmp = x - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -5e-7)
		tmp = x;
	elseif (x <= -1.12e-89)
		tmp = Float64(-2.0 / x);
	elseif (x <= 3.2e-124)
		tmp = Float64(x - y);
	elseif (x <= 3.8e-111)
		tmp = Float64(-2.0 / x);
	elseif (x <= 1.4)
		tmp = Float64(x - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -5e-7)
		tmp = x;
	elseif (x <= -1.12e-89)
		tmp = -2.0 / x;
	elseif (x <= 3.2e-124)
		tmp = x - y;
	elseif (x <= 3.8e-111)
		tmp = -2.0 / x;
	elseif (x <= 1.4)
		tmp = x - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -5e-7], x, If[LessEqual[x, -1.12e-89], N[(-2.0 / x), $MachinePrecision], If[LessEqual[x, 3.2e-124], N[(x - y), $MachinePrecision], If[LessEqual[x, 3.8e-111], N[(-2.0 / x), $MachinePrecision], If[LessEqual[x, 1.4], N[(x - y), $MachinePrecision], x]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.99999999999999977e-7 or 1.3999999999999999 < x

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in x around inf 99.6%

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

   if -4.99999999999999977e-7 < x < -1.12e-89 or 3.20000000000000004e-124 < x < 3.80000000000000022e-111

   1. Initial program 99.4%

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

      1. *-commutative 99.4%

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

      2. associate-/l* 99.7%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 99.7%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in y around inf 79.7%

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

   5. Taylor expanded in x around 0 79.3%

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

   if -1.12e-89 < x < 3.20000000000000004e-124 or 3.80000000000000022e-111 < x < 1.3999999999999999

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in y around 0 81.1%

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

4. Final simplification 89.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -5 \cdot 10^{-7}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq -1.12 \cdot 10^{-89}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 3.2 \cdot 10^{-124}:\\ \;\;\;\;x - y\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-111}:\\ \;\;\;\;\frac{-2}{x}\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 3: 91.3% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+110} \lor \neg \left(y \leq 5.8 \cdot 10^{+98}\right):\\ \;\;\;\;x - \frac{2}{x}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6e+110) (not (<= y 5.8e+98))) (- x (/ 2.0 x)) (- x y)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6e+110) || !(y <= 5.8e+98)) {
		tmp = x - (2.0 / x);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-6d+110)) .or. (.not. (y <= 5.8d+98))) then
        tmp = x - (2.0d0 / x)
    else
        tmp = x - y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6e+110) || !(y <= 5.8e+98)) {
		tmp = x - (2.0 / x);
	} else {
		tmp = x - y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6e+110) or not (y <= 5.8e+98):
		tmp = x - (2.0 / x)
	else:
		tmp = x - y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6e+110) || !(y <= 5.8e+98))
		tmp = Float64(x - Float64(2.0 / x));
	else
		tmp = Float64(x - y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6e+110) || ~((y <= 5.8e+98)))
		tmp = x - (2.0 / x);
	else
		tmp = x - y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6e+110], N[Not[LessEqual[y, 5.8e+98]], $MachinePrecision]], N[(x - N[(2.0 / x), $MachinePrecision]), $MachinePrecision], N[(x - y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000014e110 or 5.8000000000000002e98 < y

   1. Initial program 99.8%

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

      1. *-commutative 99.8%

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

      2. associate-/l* 99.9%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in y around inf 86.7%

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

   if -6.00000000000000014e110 < y < 5.8000000000000002e98

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in y around 0 95.4%

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

4. Final simplification 92.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+110} \lor \neg \left(y \leq 5.8 \cdot 10^{+98}\right):\\ \;\;\;\;x - \frac{2}{x}\\ \mathbf{else}:\\ \;\;\;\;x - y\\ \end{array} \]

Alternative 4: 86.9% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-7}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -2.2e-7) x (if (<= x 1.4) (- x y) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -2.2e-7) {
		tmp = x;
	} else if (x <= 1.4) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-2.2d-7)) then
        tmp = x
    else if (x <= 1.4d0) then
        tmp = x - y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -2.2e-7) {
		tmp = x;
	} else if (x <= 1.4) {
		tmp = x - y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -2.2e-7:
		tmp = x
	elif x <= 1.4:
		tmp = x - y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -2.2e-7)
		tmp = x;
	elseif (x <= 1.4)
		tmp = Float64(x - y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -2.2e-7)
		tmp = x;
	elseif (x <= 1.4)
		tmp = x - y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -2.2e-7], x, If[LessEqual[x, 1.4], N[(x - y), $MachinePrecision], x]]

Derivation

1. Split input into 2 regimes

2. if x < -2.2000000000000001e-7 or 1.3999999999999999 < x

   1. Initial program 100.0%

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

      1. *-commutative 100.0%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in x around inf 98.8%

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

   if -2.2000000000000001e-7 < x < 1.3999999999999999

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 99.9%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in y around 0 71.1%

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

4. Final simplification 84.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{-7}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.4:\\ \;\;\;\;x - y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 5: 78.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.9 \cdot 10^{-90}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-111}:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.9e-90) x (if (<= x 6.5e-111) (- y) x)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.9e-90) {
		tmp = x;
	} else if (x <= 6.5e-111) {
		tmp = -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-4.9d-90)) then
        tmp = x
    else if (x <= 6.5d-111) then
        tmp = -y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.9e-90) {
		tmp = x;
	} else if (x <= 6.5e-111) {
		tmp = -y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.9e-90:
		tmp = x
	elif x <= 6.5e-111:
		tmp = -y
	else:
		tmp = x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.9e-90)
		tmp = x;
	elseif (x <= 6.5e-111)
		tmp = Float64(-y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.9e-90)
		tmp = x;
	elseif (x <= 6.5e-111)
		tmp = -y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.9e-90], x, If[LessEqual[x, 6.5e-111], (-y), x]]

Derivation

1. Split input into 2 regimes

2. if x < -4.89999999999999982e-90 or 6.49999999999999974e-111 < x

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in x around inf 82.5%

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

   if -4.89999999999999982e-90 < x < 6.49999999999999974e-111

   1. Initial program 99.9%

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

      1. *-commutative 99.9%

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

      2. associate-/l* 100.0%

         \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

   3. Simplified 100.0%

      \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

   4. Taylor expanded in x around 0 67.4%

      \[\leadsto \color{blue}{-1 \cdot y} \]
   5. Step-by-step derivation

      1. neg-mul-1 67.4%

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

   6. Simplified 67.4%

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

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.9 \cdot 10^{-90}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{-111}:\\ \;\;\;\;-y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]

Alternative 6: 62.4% accurate, 11.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 x)

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return x

Julia

function code(x, y)
	return x
end

MATLAB

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

Wolfram

code[x_, y_] := x

Derivation

1. Initial program 99.9%

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

   1. *-commutative 99.9%

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

   2. associate-/l* 100.0%

      \[\leadsto x - \frac{y}{1 + \color{blue}{\frac{y}{\frac{2}{x}}}} \]

3. Simplified 100.0%

   \[\leadsto \color{blue}{x - \frac{y}{1 + \frac{y}{\frac{2}{x}}}} \]

4. Taylor expanded in x around inf 59.7%

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

5. Final simplification 59.7%

   \[\leadsto x \]

Reproduce

herbie shell --seed 2023293 
(FPCore (x y)
  :name "Data.Number.Erf:$cinvnormcdf from erf-2.0.0.0, B"
  :precision binary64
  (- x (/ y (+ 1.0 (/ (* x y) 2.0)))))