Main:bigenough3 from C

Percentage Accurate: 52.5% → 99.7%

Time: 11.5s

Alternatives: 10

Speedup: 0.7×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 52.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{1 + x} + \sqrt{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt (+ 1.0 x)) (sqrt x))))

C

double code(double x) {
	return 1.0 / (sqrt((1.0 + x)) + sqrt(x));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt((1.0 + x)) + Math.sqrt(x));
}

Python

def code(x):
	return 1.0 / (math.sqrt((1.0 + x)) + math.sqrt(x))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(Float64(1.0 + x)) + sqrt(x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt((1.0 + x)) + sqrt(x));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 54.3%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. pow1/2 N/A

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

   2. metadata-eval N/A

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

   3. pow-div N/A

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

   4. unpow1 N/A

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

   5. pow1/2 N/A

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

   6. /-lowering-/.f64 N/A

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

   7. +-lowering-+.f64 N/A

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

   8. sqrt-lowering-sqrt.f64 N/A

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

   9. +-lowering-+.f64 54.2

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

4. Applied egg-rr 54.2%

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

   1. div-inv N/A

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

   2. *-commutative N/A

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

   3. pow1/2 N/A

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

   4. pow-flip N/A

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

   5. pow-plus N/A

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

   6. metadata-eval N/A

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

   7. metadata-eval N/A

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

   8. pow1/2 N/A

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

   9. flip-- N/A

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

   10. rem-square-sqrt N/A

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

   11. rem-square-sqrt N/A

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

   12. associate-+r- N/A

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

   13. +-commutative N/A

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

   14. associate-+l- N/A

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

   15. div-sub N/A

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

   16. --lowering--.f64 N/A

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

6. Applied egg-rr 99.7%

   \[\leadsto \color{blue}{\frac{1}{\sqrt{x + 1} + \sqrt{x}} - \frac{x - x}{\sqrt{x + 1} + \sqrt{x}}} \]
7. Step-by-step derivation

   1. sub-div N/A

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

   2. +-inverses N/A

      \[\leadsto \frac{1 - \color{blue}{0}}{\sqrt{x + 1} + \sqrt{x}} \]

   3. metadata-eval N/A

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

   4. /-lowering-/.f64 N/A

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

   5. +-lowering-+.f64 N/A

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

   6. sqrt-lowering-sqrt.f64 N/A

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

   7. +-lowering-+.f64 N/A

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

   8. sqrt-lowering-sqrt.f64 99.7

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

8. Applied egg-rr 99.7%

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

9. Final simplification 99.7%

   \[\leadsto \frac{1}{\sqrt{1 + x} + \sqrt{x}} \]
10. Add Preprocessing

Alternative 2: 99.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{1 + x} - \sqrt{x}\\ \mathbf{if}\;t\_0 \leq 2 \cdot 10^{-5}:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (- (sqrt (+ 1.0 x)) (sqrt x))))
   (if (<= t_0 2e-5) (* 0.5 (sqrt (/ 1.0 x))) t_0)))

C

double code(double x) {
	double t_0 = sqrt((1.0 + x)) - sqrt(x);
	double tmp;
	if (t_0 <= 2e-5) {
		tmp = 0.5 * sqrt((1.0 / x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double t_0 = Math.sqrt((1.0 + x)) - Math.sqrt(x);
	double tmp;
	if (t_0 <= 2e-5) {
		tmp = 0.5 * Math.sqrt((1.0 / x));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x):
	t_0 = math.sqrt((1.0 + x)) - math.sqrt(x)
	tmp = 0
	if t_0 <= 2e-5:
		tmp = 0.5 * math.sqrt((1.0 / x))
	else:
		tmp = t_0
	return tmp

Julia

function code(x)
	t_0 = Float64(sqrt(Float64(1.0 + x)) - sqrt(x))
	tmp = 0.0
	if (t_0 <= 2e-5)
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = sqrt((1.0 + x)) - sqrt(x);
	tmp = 0.0;
	if (t_0 <= 2e-5)
		tmp = 0.5 * sqrt((1.0 / x));
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 2e-5], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], t$95$0]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 2.00000000000000016e-5

   1. Initial program 5.4%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\frac{1}{x}}} \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

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

      2. sqrt-lowering-sqrt.f64 N/A

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

      3. /-lowering-/.f64 98.9

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\frac{1}{x}}} \]

   5. Simplified 98.9%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]

   if 2.00000000000000016e-5 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 99.5%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

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

Alternative 3: 98.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right) - \sqrt{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (sqrt (+ 1.0 x)) (sqrt x)) 0.2)
   (* 0.5 (sqrt (/ 1.0 x)))
   (- (fma x (fma x -0.125 0.5) 1.0) (sqrt x))))

C

double code(double x) {
	double tmp;
	if ((sqrt((1.0 + x)) - sqrt(x)) <= 0.2) {
		tmp = 0.5 * sqrt((1.0 / x));
	} else {
		tmp = fma(x, fma(x, -0.125, 0.5), 1.0) - sqrt(x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) <= 0.2)
		tmp = Float64(0.5 * sqrt(Float64(1.0 / x)));
	else
		tmp = Float64(fma(x, fma(x, -0.125, 0.5), 1.0) - sqrt(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.2], N[(0.5 * N[Sqrt[N[(1.0 / x), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * -0.125 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.20000000000000001

   1. Initial program 7.2%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\frac{1}{x}}} \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

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

      2. sqrt-lowering-sqrt.f64 N/A

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

      3. /-lowering-/.f64 97.5

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\frac{1}{x}}} \]

   5. Simplified 97.5%

      \[\leadsto \color{blue}{0.5 \cdot \sqrt{\frac{1}{x}}} \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 100.0%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 99.7

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

   5. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right)} - \sqrt{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;0.5 \cdot \sqrt{\frac{1}{x}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right) - \sqrt{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{\sqrt{x}}{x + x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right) - \sqrt{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (sqrt (+ 1.0 x)) (sqrt x)) 0.2)
   (/ (sqrt x) (+ x x))
   (- (fma x (fma x -0.125 0.5) 1.0) (sqrt x))))

C

double code(double x) {
	double tmp;
	if ((sqrt((1.0 + x)) - sqrt(x)) <= 0.2) {
		tmp = sqrt(x) / (x + x);
	} else {
		tmp = fma(x, fma(x, -0.125, 0.5), 1.0) - sqrt(x);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) <= 0.2)
		tmp = Float64(sqrt(x) / Float64(x + x));
	else
		tmp = Float64(fma(x, fma(x, -0.125, 0.5), 1.0) - sqrt(x));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.2], N[(N[Sqrt[x], $MachinePrecision] / N[(x + x), $MachinePrecision]), $MachinePrecision], N[(N[(x * N[(x * -0.125 + 0.5), $MachinePrecision] + 1.0), $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.20000000000000001

   1. Initial program 7.2%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. flip-- N/A

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

      2. div-inv N/A

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

      3. rem-square-sqrt N/A

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

      4. rem-square-sqrt N/A

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

      5. flip-- N/A

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

      6. associate-*l/ N/A

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

      7. /-lowering-/.f64 N/A

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

   4. Applied egg-rr 9.2%

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

   5. Taylor expanded in x around inf

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

      1. sqrt-lowering-sqrt.f64 97.3

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

   7. Simplified 97.3%

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

   8. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{x}}{x + \color{blue}{x}} \]
   9. Step-by-step derivation

   10. Simplified 97.3%

       \[\leadsto \frac{\sqrt{x}}{x + \color{blue}{x}} \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 100.0%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. accelerator-lowering-fma.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. accelerator-lowering-fma.f64 99.7

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

   5. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right)} - \sqrt{x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{\sqrt{x}}{x + x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.125, 0.5\right), 1\right) - \sqrt{x}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{\sqrt{x}}{x + x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (sqrt (+ 1.0 x)) (sqrt x)) 0.2)
   (/ (sqrt x) (+ x x))
   (fma x 0.5 (- 1.0 (sqrt x)))))

C

double code(double x) {
	double tmp;
	if ((sqrt((1.0 + x)) - sqrt(x)) <= 0.2) {
		tmp = sqrt(x) / (x + x);
	} else {
		tmp = fma(x, 0.5, (1.0 - sqrt(x)));
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) <= 0.2)
		tmp = Float64(sqrt(x) / Float64(x + x));
	else
		tmp = fma(x, 0.5, Float64(1.0 - sqrt(x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.2], N[(N[Sqrt[x], $MachinePrecision] / N[(x + x), $MachinePrecision]), $MachinePrecision], N[(x * 0.5 + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.20000000000000001

   1. Initial program 7.2%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. flip-- N/A

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

      2. div-inv N/A

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

      3. rem-square-sqrt N/A

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

      4. rem-square-sqrt N/A

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

      5. flip-- N/A

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

      6. associate-*l/ N/A

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

      7. /-lowering-/.f64 N/A

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

   4. Applied egg-rr 9.2%

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

   5. Taylor expanded in x around inf

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

      1. sqrt-lowering-sqrt.f64 97.3

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

   7. Simplified 97.3%

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

   8. Taylor expanded in x around inf

      \[\leadsto \frac{\sqrt{x}}{x + \color{blue}{x}} \]
   9. Step-by-step derivation

   10. Simplified 97.3%

       \[\leadsto \frac{\sqrt{x}}{x + \color{blue}{x}} \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 100.0%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. sqrt-lowering-sqrt.f64 99.6

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

   5. Simplified 99.6%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{\sqrt{x}}{x + x}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{0.5}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (- (sqrt (+ 1.0 x)) (sqrt x)) 0.2)
   (/ 0.5 (sqrt x))
   (fma x 0.5 (- 1.0 (sqrt x)))))

C

double code(double x) {
	double tmp;
	if ((sqrt((1.0 + x)) - sqrt(x)) <= 0.2) {
		tmp = 0.5 / sqrt(x);
	} else {
		tmp = fma(x, 0.5, (1.0 - sqrt(x)));
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(sqrt(Float64(1.0 + x)) - sqrt(x)) <= 0.2)
		tmp = Float64(0.5 / sqrt(x));
	else
		tmp = fma(x, 0.5, Float64(1.0 - sqrt(x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[Sqrt[N[(1.0 + x), $MachinePrecision]], $MachinePrecision] - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], 0.2], N[(0.5 / N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[(x * 0.5 + N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x)) < 0.20000000000000001

   1. Initial program 7.2%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \sqrt{\frac{1}{x}}} \]
   4. Step-by-step derivation

      1. *-lowering-*.f64 N/A

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

      2. sqrt-lowering-sqrt.f64 N/A

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

      3. /-lowering-/.f64 97.5

         \[\leadsto 0.5 \cdot \sqrt{\color{blue}{\frac{1}{x}}} \]

   5. Simplified 97.5%

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

      1. sqrt-div N/A

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

      2. metadata-eval N/A

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

      3. un-div-inv N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2}}{\sqrt{x}}} \]

      4. /-lowering-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{1}{2}}{\sqrt{x}}} \]

      5. sqrt-lowering-sqrt.f64 97.3

         \[\leadsto \frac{0.5}{\color{blue}{\sqrt{x}}} \]

   7. Applied egg-rr 97.3%

      \[\leadsto \color{blue}{\frac{0.5}{\sqrt{x}}} \]

   if 0.20000000000000001 < (-.f64 (sqrt.f64 (+.f64 x #s(literal 1 binary64))) (sqrt.f64 x))

   1. Initial program 100.0%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. +-commutative N/A

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

      2. associate--l+ N/A

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

      3. *-commutative N/A

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

      4. accelerator-lowering-fma.f64 N/A

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

      5. --lowering--.f64 N/A

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

      6. sqrt-lowering-sqrt.f64 99.6

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

   5. Simplified 99.6%

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

4. Final simplification 98.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\sqrt{1 + x} - \sqrt{x} \leq 0.2:\\ \;\;\;\;\frac{0.5}{\sqrt{x}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 50.8% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 0.25:\\ \;\;\;\;1 - \sqrt{x}\\ \mathbf{else}:\\ \;\;\;\;\sqrt{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (if (<= x 0.25) (- 1.0 (sqrt x)) (sqrt x)))

C

double code(double x) {
	double tmp;
	if (x <= 0.25) {
		tmp = 1.0 - sqrt(x);
	} else {
		tmp = sqrt(x);
	}
	return tmp;
}

Fortran

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

Java

public static double code(double x) {
	double tmp;
	if (x <= 0.25) {
		tmp = 1.0 - Math.sqrt(x);
	} else {
		tmp = Math.sqrt(x);
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 0.25:
		tmp = 1.0 - math.sqrt(x)
	else:
		tmp = math.sqrt(x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 0.25)
		tmp = Float64(1.0 - sqrt(x));
	else
		tmp = sqrt(x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 0.25)
		tmp = 1.0 - sqrt(x);
	else
		tmp = sqrt(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 0.25], N[(1.0 - N[Sqrt[x], $MachinePrecision]), $MachinePrecision], N[Sqrt[x], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.25

   1. Initial program 100.0%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. --lowering--.f64 N/A

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

      2. sqrt-lowering-sqrt.f64 98.9

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

   5. Simplified 98.9%

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

   if 0.25 < x

   1. Initial program 7.2%

      \[\sqrt{x + 1} - \sqrt{x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

      1. --lowering--.f64 N/A

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

      2. sqrt-lowering-sqrt.f64 1.6

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

   5. Simplified 1.6%

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

   6. Taylor expanded in x around inf

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

      1. mul-1-neg N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{x}\right)} \]

      2. neg-lowering-neg.f64 N/A

         \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{x}\right)} \]

      3. sqrt-lowering-sqrt.f64 1.6

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

   8. Simplified 1.6%

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

   10. Applied egg-rr 5.3%

       \[\leadsto \color{blue}{\sqrt{x}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 50.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (fma x 0.5 (- 1.0 (sqrt x))))

C

double code(double x) {
	return fma(x, 0.5, (1.0 - sqrt(x)));
}

Julia

function code(x)
	return fma(x, 0.5, Float64(1.0 - sqrt(x)))
end

Wolfram

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

Derivation

1. Initial program 54.3%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. associate--l+ N/A

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

   3. *-commutative N/A

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

   4. accelerator-lowering-fma.f64 N/A

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

   5. --lowering--.f64 N/A

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

   6. sqrt-lowering-sqrt.f64 52.8

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

5. Simplified 52.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, 1 - \sqrt{x}\right)} \]
6. Add Preprocessing

Alternative 9: 50.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(x, 0.5, 1\right) - \sqrt{x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (- (fma x 0.5 1.0) (sqrt x)))

C

double code(double x) {
	return fma(x, 0.5, 1.0) - sqrt(x);
}

Julia

function code(x)
	return Float64(fma(x, 0.5, 1.0) - sqrt(x))
end

Wolfram

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

Derivation

1. Initial program 54.3%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. accelerator-lowering-fma.f64 52.8

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

5. Simplified 52.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, 0.5, 1\right)} - \sqrt{x} \]
6. Add Preprocessing

Alternative 10: 6.2% accurate, 2.5× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (sqrt x))

C

double code(double x) {
	return sqrt(x);
}

Fortran

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

Java

public static double code(double x) {
	return Math.sqrt(x);
}

Python

def code(x):
	return math.sqrt(x)

Julia

function code(x)
	return sqrt(x)
end

MATLAB

function tmp = code(x)
	tmp = sqrt(x);
end

Wolfram

code[x_] := N[Sqrt[x], $MachinePrecision]

Derivation

1. Initial program 54.3%

   \[\sqrt{x + 1} - \sqrt{x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. --lowering--.f64 N/A

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

   2. sqrt-lowering-sqrt.f64 51.0

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

5. Simplified 51.0%

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

6. Taylor expanded in x around inf

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

   1. mul-1-neg N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{x}\right)} \]

   2. neg-lowering-neg.f64 N/A

      \[\leadsto \color{blue}{\mathsf{neg}\left(\sqrt{x}\right)} \]

   3. sqrt-lowering-sqrt.f64 1.7

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

8. Simplified 1.7%

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

10. Applied egg-rr 6.0%

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

Developer Target 1: 99.7% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \frac{1}{\sqrt{x + 1} + \sqrt{x}} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (/ 1.0 (+ (sqrt (+ x 1.0)) (sqrt x))))

C

double code(double x) {
	return 1.0 / (sqrt((x + 1.0)) + sqrt(x));
}

Fortran

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

Java

public static double code(double x) {
	return 1.0 / (Math.sqrt((x + 1.0)) + Math.sqrt(x));
}

Python

def code(x):
	return 1.0 / (math.sqrt((x + 1.0)) + math.sqrt(x))

Julia

function code(x)
	return Float64(1.0 / Float64(sqrt(Float64(x + 1.0)) + sqrt(x)))
end

MATLAB

function tmp = code(x)
	tmp = 1.0 / (sqrt((x + 1.0)) + sqrt(x));
end

Wolfram

code[x_] := N[(1.0 / N[(N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision] + N[Sqrt[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024199 
(FPCore (x)
  :name "Main:bigenough3 from C"
  :precision binary64

  :alt
  (! :herbie-platform default (/ 1 (+ (sqrt (+ x 1)) (sqrt x))))

  (- (sqrt (+ x 1.0)) (sqrt x)))