Average Error: 0 → 0
Time: 410.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 r737533 = 1.0;
        double r737534 = 2.0;
        double r737535 = r737533 / r737534;
        double r737536 = x;
        double r737537 = y;
        double r737538 = r737536 + r737537;
        double r737539 = r737535 * r737538;
        return r737539;
}
↓
double f(double x, double y) {
        double r737540 = 1.0;
        double r737541 = 2.0;
        double r737542 = r737540 / r737541;
        double r737543 = x;
        double r737544 = y;
        double r737545 = r737543 + r737544;
        double r737546 = r737542 * r737545;
        return r737546;
}

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