Average Error: 0.0 → 0
Time: 539.0ms
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 r446368 = x;
        double r446369 = y;
        double r446370 = r446369 - r446368;
        double r446371 = 2.0;
        double r446372 = r446370 / r446371;
        double r446373 = r446368 + r446372;
        return r446373;
}
↓
double f(double x, double y) {
        double r446374 = 0.5;
        double r446375 = x;
        double r446376 = y;
        double r446377 = r446375 + r446376;
        double r446378 = r446374 * r446377;
        return r446378;
}

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 2020056 
(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)))