Average Error: 0 → 0
Time: 652.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 r770565 = 1.0;
        double r770566 = 2.0;
        double r770567 = r770565 / r770566;
        double r770568 = x;
        double r770569 = y;
        double r770570 = r770568 + r770569;
        double r770571 = r770567 * r770570;
        return r770571;
}
↓
double f(double x, double y) {
        double r770572 = 1.0;
        double r770573 = 2.0;
        double r770574 = r770572 / r770573;
        double r770575 = x;
        double r770576 = y;
        double r770577 = r770575 + r770576;
        double r770578 = r770574 * r770577;
        return r770578;
}

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