Average Error: 0 → 0
Time: 425.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 r834493 = 1.0;
        double r834494 = 2.0;
        double r834495 = r834493 / r834494;
        double r834496 = x;
        double r834497 = y;
        double r834498 = r834496 + r834497;
        double r834499 = r834495 * r834498;
        return r834499;
}
↓
double f(double x, double y) {
        double r834500 = 1.0;
        double r834501 = 2.0;
        double r834502 = r834500 / r834501;
        double r834503 = x;
        double r834504 = y;
        double r834505 = r834503 + r834504;
        double r834506 = r834502 * r834505;
        return r834506;
}

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