Average Error: 0 → 0
Time: 548.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 r1029063 = 1.0;
        double r1029064 = 2.0;
        double r1029065 = r1029063 / r1029064;
        double r1029066 = x;
        double r1029067 = y;
        double r1029068 = r1029066 + r1029067;
        double r1029069 = r1029065 * r1029068;
        return r1029069;
}
↓
double f(double x, double y) {
        double r1029070 = 1.0;
        double r1029071 = 2.0;
        double r1029072 = r1029070 / r1029071;
        double r1029073 = x;
        double r1029074 = y;
        double r1029075 = r1029073 + r1029074;
        double r1029076 = r1029072 * r1029075;
        return r1029076;
}

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