Average Error: 6.0 → 0.1
Time: 3.5s
Precision: 64
\[\frac{\left(1 - x\right) \cdot \left(3 - x\right)}{y \cdot 3}\]
↓
\[\frac{1 - x}{y} \cdot \frac{3 - x}{3}\]
\frac{\left(1 - x\right) \cdot \left(3 - x\right)}{y \cdot 3}
↓
\frac{1 - x}{y} \cdot \frac{3 - x}{3}
double f(double x, double y) {
        double r648764 = 1.0;
        double r648765 = x;
        double r648766 = r648764 - r648765;
        double r648767 = 3.0;
        double r648768 = r648767 - r648765;
        double r648769 = r648766 * r648768;
        double r648770 = y;
        double r648771 = r648770 * r648767;
        double r648772 = r648769 / r648771;
        return r648772;
}
↓
double f(double x, double y) {
        double r648773 = 1.0;
        double r648774 = x;
        double r648775 = r648773 - r648774;
        double r648776 = y;
        double r648777 = r648775 / r648776;
        double r648778 = 3.0;
        double r648779 = r648778 - r648774;
        double r648780 = r648779 / r648778;
        double r648781 = r648777 * r648780;
        return r648781;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original6.0
Target0.1
Herbie0.1
\[\frac{1 - x}{y} \cdot \frac{3 - x}{3}\]

Derivation

  1. Initial program 6.0

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

  3. Applied times-frac0.1

    \[\leadsto \color{blue}{\frac{1 - x}{y} \cdot \frac{3 - x}{3}}\]

  4. Final simplification0.1

    \[\leadsto \frac{1 - x}{y} \cdot \frac{3 - x}{3}\]

Reproduce

herbie shell --seed 2020065 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.TwoD.Arc:bezierFromSweepQ1 from diagrams-lib-1.3.0.3"
  :precision binary64

  :herbie-target
  (* (/ (- 1 x) y) (/ (- 3 x) 3))

  (/ (* (- 1 x) (- 3 x)) (* y 3)))