Average Error: 5.8 → 0.1
Time: 2.4s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y) {
	return ((double) (((double) (((double) (1.0 - x)) * ((double) (3.0 - x)))) / ((double) (y * 3.0))));
}

↓
double code(double x, double y) {
	return ((double) (((double) (1.0 - x)) / ((double) (((double) (3.0 / ((double) (3.0 - x)))) * y))));
}

Error
Bits error versus x
Bits error versus y
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original5.8
Target0.1
Herbie0.1
\[\]
Derivation
  1. Initial program 5.8
    \[\]
  2. Simplified0.4
    \[\leadsto \]
  3. Using strategy rm
  4. Applied clear-num0.3
    \[\leadsto \]
  5. Simplified0.2
    \[\leadsto \]
  6. Using strategy rm
  7. Applied un-div-inv0.1
    \[\leadsto \]
  8. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020179 
(FPCore (x y)
  :name "Diagrams.TwoD.Arc:bezierFromSweepQ1 from diagrams-lib-1.3.0.3"
  :precision binary64

  :herbie-target
  (* (/ (- 1.0 x) y) (/ (- 3.0 x) 3.0))

  (/ (* (- 1.0 x) (- 3.0 x)) (* y 3.0)))