Average Error: 0 → 0
Time: 1.3s
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 r36139990 = 1.0;
        double r36139991 = 2.0;
        double r36139992 = r36139990 / r36139991;
        double r36139993 = x;
        double r36139994 = y;
        double r36139995 = r36139993 + r36139994;
        double r36139996 = r36139992 * r36139995;
        return r36139996;
}
↓
double f(double x, double y) {
        double r36139997 = 1.0;
        double r36139998 = 2.0;
        double r36139999 = r36139997 / r36139998;
        double r36140000 = x;
        double r36140001 = y;
        double r36140002 = r36140000 + r36140001;
        double r36140003 = r36139999 * r36140002;
        return r36140003;
}

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