Average Error: 0 → 0
Time: 400.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 r272408 = 1.0;
        double r272409 = 2.0;
        double r272410 = r272408 / r272409;
        double r272411 = x;
        double r272412 = y;
        double r272413 = r272411 + r272412;
        double r272414 = r272410 * r272413;
        return r272414;
}
↓
double f(double x, double y) {
        double r272415 = 1.0;
        double r272416 = 2.0;
        double r272417 = r272415 / r272416;
        double r272418 = x;
        double r272419 = y;
        double r272420 = r272418 + r272419;
        double r272421 = r272417 * r272420;
        return r272421;
}

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