Average Error: 0.0 → 0
Time: 1.0s
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 r2099 = x;
        double r2100 = y;
        double r2101 = r2100 - r2099;
        double r2102 = 2.0;
        double r2103 = r2101 / r2102;
        double r2104 = r2099 + r2103;
        return r2104;
}
↓
double f(double x, double y) {
        double r2105 = 0.5;
        double r2106 = x;
        double r2107 = y;
        double r2108 = r2106 + r2107;
        double r2109 = r2105 * r2108;
        return r2109;
}

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