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

↓
double code(double t) {
	return ((double) (1.0 - ((double) (1.0 / ((double) (2.0 + ((double) (((double) (2.0 - ((double) (2.0 / ((double) (1.0 + ((double) (1.0 * t)))))))) * ((double) (2.0 - ((double) (((double) (((double) cbrt(2.0)) * ((double) cbrt(2.0)))) / ((double) (((double) (1.0 + ((double) (1.0 * t)))) / ((double) cbrt(2.0))))))))))))))));
}

Error
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Simplified0.0
    \[\leadsto \]
  3. Using strategy rm
  4. Applied add-cube-cbrt0.0
    \[\leadsto \]
  5. Applied associate-/l*0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020190 
(FPCore (t)
  :name "Kahan p13 Example 3"
  :precision binary64
  (- 1.0 (/ 1.0 (+ 2.0 (* (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))) (- 2.0 (/ (/ 2.0 t) (+ 1.0 (/ 1.0 t)))))))))