Average Error: 0 → 0
Time: 919.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 r450852 = 1.0;
        double r450853 = 2.0;
        double r450854 = r450852 / r450853;
        double r450855 = x;
        double r450856 = y;
        double r450857 = r450855 + r450856;
        double r450858 = r450854 * r450857;
        return r450858;
}
↓
double f(double x, double y) {
        double r450859 = 1.0;
        double r450860 = 2.0;
        double r450861 = r450859 / r450860;
        double r450862 = x;
        double r450863 = y;
        double r450864 = r450862 + r450863;
        double r450865 = r450861 * r450864;
        return r450865;
}

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