Average Error: 0 → 0
Time: 1.4s
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 r476587 = 1.0;
        double r476588 = 2.0;
        double r476589 = r476587 / r476588;
        double r476590 = x;
        double r476591 = y;
        double r476592 = r476590 + r476591;
        double r476593 = r476589 * r476592;
        return r476593;
}
↓
double f(double x, double y) {
        double r476594 = 1.0;
        double r476595 = 2.0;
        double r476596 = r476594 / r476595;
        double r476597 = x;
        double r476598 = y;
        double r476599 = r476597 + r476598;
        double r476600 = r476596 * r476599;
        return r476600;
}

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