Average Error: 0 → 0
Time: 910.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 r77257 = 1.0;
        double r77258 = 2.0;
        double r77259 = r77257 / r77258;
        double r77260 = x;
        double r77261 = y;
        double r77262 = r77260 + r77261;
        double r77263 = r77259 * r77262;
        return r77263;
}
↓
double f(double x, double y) {
        double r77264 = 1.0;
        double r77265 = 2.0;
        double r77266 = r77264 / r77265;
        double r77267 = x;
        double r77268 = y;
        double r77269 = r77267 + r77268;
        double r77270 = r77266 * r77269;
        return r77270;
}

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