Average Error: 0 → 0
Time: 825.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 r485911 = 1.0;
        double r485912 = 2.0;
        double r485913 = r485911 / r485912;
        double r485914 = x;
        double r485915 = y;
        double r485916 = r485914 + r485915;
        double r485917 = r485913 * r485916;
        return r485917;
}
↓
double f(double x, double y) {
        double r485918 = 1.0;
        double r485919 = 2.0;
        double r485920 = r485918 / r485919;
        double r485921 = x;
        double r485922 = y;
        double r485923 = r485921 + r485922;
        double r485924 = r485920 * r485923;
        return r485924;
}

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