Average Error: 0 → 0
Time: 885.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 r43514 = 1.0;
        double r43515 = 2.0;
        double r43516 = r43514 / r43515;
        double r43517 = x;
        double r43518 = y;
        double r43519 = r43517 + r43518;
        double r43520 = r43516 * r43519;
        return r43520;
}
↓
double f(double x, double y) {
        double r43521 = 1.0;
        double r43522 = 2.0;
        double r43523 = r43521 / r43522;
        double r43524 = x;
        double r43525 = y;
        double r43526 = r43524 + r43525;
        double r43527 = r43523 * r43526;
        return r43527;
}

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