Average Error: 0 → 0
Time: 1.0s
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 r13902285 = 1.0;
        double r13902286 = 2.0;
        double r13902287 = r13902285 / r13902286;
        double r13902288 = x;
        double r13902289 = y;
        double r13902290 = r13902288 + r13902289;
        double r13902291 = r13902287 * r13902290;
        return r13902291;
}
↓
double f(double x, double y) {
        double r13902292 = 1.0;
        double r13902293 = 2.0;
        double r13902294 = r13902292 / r13902293;
        double r13902295 = x;
        double r13902296 = y;
        double r13902297 = r13902295 + r13902296;
        double r13902298 = r13902294 * r13902297;
        return r13902298;
}

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