Average Error: 7.8 → 0.0
Time: 4.9s
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 r699896 = x;
        double r699897 = y;
        double r699898 = r699896 * r699897;
        double r699899 = 1.0;
        double r699900 = r699897 + r699899;
        double r699901 = r699898 / r699900;
        return r699901;
}
↓
double f(double x, double y) {
        double r699902 = x;
        double r699903 = y;
        double r699904 = 1.0;
        double r699905 = r699903 + r699904;
        double r699906 = r699903 / r699905;
        double r699907 = r699902 * r699906;
        return r699907;
}

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.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 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 2020046 +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)))