Average Error: 0 → 0
Time: 843.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 r556476 = 1.0;
        double r556477 = 2.0;
        double r556478 = r556476 / r556477;
        double r556479 = x;
        double r556480 = y;
        double r556481 = r556479 + r556480;
        double r556482 = r556478 * r556481;
        return r556482;
}
↓
double f(double x, double y) {
        double r556483 = 1.0;
        double r556484 = 2.0;
        double r556485 = r556483 / r556484;
        double r556486 = x;
        double r556487 = y;
        double r556488 = r556486 + r556487;
        double r556489 = r556485 * r556488;
        return r556489;
}

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