Average Error: 0 → 0
Time: 854.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 r553293 = 1.0;
        double r553294 = 2.0;
        double r553295 = r553293 / r553294;
        double r553296 = x;
        double r553297 = y;
        double r553298 = r553296 + r553297;
        double r553299 = r553295 * r553298;
        return r553299;
}
↓
double f(double x, double y) {
        double r553300 = 1.0;
        double r553301 = 2.0;
        double r553302 = r553300 / r553301;
        double r553303 = x;
        double r553304 = y;
        double r553305 = r553303 + r553304;
        double r553306 = r553302 * r553305;
        return r553306;
}

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