Average Error: 0.0 → 0
Time: 1.5s
Precision: 64
\[x + \frac{y - x}{2}\]
↓
\[0.5 \cdot \left(x + y\right)\]
x + \frac{y - x}{2}
↓
0.5 \cdot \left(x + y\right)
double f(double x, double y) {
        double r547467 = x;
        double r547468 = y;
        double r547469 = r547468 - r547467;
        double r547470 = 2.0;
        double r547471 = r547469 / r547470;
        double r547472 = r547467 + r547471;
        return r547472;
}
↓
double f(double x, double y) {
        double r547473 = 0.5;
        double r547474 = x;
        double r547475 = y;
        double r547476 = r547474 + r547475;
        double r547477 = r547473 * r547476;
        return r547477;
}

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(x + y\right)}\]

  4. Final simplification0

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

Reproduce

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

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

  (+ x (/ (- y x) 2)))