Average Error: 0 → 0
Time: 1.4s
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 r1251267 = 1.0;
        double r1251268 = 2.0;
        double r1251269 = r1251267 / r1251268;
        double r1251270 = x;
        double r1251271 = y;
        double r1251272 = r1251270 + r1251271;
        double r1251273 = r1251269 * r1251272;
        return r1251273;
}
↓
double f(double x, double y) {
        double r1251274 = 1.0;
        double r1251275 = 2.0;
        double r1251276 = r1251274 / r1251275;
        double r1251277 = x;
        double r1251278 = y;
        double r1251279 = r1251277 + r1251278;
        double r1251280 = r1251276 * r1251279;
        return r1251280;
}

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 2019199 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

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

  (* (/ 1.0 2.0) (+ x y)))