Average Error: 9.5 → 0.1
Time: 3.7s
Precision: 64
\[\left(\frac{1}{x + 1} - \frac{2}{x}\right) + \frac{1}{x - 1}\]
↓
\[\frac{1}{\left(x + 1\right) \cdot x} \cdot \frac{2}{x - 1}\]
\left(\frac{1}{x + 1} - \frac{2}{x}\right) + \frac{1}{x - 1}
↓
\frac{1}{\left(x + 1\right) \cdot x} \cdot \frac{2}{x - 1}
double code(double x) {
	return (((1.0 / (x + 1.0)) - (2.0 / x)) + (1.0 / (x - 1.0)));
}
↓
double code(double x) {
	return ((1.0 / ((x + 1.0) * x)) * (2.0 / (x - 1.0)));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original9.5
Target0.3
Herbie0.1
\[\frac{2}{x \cdot \left(x \cdot x - 1\right)}\]

Derivation

  1. Initial program 9.5

    \[\left(\frac{1}{x + 1} - \frac{2}{x}\right) + \frac{1}{x - 1}\]
  2. Using strategy rm

  3. Applied frac-sub25.8

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

  4. Applied frac-add25.3

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

  5. Taylor expanded around 0 0.3

    \[\leadsto \frac{\color{blue}{2}}{\left(\left(x + 1\right) \cdot x\right) \cdot \left(x - 1\right)}\]
  6. Using strategy rm

  7. Applied *-un-lft-identity0.3

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

  8. Applied times-frac0.1

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

  9. Final simplification0.1

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

Reproduce

herbie shell --seed 2020056 
(FPCore (x)
  :name "3frac (problem 3.3.3)"
  :precision binary64

  :herbie-target
  (/ 2 (* x (- (* x x) 1)))

  (+ (- (/ 1 (+ x 1)) (/ 2 x)) (/ 1 (- x 1))))