Average Error: 5.2 → 0.1
Time: 12.9s
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 r1140095 = 1.0;
        double r1140096 = x;
        double r1140097 = r1140095 - r1140096;
        double r1140098 = 3.0;
        double r1140099 = r1140098 - r1140096;
        double r1140100 = r1140097 * r1140099;
        double r1140101 = y;
        double r1140102 = r1140101 * r1140098;
        double r1140103 = r1140100 / r1140102;
        return r1140103;
}
↓
double f(double x, double y) {
        double r1140104 = 1.0;
        double r1140105 = x;
        double r1140106 = r1140104 - r1140105;
        double r1140107 = y;
        double r1140108 = r1140106 / r1140107;
        double r1140109 = 3.0;
        double r1140110 = r1140109 - r1140105;
        double r1140111 = r1140110 / r1140109;
        double r1140112 = r1140108 * r1140111;
        return r1140112;
}

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

Derivation

  1. Initial program 5.2

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