Average Error: 0 → 0
Time: 411.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 r748886 = 1.0;
        double r748887 = 2.0;
        double r748888 = r748886 / r748887;
        double r748889 = x;
        double r748890 = y;
        double r748891 = r748889 + r748890;
        double r748892 = r748888 * r748891;
        return r748892;
}
↓
double f(double x, double y) {
        double r748893 = 1.0;
        double r748894 = 2.0;
        double r748895 = r748893 / r748894;
        double r748896 = x;
        double r748897 = y;
        double r748898 = r748896 + r748897;
        double r748899 = r748895 * r748898;
        return r748899;
}

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 2020045 +o rules:numerics
(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)))