Numeric.Log:$clog1p from log-domain-0.10.2.1, B

Percentage Accurate: 99.7% → 99.6%

Time: 6.4s

Alternatives: 9

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x + 1}\\ \mathbf{if}\;\frac{x}{1 + t\_0} \leq 2 \cdot 10^{-9}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.0390625, 0.0625\right), -0.125\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sqrt (+ x 1.0))))
   (if (<= (/ x (+ 1.0 t_0)) 2e-9)
     (* x (fma x (fma x (fma x -0.0390625 0.0625) -0.125) 0.5))
     (+ t_0 -1.0))))

C

double code(double x) {
	double t_0 = sqrt((x + 1.0));
	double tmp;
	if ((x / (1.0 + t_0)) <= 2e-9) {
		tmp = x * fma(x, fma(x, fma(x, -0.0390625, 0.0625), -0.125), 0.5);
	} else {
		tmp = t_0 + -1.0;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = sqrt(Float64(x + 1.0))
	tmp = 0.0
	if (Float64(x / Float64(1.0 + t_0)) <= 2e-9)
		tmp = Float64(x * fma(x, fma(x, fma(x, -0.0390625, 0.0625), -0.125), 0.5));
	else
		tmp = Float64(t_0 + -1.0);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. metadata-eval N/A

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

      6. lower-fma.f64 N/A

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

      7. +-commutative N/A

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

      8. *-commutative N/A

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

      9. lower-fma.f64 100.0

         \[\leadsto x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \color{blue}{\mathsf{fma}\left(x, -0.0390625, 0.0625\right)}, -0.125\right), 0.5\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, \mathsf{fma}\left(x, -0.0390625, 0.0625\right), -0.125\right), 0.5\right)} \]

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. neg-sub0 N/A

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

      4. metadata-eval N/A

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

      5. associate--r+ N/A

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

      6. metadata-eval N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. rem-square-sqrt N/A

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

      10. lift-sqrt.f64 N/A

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

      11. lift-sqrt.f64 N/A

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

      12. distribute-neg-frac2 N/A

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

      13. lift-+.f64 N/A

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

      14. flip-- N/A

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

      15. lower-neg.f64 N/A

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

      16. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift-neg.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-neg-in N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 100.0

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

   6. Applied rewrites 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 99.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x + 1}\\ \mathbf{if}\;\frac{x}{1 + t\_0} \leq 2 \cdot 10^{-9}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(x, \mathsf{fma}\left(x, 0.0625, -0.125\right), 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 + -1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. lower-fma.f64 N/A

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

      4. sub-neg N/A

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

      5. *-commutative N/A

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

      6. metadata-eval N/A

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

      7. lower-fma.f64 99.8

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

   5. Applied rewrites 99.8%

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

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. neg-sub0 N/A

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

      4. metadata-eval N/A

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

      5. associate--r+ N/A

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

      6. metadata-eval N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. rem-square-sqrt N/A

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

      10. lift-sqrt.f64 N/A

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

      11. lift-sqrt.f64 N/A

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

      12. distribute-neg-frac2 N/A

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

      13. lift-+.f64 N/A

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

      14. flip-- N/A

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

      15. lower-neg.f64 N/A

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

      16. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift-neg.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-neg-in N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 100.0

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

   6. Applied rewrites 100.0%

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

4. Final simplification 99.9%

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

Alternative 3: 99.5% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sqrt{x + 1}\\ \mathbf{if}\;\frac{x}{1 + t\_0} \leq 2 \cdot 10^{-9}:\\ \;\;\;\;x \cdot \mathsf{fma}\left(x, -0.125, 0.5\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0 + -1\\ \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

      1. lift-/.f64 N/A

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

      2. frac-2neg N/A

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

      3. neg-sub0 N/A

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

      4. metadata-eval N/A

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

      5. associate--r+ N/A

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

      6. metadata-eval N/A

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

      7. +-commutative N/A

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

      8. lift-+.f64 N/A

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

      9. rem-square-sqrt N/A

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

      10. lift-sqrt.f64 N/A

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

      11. lift-sqrt.f64 N/A

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

      12. distribute-neg-frac2 N/A

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

      13. lift-+.f64 N/A

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

      14. flip-- N/A

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

      15. lower-neg.f64 N/A

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

      16. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

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

      1. lift-neg.f64 N/A

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

      2. lift--.f64 N/A

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

      3. sub-neg N/A

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

      4. +-commutative N/A

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

      5. distribute-neg-in N/A

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

      6. remove-double-neg N/A

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

      7. sub-neg N/A

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

      8. lower--.f64 100.0

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

   6. Applied rewrites 100.0%

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

4. Final simplification 99.7%

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

Alternative 4: 98.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

   3. Taylor expanded in x around inf

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. lower-+.f64 N/A

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

      4. lower-sqrt.f64 96.9

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

   5. Applied rewrites 96.9%

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

Alternative 5: 97.7% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 99.6

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

   5. Applied rewrites 99.6%

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

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

   3. Taylor expanded in x around inf

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

      1. lower-sqrt.f64 95.2

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

   5. Applied rewrites 95.2%

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

Alternative 6: 97.2% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64))))) < 2.00000000000000012e-9

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. lower-*.f64 98.9

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

   5. Applied rewrites 98.9%

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

   if 2.00000000000000012e-9 < (/.f64 x (+.f64 #s(literal 1 binary64) (sqrt.f64 (+.f64 x #s(literal 1 binary64)))))

   1. Initial program 99.1%

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

   3. Taylor expanded in x around inf

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

      1. lower-sqrt.f64 95.2

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

   5. Applied rewrites 95.2%

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

4. Final simplification 97.8%

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

Alternative 7: 99.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

Alternative 8: 67.9% accurate, 4.7× speedup

Math

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

FPCore

(FPCore (x) :precision binary64 (* x 0.5))

C

double code(double x) {
	return x * 0.5;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * 0.5d0
end function

Java

public static double code(double x) {
	return x * 0.5;
}

Python

def code(x):
	return x * 0.5

Julia

function code(x)
	return Float64(x * 0.5)
end

MATLAB

function tmp = code(x)
	tmp = x * 0.5;
end

Wolfram

code[x_] := N[(x * 0.5), $MachinePrecision]

Derivation

1. Initial program 99.7%

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

3. Taylor expanded in x around 0

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

   1. lower-*.f64 72.0

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

5. Applied rewrites 72.0%

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

6. Final simplification 72.0%

   \[\leadsto x \cdot 0.5 \]
7. Add Preprocessing

Alternative 9: 4.5% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return 1.0 + -1.0

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.7%

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

   1. lift-/.f64 N/A

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

   2. frac-2neg N/A

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

   3. neg-sub0 N/A

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

   4. metadata-eval N/A

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

   5. associate--r+ N/A

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

   6. metadata-eval N/A

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

   7. +-commutative N/A

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

   8. lift-+.f64 N/A

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

   9. rem-square-sqrt N/A

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

   10. lift-sqrt.f64 N/A

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

   11. lift-sqrt.f64 N/A

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

   12. distribute-neg-frac2 N/A

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

   13. lift-+.f64 N/A

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

   14. flip-- N/A

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

   15. lower-neg.f64 N/A

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

   16. lower--.f64 34.3

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

4. Applied rewrites 34.3%

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

   1. lift-neg.f64 N/A

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

   2. lift--.f64 N/A

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

   3. sub-neg N/A

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

   4. +-commutative N/A

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

   5. distribute-neg-in N/A

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

   6. remove-double-neg N/A

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

   7. sub-neg N/A

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

   8. lower--.f64 34.3

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

6. Applied rewrites 34.3%

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

7. Taylor expanded in x around 0

   \[\leadsto \color{blue}{1} - 1 \]
8. Step-by-step derivation

9. Applied rewrites 4.7%

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

10. Final simplification 4.7%

    \[\leadsto 1 + -1 \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2024233 
(FPCore (x)
  :name "Numeric.Log:$clog1p from log-domain-0.10.2.1, B"
  :precision binary64
  (/ x (+ 1.0 (sqrt (+ x 1.0)))))