Average Error: 0 → 0
Time: 1.4s
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 r494909 = 1.0;
        double r494910 = 2.0;
        double r494911 = r494909 / r494910;
        double r494912 = x;
        double r494913 = y;
        double r494914 = r494912 + r494913;
        double r494915 = r494911 * r494914;
        return r494915;
}
↓
double f(double x, double y) {
        double r494916 = 1.0;
        double r494917 = 2.0;
        double r494918 = r494916 / r494917;
        double r494919 = x;
        double r494920 = y;
        double r494921 = r494919 + r494920;
        double r494922 = r494918 * r494921;
        return r494922;
}

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