Average Error: 0 → 0
Time: 459.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 r654698 = 1.0;
        double r654699 = 2.0;
        double r654700 = r654698 / r654699;
        double r654701 = x;
        double r654702 = y;
        double r654703 = r654701 + r654702;
        double r654704 = r654700 * r654703;
        return r654704;
}
↓
double f(double x, double y) {
        double r654705 = 1.0;
        double r654706 = 2.0;
        double r654707 = r654705 / r654706;
        double r654708 = x;
        double r654709 = y;
        double r654710 = r654708 + r654709;
        double r654711 = r654707 * r654710;
        return r654711;
}

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