Average Error: 0 → 0
Time: 1.0s
Precision: 64
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
↓
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
\frac{1.0}{2.0} \cdot \left(x + y\right)
↓
\frac{1.0}{2.0} \cdot \left(x + y\right)
double f(double x, double y) {
        double r35437157 = 1.0;
        double r35437158 = 2.0;
        double r35437159 = r35437157 / r35437158;
        double r35437160 = x;
        double r35437161 = y;
        double r35437162 = r35437160 + r35437161;
        double r35437163 = r35437159 * r35437162;
        return r35437163;
}
↓
double f(double x, double y) {
        double r35437164 = 1.0;
        double r35437165 = 2.0;
        double r35437166 = r35437164 / r35437165;
        double r35437167 = x;
        double r35437168 = y;
        double r35437169 = r35437167 + r35437168;
        double r35437170 = r35437166 * r35437169;
        return r35437170;
}

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.0}\]

Derivation

  1. Initial program 0

    \[\frac{1.0}{2.0} \cdot \left(x + y\right)\]

  2. Final simplification0

    \[\leadsto \frac{1.0}{2.0} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019165 
(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)))