Average Error: 0 → 0
Time: 525.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 r793603 = 1.0;
        double r793604 = 2.0;
        double r793605 = r793603 / r793604;
        double r793606 = x;
        double r793607 = y;
        double r793608 = r793606 + r793607;
        double r793609 = r793605 * r793608;
        return r793609;
}
↓
double f(double x, double y) {
        double r793610 = 1.0;
        double r793611 = 2.0;
        double r793612 = r793610 / r793611;
        double r793613 = x;
        double r793614 = y;
        double r793615 = r793613 + r793614;
        double r793616 = r793612 * r793615;
        return r793616;
}

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