Average Error: 0.0 → 0.0
Time: 7.0s
Precision: 64
\[\frac{x}{y + x}\]
↓
\[\mathsf{log1p}\left(\mathsf{expm1}\left(\frac{x}{y + x}\right)\right)\]
\frac{x}{y + x}
↓
\mathsf{log1p}\left(\mathsf{expm1}\left(\frac{x}{y + x}\right)\right)
double f(double x, double y) {
        double r238454 = x;
        double r238455 = y;
        double r238456 = r238455 + r238454;
        double r238457 = r238454 / r238456;
        return r238457;
}
↓
double f(double x, double y) {
        double r238458 = x;
        double r238459 = y;
        double r238460 = r238459 + r238458;
        double r238461 = r238458 / r238460;
        double r238462 = expm1(r238461);
        double r238463 = log1p(r238462);
        return r238463;
}

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 log1p-expm1-u0.0

    \[\leadsto \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(\frac{x}{y + x}\right)\right)}\]

  4. Final simplification0.0

    \[\leadsto \mathsf{log1p}\left(\mathsf{expm1}\left(\frac{x}{y + x}\right)\right)\]

Reproduce

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