Average Error: 0 → 0
Time: 2.2s
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 r37632297 = 1.0;
        double r37632298 = 2.0;
        double r37632299 = r37632297 / r37632298;
        double r37632300 = x;
        double r37632301 = y;
        double r37632302 = r37632300 + r37632301;
        double r37632303 = r37632299 * r37632302;
        return r37632303;
}
↓
double f(double x, double y) {
        double r37632304 = 1.0;
        double r37632305 = 2.0;
        double r37632306 = r37632304 / r37632305;
        double r37632307 = x;
        double r37632308 = y;
        double r37632309 = r37632307 + r37632308;
        double r37632310 = r37632306 * r37632309;
        return r37632310;
}

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