Average Error: 0 → 0
Time: 793.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 r483554 = 1.0;
        double r483555 = 2.0;
        double r483556 = r483554 / r483555;
        double r483557 = x;
        double r483558 = y;
        double r483559 = r483557 + r483558;
        double r483560 = r483556 * r483559;
        return r483560;
}
↓
double f(double x, double y) {
        double r483561 = 1.0;
        double r483562 = 2.0;
        double r483563 = r483561 / r483562;
        double r483564 = x;
        double r483565 = y;
        double r483566 = r483564 + r483565;
        double r483567 = r483563 * r483566;
        return r483567;
}

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