Average Error: 0 → 0
Time: 436.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 r733845 = 1.0;
        double r733846 = 2.0;
        double r733847 = r733845 / r733846;
        double r733848 = x;
        double r733849 = y;
        double r733850 = r733848 + r733849;
        double r733851 = r733847 * r733850;
        return r733851;
}
↓
double f(double x, double y) {
        double r733852 = 1.0;
        double r733853 = 2.0;
        double r733854 = r733852 / r733853;
        double r733855 = x;
        double r733856 = y;
        double r733857 = r733855 + r733856;
        double r733858 = r733854 * r733857;
        return r733858;
}

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