Average Error: 8.3 → 0.0
Time: 930.0ms
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 r678348 = x;
        double r678349 = y;
        double r678350 = r678348 * r678349;
        double r678351 = 1.0;
        double r678352 = r678349 + r678351;
        double r678353 = r678350 / r678352;
        return r678353;
}
↓
double f(double x, double y) {
        double r678354 = x;
        double r678355 = y;
        double r678356 = 1.0;
        double r678357 = r678355 + r678356;
        double r678358 = r678355 / r678357;
        double r678359 = r678354 * r678358;
        return r678359;
}

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.3
Target0.0
Herbie0.0
\[\begin{array}{l} \mathbf{if}\;y \lt -3693.84827882972468:\\ \;\;\;\;\frac{x}{y \cdot y} - \left(\frac{x}{y} - x\right)\\ \mathbf{elif}\;y \lt 6799310503.41891003:\\ \;\;\;\;\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.3

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

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

    \[\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 2020036 
(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)))