Average Error: 0 → 0
Time: 404.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 r709279 = 1.0;
        double r709280 = 2.0;
        double r709281 = r709279 / r709280;
        double r709282 = x;
        double r709283 = y;
        double r709284 = r709282 + r709283;
        double r709285 = r709281 * r709284;
        return r709285;
}
↓
double f(double x, double y) {
        double r709286 = 1.0;
        double r709287 = 2.0;
        double r709288 = r709286 / r709287;
        double r709289 = x;
        double r709290 = y;
        double r709291 = r709289 + r709290;
        double r709292 = r709288 * r709291;
        return r709292;
}

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