Average Error: 0 → 0
Time: 817.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 r476927 = 1.0;
        double r476928 = 2.0;
        double r476929 = r476927 / r476928;
        double r476930 = x;
        double r476931 = y;
        double r476932 = r476930 + r476931;
        double r476933 = r476929 * r476932;
        return r476933;
}
↓
double f(double x, double y) {
        double r476934 = 1.0;
        double r476935 = 2.0;
        double r476936 = r476934 / r476935;
        double r476937 = x;
        double r476938 = y;
        double r476939 = r476937 + r476938;
        double r476940 = r476936 * r476939;
        return r476940;
}

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 2019323 +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)))