Average Error: 0 → 0
Time: 2.4s
Precision: 64
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
↓
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
\frac{1.0}{2.0} \cdot \left(x + y\right)
↓
\frac{1.0}{2.0} \cdot \left(x + y\right)
double f(double x, double y) {
        double r33299339 = 1.0;
        double r33299340 = 2.0;
        double r33299341 = r33299339 / r33299340;
        double r33299342 = x;
        double r33299343 = y;
        double r33299344 = r33299342 + r33299343;
        double r33299345 = r33299341 * r33299344;
        return r33299345;
}
↓
double f(double x, double y) {
        double r33299346 = 1.0;
        double r33299347 = 2.0;
        double r33299348 = r33299346 / r33299347;
        double r33299349 = x;
        double r33299350 = y;
        double r33299351 = r33299349 + r33299350;
        double r33299352 = r33299348 * r33299351;
        return r33299352;
}

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.0}\]

Derivation

  1. Initial program 0

    \[\frac{1.0}{2.0} \cdot \left(x + y\right)\]

  2. Final simplification0

    \[\leadsto \frac{1.0}{2.0} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019165 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))