Average Error: 0 → 0
Time: 391.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 r648272 = 1.0;
        double r648273 = 2.0;
        double r648274 = r648272 / r648273;
        double r648275 = x;
        double r648276 = y;
        double r648277 = r648275 + r648276;
        double r648278 = r648274 * r648277;
        return r648278;
}
↓
double f(double x, double y) {
        double r648279 = 1.0;
        double r648280 = 2.0;
        double r648281 = r648279 / r648280;
        double r648282 = x;
        double r648283 = y;
        double r648284 = r648282 + r648283;
        double r648285 = r648281 * r648284;
        return r648285;
}

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