Average Error: 5.5 → 0.1
Time: 15.4s
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 r451427 = 1.0;
        double r451428 = x;
        double r451429 = r451427 - r451428;
        double r451430 = 3.0;
        double r451431 = r451430 - r451428;
        double r451432 = r451429 * r451431;
        double r451433 = y;
        double r451434 = r451433 * r451430;
        double r451435 = r451432 / r451434;
        return r451435;
}
↓
double f(double x, double y) {
        double r451436 = 1.0;
        double r451437 = x;
        double r451438 = r451436 - r451437;
        double r451439 = y;
        double r451440 = r451438 / r451439;
        double r451441 = 3.0;
        double r451442 = r451441 - r451437;
        double r451443 = r451442 / r451441;
        double r451444 = r451440 * r451443;
        return r451444;
}

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.5
Target0.1
Herbie0.1
\[\frac{1 - x}{y} \cdot \frac{3 - x}{3}\]

Derivation

  1. Initial program 5.5

    \[\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 2019208 +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)))