Average Error: 0.0 → 0.0
Time: 1.6s
Precision: 64
\[\frac{x}{y + x}\]
↓
\[\frac{x}{y + x}\]
\frac{x}{y + x}
↓
\frac{x}{y + x}
double f(double x, double y) {
        double r210494 = x;
        double r210495 = y;
        double r210496 = r210495 + r210494;
        double r210497 = r210494 / r210496;
        return r210497;
}
↓
double f(double x, double y) {
        double r210498 = x;
        double r210499 = y;
        double r210500 = r210499 + r210498;
        double r210501 = r210498 / r210500;
        return r210501;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  3. Applied *-un-lft-identity0.0

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

  4. Applied *-un-lft-identity0.0

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

  5. Applied times-frac0.0

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

  6. Simplified0.0

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

  7. Final simplification0.0

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

Reproduce

herbie shell --seed 2020001 +o rules:numerics
(FPCore (x y)
  :name "AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, B"
  :precision binary64
  (/ x (+ y x)))