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 r607875 = x;
        double r607876 = y;
        double r607877 = r607875 * r607876;
        double r607878 = 1.0;
        double r607879 = r607876 + r607878;
        double r607880 = r607877 / r607879;
        return r607880;
}
↓
double f(double x, double y) {
        double r607881 = x;
        double r607882 = y;
        double r607883 = 1.0;
        double r607884 = r607882 + r607883;
        double r607885 = r607882 / r607884;
        double r607886 = r607881 * r607885;
        return r607886;
}

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)))