Average Error: 0 → 0
Time: 384.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 r810299 = 1.0;
        double r810300 = 2.0;
        double r810301 = r810299 / r810300;
        double r810302 = x;
        double r810303 = y;
        double r810304 = r810302 + r810303;
        double r810305 = r810301 * r810304;
        return r810305;
}
↓
double f(double x, double y) {
        double r810306 = 1.0;
        double r810307 = 2.0;
        double r810308 = r810306 / r810307;
        double r810309 = x;
        double r810310 = y;
        double r810311 = r810309 + r810310;
        double r810312 = r810308 * r810311;
        return r810312;
}

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