Average Error: 0 → 0
Time: 494.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 r722240 = 1.0;
        double r722241 = 2.0;
        double r722242 = r722240 / r722241;
        double r722243 = x;
        double r722244 = y;
        double r722245 = r722243 + r722244;
        double r722246 = r722242 * r722245;
        return r722246;
}
↓
double f(double x, double y) {
        double r722247 = 1.0;
        double r722248 = 2.0;
        double r722249 = r722247 / r722248;
        double r722250 = x;
        double r722251 = y;
        double r722252 = r722250 + r722251;
        double r722253 = r722249 * r722252;
        return r722253;
}

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