Average Error: 0.0 → 0
Time: 3.4s
Precision: 64
\[x + \frac{y - x}{2}\]
↓
\[\left(x + y\right) \cdot 0.5\]
x + \frac{y - x}{2}
↓
\left(x + y\right) \cdot 0.5
double f(double x, double y) {
        double r26713777 = x;
        double r26713778 = y;
        double r26713779 = r26713778 - r26713777;
        double r26713780 = 2.0;
        double r26713781 = r26713779 / r26713780;
        double r26713782 = r26713777 + r26713781;
        return r26713782;
}
↓
double f(double x, double y) {
        double r26713783 = x;
        double r26713784 = y;
        double r26713785 = r26713783 + r26713784;
        double r26713786 = 0.5;
        double r26713787 = r26713785 * r26713786;
        return r26713787;
}

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

Reproduce

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