Average Error: 0.0 → 0.0
Time: 16.2s
Precision: 64
\[\frac{x}{y + x}\]
↓
\[\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{y + x}\right)\right)\]
\frac{x}{y + x}
↓
\mathsf{expm1}\left(\mathsf{log1p}\left(\frac{x}{y + x}\right)\right)
double f(double x, double y) {
        double r251402 = x;
        double r251403 = y;
        double r251404 = r251403 + r251402;
        double r251405 = r251402 / r251404;
        return r251405;
}
↓
double f(double x, double y) {
        double r251406 = x;
        double r251407 = y;
        double r251408 = r251407 + r251406;
        double r251409 = r251406 / r251408;
        double r251410 = log1p(r251409);
        double r251411 = expm1(r251410);
        return r251411;
}

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

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

  4. Final simplification0.0

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

Reproduce

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