Average Error: 7.8 → 0.0
Time: 6.1s
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 r737224 = x;
        double r737225 = y;
        double r737226 = r737224 * r737225;
        double r737227 = 1.0;
        double r737228 = r737225 + r737227;
        double r737229 = r737226 / r737228;
        return r737229;
}
↓
double f(double x, double y) {
        double r737230 = x;
        double r737231 = y;
        double r737232 = 1.0;
        double r737233 = r737231 + r737232;
        double r737234 = r737231 / r737233;
        double r737235 = r737230 * r737234;
        return r737235;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original7.8
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 7.8

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

  3. Applied *-un-lft-identity7.8

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