Average Error: 0 → 0
Time: 991.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 r492351 = 1.0;
        double r492352 = 2.0;
        double r492353 = r492351 / r492352;
        double r492354 = x;
        double r492355 = y;
        double r492356 = r492354 + r492355;
        double r492357 = r492353 * r492356;
        return r492357;
}
↓
double f(double x, double y) {
        double r492358 = 1.0;
        double r492359 = 2.0;
        double r492360 = r492358 / r492359;
        double r492361 = x;
        double r492362 = y;
        double r492363 = r492361 + r492362;
        double r492364 = r492360 * r492363;
        return r492364;
}

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