Average Error: 0.0 → 0
Time: 16.8s
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 r75372207 = x;
        double r75372208 = y;
        double r75372209 = r75372208 - r75372207;
        double r75372210 = 2.0;
        double r75372211 = r75372209 / r75372210;
        double r75372212 = r75372207 + r75372211;
        return r75372212;
}
↓
double f(double x, double y) {
        double r75372213 = 0.5;
        double r75372214 = x;
        double r75372215 = y;
        double r75372216 = r75372214 + r75372215;
        double r75372217 = r75372213 * r75372216;
        return r75372217;
}

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 2019173 +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)))