Average Error: 0 → 0
Time: 1.0s
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 r1411952 = 1.0;
        double r1411953 = 2.0;
        double r1411954 = r1411952 / r1411953;
        double r1411955 = x;
        double r1411956 = y;
        double r1411957 = r1411955 + r1411956;
        double r1411958 = r1411954 * r1411957;
        return r1411958;
}
↓
double f(double x, double y) {
        double r1411959 = 1.0;
        double r1411960 = 2.0;
        double r1411961 = r1411959 / r1411960;
        double r1411962 = x;
        double r1411963 = y;
        double r1411964 = r1411962 + r1411963;
        double r1411965 = r1411961 * r1411964;
        return r1411965;
}

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