Average Error: 0.0 → 0
Time: 3.4s
Precision: 64
\[x + \frac{y - x}{2}\]
↓
\[\left(y + x\right) \cdot 0.5\]
x + \frac{y - x}{2}
↓
\left(y + x\right) \cdot 0.5
double f(double x, double y) {
        double r18578190 = x;
        double r18578191 = y;
        double r18578192 = r18578191 - r18578190;
        double r18578193 = 2.0;
        double r18578194 = r18578192 / r18578193;
        double r18578195 = r18578190 + r18578194;
        return r18578195;
}
↓
double f(double x, double y) {
        double r18578196 = y;
        double r18578197 = x;
        double r18578198 = r18578196 + r18578197;
        double r18578199 = 0.5;
        double r18578200 = r18578198 * r18578199;
        return r18578200;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0
Herbie0
\[0.5 \cdot \left(x + y\right)\]

Derivation

  1. Initial program 0.0

    \[x + \frac{y - x}{2}\]

  2. Taylor expanded around 0 0

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

  3. Simplified0

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

  4. Final simplification0

    \[\leadsto \left(y + x\right) \cdot 0.5\]

Reproduce

herbie shell --seed 2019172 +o rules:numerics
(FPCore (x y)
  :name "Numeric.Interval.Internal:bisect from intervals-0.7.1, A"

  :herbie-target
  (* 0.5 (+ x y))

  (+ x (/ (- y x) 2.0)))