Average Error: 0 → 0
Time: 419.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 r908338 = 1.0;
        double r908339 = 2.0;
        double r908340 = r908338 / r908339;
        double r908341 = x;
        double r908342 = y;
        double r908343 = r908341 + r908342;
        double r908344 = r908340 * r908343;
        return r908344;
}
↓
double f(double x, double y) {
        double r908345 = 1.0;
        double r908346 = 2.0;
        double r908347 = r908345 / r908346;
        double r908348 = x;
        double r908349 = y;
        double r908350 = r908348 + r908349;
        double r908351 = r908347 * r908350;
        return r908351;
}

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 2020046 
(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)))