Average Error: 6.0 → 0.1
Time: 3.0s
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 r759044 = 1.0;
        double r759045 = x;
        double r759046 = r759044 - r759045;
        double r759047 = 3.0;
        double r759048 = r759047 - r759045;
        double r759049 = r759046 * r759048;
        double r759050 = y;
        double r759051 = r759050 * r759047;
        double r759052 = r759049 / r759051;
        return r759052;
}
↓
double f(double x, double y) {
        double r759053 = 1.0;
        double r759054 = x;
        double r759055 = r759053 - r759054;
        double r759056 = y;
        double r759057 = r759055 / r759056;
        double r759058 = 3.0;
        double r759059 = r759058 - r759054;
        double r759060 = r759059 / r759058;
        double r759061 = r759057 * r759060;
        return r759061;
}

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 
(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)))