Average Error: 0 → 0
Time: 398.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 r718603 = 1.0;
        double r718604 = 2.0;
        double r718605 = r718603 / r718604;
        double r718606 = x;
        double r718607 = y;
        double r718608 = r718606 + r718607;
        double r718609 = r718605 * r718608;
        return r718609;
}
↓
double f(double x, double y) {
        double r718610 = 1.0;
        double r718611 = 2.0;
        double r718612 = r718610 / r718611;
        double r718613 = x;
        double r718614 = y;
        double r718615 = r718613 + r718614;
        double r718616 = r718612 * r718615;
        return r718616;
}

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 2020064 +o rules:numerics
(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)))