Average Error: 0.0 → 0.0
Time: 1.3s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) (1.0 / ((double) (x - 1.0)))) + ((double) (x / ((double) (x + 1.0))))));
}

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

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied flip--0.0
    \[\leadsto \]
  4. Applied associate-/r/0.0
    \[\leadsto \]
  5. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "Asymptote B"
  :precision binary64
  (+ (/ 1.0 (- x 1.0)) (/ x (+ x 1.0))))