Average Error: 0 → 0
Time: 961.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 r473942 = 1.0;
        double r473943 = 2.0;
        double r473944 = r473942 / r473943;
        double r473945 = x;
        double r473946 = y;
        double r473947 = r473945 + r473946;
        double r473948 = r473944 * r473947;
        return r473948;
}
↓
double f(double x, double y) {
        double r473949 = 1.0;
        double r473950 = 2.0;
        double r473951 = r473949 / r473950;
        double r473952 = x;
        double r473953 = y;
        double r473954 = r473952 + r473953;
        double r473955 = r473951 * r473954;
        return r473955;
}

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