Average Error: 0.0 → 0
Time: 7.7s
Precision: 64
\[x + \frac{y - x}{2.0}\]
↓
\[\left(y + x\right) \cdot 0.5\]
x + \frac{y - x}{2.0}
↓
\left(y + x\right) \cdot 0.5
double f(double x, double y) {
        double r11776919 = x;
        double r11776920 = y;
        double r11776921 = r11776920 - r11776919;
        double r11776922 = 2.0;
        double r11776923 = r11776921 / r11776922;
        double r11776924 = r11776919 + r11776923;
        return r11776924;
}
↓
double f(double x, double y) {
        double r11776925 = y;
        double r11776926 = x;
        double r11776927 = r11776925 + r11776926;
        double r11776928 = 0.5;
        double r11776929 = r11776927 * r11776928;
        return r11776929;
}

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.0}\]

  2. Taylor expanded around 0 0

    \[\leadsto \color{blue}{0.5 \cdot x + 0.5 \cdot y}\]

  3. Simplified0

    \[\leadsto \color{blue}{\left(x + y\right) \cdot 0.5}\]

  4. Final simplification0

    \[\leadsto \left(y + x\right) \cdot 0.5\]

Reproduce

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