Average Error: 0 → 0
Time: 387.0ms
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 r754872 = 1.0;
        double r754873 = 2.0;
        double r754874 = r754872 / r754873;
        double r754875 = x;
        double r754876 = y;
        double r754877 = r754875 + r754876;
        double r754878 = r754874 * r754877;
        return r754878;
}
↓
double f(double x, double y) {
        double r754879 = 1.0;
        double r754880 = 2.0;
        double r754881 = r754879 / r754880;
        double r754882 = x;
        double r754883 = y;
        double r754884 = r754882 + r754883;
        double r754885 = r754881 * r754884;
        return r754885;
}

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 2020060 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"
  :precision binary64

  :herbie-target
  (/ (+ x y) 2)

  (* (/ 1 2) (+ x y)))