Average Error: 0.0 → 0
Time: 976.0ms
Precision: 64
\[x + \frac{y - x}{2}\]
\[\frac{1}{2} \cdot \left(x + y\right)\]
x + \frac{y - x}{2}
\frac{1}{2} \cdot \left(x + y\right)
double f(double x, double y) {
        double r384538 = x;
        double r384539 = y;
        double r384540 = r384539 - r384538;
        double r384541 = 2.0;
        double r384542 = r384540 / r384541;
        double r384543 = r384538 + r384542;
        return r384543;
}

double f(double x, double y) {
        double r384544 = 1.0;
        double r384545 = 2.0;
        double r384546 = r384544 / r384545;
        double r384547 = x;
        double r384548 = y;
        double r384549 = r384547 + r384548;
        double r384550 = r384546 * r384549;
        return r384550;
}

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}{\frac{1}{2} \cdot \left(x + y\right)}\]
  4. Final simplification0

    \[\leadsto \frac{1}{2} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019304 
(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)))