Average Error: 0 → 0
Time: 921.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 r36267 = 1.0;
        double r36268 = 2.0;
        double r36269 = r36267 / r36268;
        double r36270 = x;
        double r36271 = y;
        double r36272 = r36270 + r36271;
        double r36273 = r36269 * r36272;
        return r36273;
}
↓
double f(double x, double y) {
        double r36274 = 1.0;
        double r36275 = 2.0;
        double r36276 = r36274 / r36275;
        double r36277 = x;
        double r36278 = y;
        double r36279 = r36277 + r36278;
        double r36280 = r36276 * r36279;
        return r36280;
}

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