Average Error: 9.3 → 0.1
Time: 5.5s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (x / y)) + ((double) (((double) (2.0 + ((double) (((double) (z * 2.0)) * ((double) (1.0 - t)))))) / ((double) (t * z))))));
}

↓
double code(double x, double y, double z, double t) {
	return ((double) (((double) (x / y)) + ((double) (((double) (2.0 * ((double) (((double) (((double) (1.0 / z)) + 1.0)) / t)))) - 2.0))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Bits error versus t
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original9.3
Target0.1
Herbie0.1
\[\]
Derivation
  1. Initial program 9.3
    \[\]
  2. Simplified0.1
    \[\leadsto \]
  3. Using strategy rm
  4. Applied div-inv0.1
    \[\leadsto \]
  5. Applied associate-*l*0.1
    \[\leadsto \]
  6. Simplified0.1
    \[\leadsto \]
  7. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x y z t)
  :name "Data.HashTable.ST.Basic:computeOverhead from hashtables-1.2.0.2"
  :precision binary64

  :herbie-target
  (- (/ (+ (/ 2.0 z) 2.0) t) (- 2.0 (/ x y)))

  (+ (/ x y) (/ (+ 2.0 (* (* z 2.0) (- 1.0 t))) (* t z))))