Average Error: 0 → 0
Time: 544.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 r653957 = 1.0;
        double r653958 = 2.0;
        double r653959 = r653957 / r653958;
        double r653960 = x;
        double r653961 = y;
        double r653962 = r653960 + r653961;
        double r653963 = r653959 * r653962;
        return r653963;
}
↓
double f(double x, double y) {
        double r653964 = 1.0;
        double r653965 = 2.0;
        double r653966 = r653964 / r653965;
        double r653967 = x;
        double r653968 = y;
        double r653969 = r653967 + r653968;
        double r653970 = r653966 * r653969;
        return r653970;
}

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