Average Error: 0.0 → 0
Time: 3.8s
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 r26913497 = x;
        double r26913498 = y;
        double r26913499 = r26913498 - r26913497;
        double r26913500 = 2.0;
        double r26913501 = r26913499 / r26913500;
        double r26913502 = r26913497 + r26913501;
        return r26913502;
}
↓
double f(double x, double y) {
        double r26913503 = x;
        double r26913504 = y;
        double r26913505 = r26913503 + r26913504;
        double r26913506 = 0.5;
        double r26913507 = r26913505 * r26913506;
        return r26913507;
}

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