Average Error: 8.2 → 0.0
Time: 1.6s
Precision: 64
\[\frac{x \cdot y}{y + 1}\]
↓
\[x \cdot \frac{y}{y + 1}\]
\frac{x \cdot y}{y + 1}
↓
x \cdot \frac{y}{y + 1}
double f(double x, double y) {
        double r688570 = x;
        double r688571 = y;
        double r688572 = r688570 * r688571;
        double r688573 = 1.0;
        double r688574 = r688571 + r688573;
        double r688575 = r688572 / r688574;
        return r688575;
}
↓
double f(double x, double y) {
        double r688576 = x;
        double r688577 = y;
        double r688578 = 1.0;
        double r688579 = r688577 + r688578;
        double r688580 = r688577 / r688579;
        double r688581 = r688576 * r688580;
        return r688581;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original8.2
Target0.0
Herbie0.0
\[\begin{array}{l} \mathbf{if}\;y \lt -3693.848278829724677052581682801246643066:\\ \;\;\;\;\frac{x}{y \cdot y} - \left(\frac{x}{y} - x\right)\\ \mathbf{elif}\;y \lt 6799310503.41891002655029296875:\\ \;\;\;\;\frac{x \cdot y}{y + 1}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y \cdot y} - \left(\frac{x}{y} - x\right)\\ \end{array}\]

Derivation

  1. Initial program 8.2

    \[\frac{x \cdot y}{y + 1}\]
  2. Using strategy rm

  3. Applied *-un-lft-identity8.2

    \[\leadsto \frac{x \cdot y}{\color{blue}{1 \cdot \left(y + 1\right)}}\]

  4. Applied times-frac0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

    \[\leadsto x \cdot \frac{y}{y + 1}\]

Reproduce

herbie shell --seed 2020001 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Trail:splitAtParam  from diagrams-lib-1.3.0.3, B"
  :precision binary64

  :herbie-target
  (if (< y -3693.8482788297247) (- (/ x (* y y)) (- (/ x y) x)) (if (< y 6799310503.41891) (/ (* x y) (+ y 1)) (- (/ x (* y y)) (- (/ x y) x))))

  (/ (* x y) (+ y 1)))