Asymptote C

Percentage Accurate: 54.3% → 99.8%

Time: 7.7s

Alternatives: 7

Speedup: 0.7×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (x / (x + 1.0)) - ((x + 1.0) / (x - 1.0))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 54.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

def code(x):
	return (x / (x + 1.0)) - ((x + 1.0) / (x - 1.0))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (+ (/ x (+ x 1.0)) (/ (- -1.0 x) (+ x -1.0))) 1e-5)
   (/ (+ -3.0 (/ (- -3.0 x) (* x x))) x)
   (/ (fma x -3.0 -1.0) (fma x x -1.0))))

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) + ((-1.0 - x) / (x + -1.0))) <= 1e-5) {
		tmp = (-3.0 + ((-3.0 - x) / (x * x))) / x;
	} else {
		tmp = fma(x, -3.0, -1.0) / fma(x, x, -1.0);
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(x / Float64(x + 1.0)) + Float64(Float64(-1.0 - x) / Float64(x + -1.0))) <= 1e-5)
		tmp = Float64(Float64(-3.0 + Float64(Float64(-3.0 - x) / Float64(x * x))) / x);
	else
		tmp = Float64(fma(x, -3.0, -1.0) / fma(x, x, -1.0));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - x), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-5], N[(N[(-3.0 + N[(N[(-3.0 - x), $MachinePrecision] / N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(x * -3.0 + -1.0), $MachinePrecision] / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 8.0%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 100.0%

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

   6. Taylor expanded in x around 0

      \[\leadsto \frac{-3 + \frac{-1 \cdot x - 3}{{x}^{2}}}{x} \]
   7. Step-by-step derivation

   8. Applied rewrites 100.0%

      \[\leadsto \frac{-3 + \frac{-3 - x}{x \cdot x}}{x} \]

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

   1. Initial program 99.9%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. lift-/.f64 N/A

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

      7. frac-add N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. lift--.f64 N/A

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

      11. difference-of-sqr-1 N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 100.0

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

   7. Applied rewrites 100.0%

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

4. Final simplification 100.0%

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

Alternative 2: 99.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (+ (/ x (+ x 1.0)) (/ (- -1.0 x) (+ x -1.0))) 1e-14)
   (/ (+ -3.0 (/ -1.0 x)) x)
   (* (fma x -3.0 -1.0) (/ 1.0 (fma x x -1.0)))))

C

double code(double x) {
	double tmp;
	if (((x / (x + 1.0)) + ((-1.0 - x) / (x + -1.0))) <= 1e-14) {
		tmp = (-3.0 + (-1.0 / x)) / x;
	} else {
		tmp = fma(x, -3.0, -1.0) * (1.0 / fma(x, x, -1.0));
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(Float64(x / Float64(x + 1.0)) + Float64(Float64(-1.0 - x) / Float64(x + -1.0))) <= 1e-14)
		tmp = Float64(Float64(-3.0 + Float64(-1.0 / x)) / x);
	else
		tmp = Float64(fma(x, -3.0, -1.0) * Float64(1.0 / fma(x, x, -1.0)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[(x / N[(x + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(-1.0 - x), $MachinePrecision] / N[(x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 1e-14], N[(N[(-3.0 + N[(-1.0 / x), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision], N[(N[(x * -3.0 + -1.0), $MachinePrecision] * N[(1.0 / N[(x * x + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) < 9.99999999999999999e-15

   1. Initial program 7.1%

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

   3. Taylor expanded in x around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. neg-mul-1 N/A

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

      4. distribute-neg-in N/A

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

      5. metadata-eval N/A

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

      6. lower-+.f64 N/A

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

      7. distribute-neg-frac N/A

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

      8. metadata-eval N/A

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

      9. lower-/.f64 99.4

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

   5. Applied rewrites 99.4%

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

   if 9.99999999999999999e-15 < (-.f64 (/.f64 x (+.f64 x #s(literal 1 binary64))) (/.f64 (+.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))))

   1. Initial program 99.1%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. distribute-neg-frac N/A

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

      6. lift-/.f64 N/A

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

      7. frac-add N/A

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

      8. *-commutative N/A

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

      9. lift-+.f64 N/A

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

      10. lift--.f64 N/A

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

      11. difference-of-sqr-1 N/A

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

      12. metadata-eval N/A

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

      13. lower-/.f64 N/A

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

   4. Applied rewrites 99.1%

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

   5. Taylor expanded in x around 0

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

      1. sub-neg N/A

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

      2. metadata-eval N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 100.0

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

   7. Applied rewrites 100.0%

      \[\leadsto \frac{\color{blue}{\mathsf{fma}\left(x, -3, -1\right)}}{\mathsf{fma}\left(x, x, -1\right)} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. div-inv N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lift-fma.f64 N/A

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

      6. metadata-eval N/A

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

      7. sub-neg N/A

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

      8. metadata-eval N/A

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

      9. lower-/.f64 N/A

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

      10. metadata-eval N/A

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

      11. sub-neg N/A

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

      12. metadata-eval N/A

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

      13. lift-fma.f64 100.0

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

   9. Applied rewrites 100.0%

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

4. Final simplification 99.7%

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

Reproduce

herbie shell --seed 2024227 
(FPCore (x)
  :name "Asymptote C"
  :precision binary64
  (- (/ x (+ x 1.0)) (/ (+ x 1.0) (- x 1.0))))