Average Error: 0 → 0
Time: 978.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 r465403 = 1.0;
        double r465404 = 2.0;
        double r465405 = r465403 / r465404;
        double r465406 = x;
        double r465407 = y;
        double r465408 = r465406 + r465407;
        double r465409 = r465405 * r465408;
        return r465409;
}
↓
double f(double x, double y) {
        double r465410 = 1.0;
        double r465411 = 2.0;
        double r465412 = r465410 / r465411;
        double r465413 = x;
        double r465414 = y;
        double r465415 = r465413 + r465414;
        double r465416 = r465412 * r465415;
        return r465416;
}

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