Average Error: 0 → 0
Time: 885.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 r42564 = 1.0;
        double r42565 = 2.0;
        double r42566 = r42564 / r42565;
        double r42567 = x;
        double r42568 = y;
        double r42569 = r42567 + r42568;
        double r42570 = r42566 * r42569;
        return r42570;
}
↓
double f(double x, double y) {
        double r42571 = 1.0;
        double r42572 = 2.0;
        double r42573 = r42571 / r42572;
        double r42574 = x;
        double r42575 = y;
        double r42576 = r42574 + r42575;
        double r42577 = r42573 * r42576;
        return r42577;
}

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