Average Error: 0 → 0
Time: 621.0ms
Precision: 64
\[\frac{1}{2} \cdot \left(x + y\right)\]
↓
\[\frac{1}{2} \cdot \left(x + y\right)\]
\frac{1}{2} \cdot \left(x + y\right)
↓
\frac{1}{2} \cdot \left(x + y\right)
double f(double x, double y) {
        double r683237 = 1.0;
        double r683238 = 2.0;
        double r683239 = r683237 / r683238;
        double r683240 = x;
        double r683241 = y;
        double r683242 = r683240 + r683241;
        double r683243 = r683239 * r683242;
        return r683243;
}
↓
double f(double x, double y) {
        double r683244 = 1.0;
        double r683245 = 2.0;
        double r683246 = r683244 / r683245;
        double r683247 = x;
        double r683248 = y;
        double r683249 = r683247 + r683248;
        double r683250 = r683246 * r683249;
        return r683250;
}

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
Target0
Herbie0
\[\frac{x + y}{2}\]

Derivation

  1. Initial program 0

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

  2. Final simplification0

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

Reproduce

herbie shell --seed 2020045 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"
  :precision binary64

  :herbie-target
  (/ (+ x y) 2)

  (* (/ 1 2) (+ x y)))