Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, E

Percentage Accurate: 99.9% → 99.9%

Time: 6.6s

Alternatives: 7

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return (1.0 - x) + (y * math.sqrt(x))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Final simplification 99.9%

   \[\leadsto \left(1 - x\right) + y \cdot \sqrt{x} \]
4. Add Preprocessing

Alternative 2: 94.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+70} \lor \neg \left(y \leq 1.02 \cdot 10^{+14}\right):\\ \;\;\;\;1 + y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -6.8e+70) (not (<= y 1.02e+14)))
   (+ 1.0 (* y (sqrt x)))
   (- 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e+70) || !(y <= 1.02e+14)) {
		tmp = 1.0 + (y * sqrt(x));
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-6.8d+70)) .or. (.not. (y <= 1.02d+14))) then
        tmp = 1.0d0 + (y * sqrt(x))
    else
        tmp = 1.0d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -6.8e+70) || !(y <= 1.02e+14)) {
		tmp = 1.0 + (y * Math.sqrt(x));
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -6.8e+70) or not (y <= 1.02e+14):
		tmp = 1.0 + (y * math.sqrt(x))
	else:
		tmp = 1.0 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -6.8e+70) || !(y <= 1.02e+14))
		tmp = Float64(1.0 + Float64(y * sqrt(x)));
	else
		tmp = Float64(1.0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -6.8e+70) || ~((y <= 1.02e+14)))
		tmp = 1.0 + (y * sqrt(x));
	else
		tmp = 1.0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -6.8e+70], N[Not[LessEqual[y, 1.02e+14]], $MachinePrecision]], N[(1.0 + N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(1.0 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -6.8000000000000002e70 or 1.02e14 < y

   1. Initial program 99.8%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 93.1%

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

   if -6.8000000000000002e70 < y < 1.02e14

   1. Initial program 100.0%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 98.8%

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

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6.8 \cdot 10^{+70} \lor \neg \left(y \leq 1.02 \cdot 10^{+14}\right):\\ \;\;\;\;1 + y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 92.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{+71} \lor \neg \left(y \leq 5.5 \cdot 10^{+41}\right):\\ \;\;\;\;y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -7.8e+71) (not (<= y 5.5e+41))) (* y (sqrt x)) (- 1.0 x)))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -7.8e+71) || !(y <= 5.5e+41)) {
		tmp = y * sqrt(x);
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-7.8d+71)) .or. (.not. (y <= 5.5d+41))) then
        tmp = y * sqrt(x)
    else
        tmp = 1.0d0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -7.8e+71) || !(y <= 5.5e+41)) {
		tmp = y * Math.sqrt(x);
	} else {
		tmp = 1.0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -7.8e+71) or not (y <= 5.5e+41):
		tmp = y * math.sqrt(x)
	else:
		tmp = 1.0 - x
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -7.8e+71) || !(y <= 5.5e+41))
		tmp = Float64(y * sqrt(x));
	else
		tmp = Float64(1.0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -7.8e+71) || ~((y <= 5.5e+41)))
		tmp = y * sqrt(x);
	else
		tmp = 1.0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -7.8e+71], N[Not[LessEqual[y, 5.5e+41]], $MachinePrecision]], N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(1.0 - x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.8000000000000002e71 or 5.5000000000000003e41 < y

   1. Initial program 99.8%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. *-commutative 99.8%

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

      3. add-sqr-sqrt 99.3%

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

      4. associate-*l* 99.4%

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

      5. fma-define 99.4%

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

      6. pow1/2 99.4%

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

      7. sqrt-pow1 99.5%

         \[\leadsto \mathsf{fma}\left(\color{blue}{{x}^{\left(\frac{0.5}{2}\right)}}, \sqrt{\sqrt{x}} \cdot y, 1 - x\right) \]

      8. metadata-eval 99.5%

         \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{0.25}}, \sqrt{\sqrt{x}} \cdot y, 1 - x\right) \]

      9. pow1/2 99.5%

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

      10. sqrt-pow1 99.4%

          \[\leadsto \mathsf{fma}\left({x}^{0.25}, \color{blue}{{x}^{\left(\frac{0.5}{2}\right)}} \cdot y, 1 - x\right) \]

      11. metadata-eval 99.4%

          \[\leadsto \mathsf{fma}\left({x}^{0.25}, {x}^{\color{blue}{0.25}} \cdot y, 1 - x\right) \]

   4. Applied egg-rr 99.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{0.25}, {x}^{0.25} \cdot y, 1 - x\right)} \]

   5. Taylor expanded in y around inf 87.9%

      \[\leadsto \color{blue}{\sqrt{x} \cdot y} \]

   if -7.8000000000000002e71 < y < 5.5000000000000003e41

   1. Initial program 100.0%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 96.7%

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

4. Final simplification 93.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7.8 \cdot 10^{+71} \lor \neg \left(y \leq 5.5 \cdot 10^{+41}\right):\\ \;\;\;\;y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;1 - x\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := y \cdot \sqrt{x}\\ \mathbf{if}\;x \leq 1:\\ \;\;\;\;1 + t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_0 - x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (let* ((t_0 (* y (sqrt x)))) (if (<= x 1.0) (+ 1.0 t_0) (- t_0 x))))

C

double code(double x, double y) {
	double t_0 = y * sqrt(x);
	double tmp;
	if (x <= 1.0) {
		tmp = 1.0 + t_0;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = y * sqrt(x)
    if (x <= 1.0d0) then
        tmp = 1.0d0 + t_0
    else
        tmp = t_0 - x
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double t_0 = y * Math.sqrt(x);
	double tmp;
	if (x <= 1.0) {
		tmp = 1.0 + t_0;
	} else {
		tmp = t_0 - x;
	}
	return tmp;
}

Python

def code(x, y):
	t_0 = y * math.sqrt(x)
	tmp = 0
	if x <= 1.0:
		tmp = 1.0 + t_0
	else:
		tmp = t_0 - x
	return tmp

Julia

function code(x, y)
	t_0 = Float64(y * sqrt(x))
	tmp = 0.0
	if (x <= 1.0)
		tmp = Float64(1.0 + t_0);
	else
		tmp = Float64(t_0 - x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	t_0 = y * sqrt(x);
	tmp = 0.0;
	if (x <= 1.0)
		tmp = 1.0 + t_0;
	else
		tmp = t_0 - x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := Block[{t$95$0 = N[(y * N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[x, 1.0], N[(1.0 + t$95$0), $MachinePrecision], N[(t$95$0 - x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < 1

   1. Initial program 99.9%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 98.5%

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

   if 1 < x

   1. Initial program 99.9%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 98.7%

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

   4. Taylor expanded in x around 0 98.8%

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

      1. neg-mul-1 98.8%

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

      2. +-commutative 98.8%

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

      3. *-commutative 98.8%

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

      4. sub-neg 98.8%

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

   6. Simplified 98.8%

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

4. Final simplification 98.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 1:\\ \;\;\;\;1 + y \cdot \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;y \cdot \sqrt{x} - x\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 65.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+104}:\\ \;\;\;\;1 - x\\ \mathbf{else}:\\ \;\;\;\;{y}^{2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (if (<= y 4e+104) (- 1.0 x) (pow y 2.0)))

C

double code(double x, double y) {
	double tmp;
	if (y <= 4e+104) {
		tmp = 1.0 - x;
	} else {
		tmp = pow(y, 2.0);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= 4d+104) then
        tmp = 1.0d0 - x
    else
        tmp = y ** 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (y <= 4e+104) {
		tmp = 1.0 - x;
	} else {
		tmp = Math.pow(y, 2.0);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if y <= 4e+104:
		tmp = 1.0 - x
	else:
		tmp = math.pow(y, 2.0)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (y <= 4e+104)
		tmp = Float64(1.0 - x);
	else
		tmp = y ^ 2.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= 4e+104)
		tmp = 1.0 - x;
	else
		tmp = y ^ 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[y, 4e+104], N[(1.0 - x), $MachinePrecision], N[Power[y, 2.0], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < 4e104

   1. Initial program 99.9%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in y around 0 75.4%

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

   if 4e104 < y

   1. Initial program 100.0%

      \[\left(1 - x\right) + y \cdot \sqrt{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. flip-+ 39.7%

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

      2. div-sub 39.7%

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

      3. pow2 39.7%

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

      4. associate--l- 39.7%

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

      5. *-commutative 39.7%

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

      6. *-commutative 39.7%

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

      7. swap-sqr 19.9%

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

      8. add-sqr-sqrt 19.9%

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

      9. pow2 19.9%

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

      10. associate--l- 19.9%

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

   4. Applied egg-rr 19.9%

      \[\leadsto \color{blue}{\frac{{\left(1 - x\right)}^{2}}{1 - \left(x + y \cdot \sqrt{x}\right)} - \frac{x \cdot {y}^{2}}{1 - \left(x + y \cdot \sqrt{x}\right)}} \]
   5. Step-by-step derivation

      1. div-sub 19.9%

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

      2. *-commutative 19.9%

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

   6. Simplified 19.9%

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

   7. Taylor expanded in y around inf 21.1%

      \[\leadsto \frac{\color{blue}{-1 \cdot \left(x \cdot {y}^{2}\right)}}{1 - \left(x + \sqrt{x} \cdot y\right)} \]
   8. Step-by-step derivation

      1. associate-*r* 21.1%

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

      2. neg-mul-1 21.1%

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

      3. *-commutative 21.1%

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

   9. Simplified 21.1%

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

   10. Taylor expanded in x around inf 49.8%

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

   11. Taylor expanded in y around 0 28.1%

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

4. Final simplification 69.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 4 \cdot 10^{+104}:\\ \;\;\;\;1 - x\\ \mathbf{else}:\\ \;\;\;\;{y}^{2}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 62.6% accurate, 35.7× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (- 1.0 x))

C

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

Fortran

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

Java

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

Python

def code(x, y):
	return 1.0 - x

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in y around 0 65.8%

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

4. Final simplification 65.8%

   \[\leadsto 1 - x \]
5. Add Preprocessing

Alternative 7: 32.0% accurate, 53.5× 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 Float64(-x)
end

MATLAB

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

Wolfram

code[x_, y_] := (-x)

Derivation

1. Initial program 99.9%

   \[\left(1 - x\right) + y \cdot \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 60.9%

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

4. Taylor expanded in y around 0 31.6%

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

   1. neg-mul-1 31.6%

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

6. Simplified 31.6%

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

7. Final simplification 31.6%

   \[\leadsto -x \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024055 
(FPCore (x y)
  :name "Numeric.SpecFunctions:invIncompleteBetaWorker from math-functions-0.1.5.2, E"
  :precision binary64
  (+ (- 1.0 x) (* y (sqrt x))))