Average Error: 0 → 0
Time: 385.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 r848444 = 1.0;
        double r848445 = 2.0;
        double r848446 = r848444 / r848445;
        double r848447 = x;
        double r848448 = y;
        double r848449 = r848447 + r848448;
        double r848450 = r848446 * r848449;
        return r848450;
}
↓
double f(double x, double y) {
        double r848451 = 1.0;
        double r848452 = 2.0;
        double r848453 = r848451 / r848452;
        double r848454 = x;
        double r848455 = y;
        double r848456 = r848454 + r848455;
        double r848457 = r848453 * r848456;
        return r848457;
}

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