Average Error: 0 → 0
Time: 387.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 r717244 = 1.0;
        double r717245 = 2.0;
        double r717246 = r717244 / r717245;
        double r717247 = x;
        double r717248 = y;
        double r717249 = r717247 + r717248;
        double r717250 = r717246 * r717249;
        return r717250;
}
↓
double f(double x, double y) {
        double r717251 = 1.0;
        double r717252 = 2.0;
        double r717253 = r717251 / r717252;
        double r717254 = x;
        double r717255 = y;
        double r717256 = r717254 + r717255;
        double r717257 = r717253 * r717256;
        return r717257;
}

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