Average Error: 0 → 0
Time: 412.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 r849079 = 1.0;
        double r849080 = 2.0;
        double r849081 = r849079 / r849080;
        double r849082 = x;
        double r849083 = y;
        double r849084 = r849082 + r849083;
        double r849085 = r849081 * r849084;
        return r849085;
}
↓
double f(double x, double y) {
        double r849086 = 1.0;
        double r849087 = 2.0;
        double r849088 = r849086 / r849087;
        double r849089 = x;
        double r849090 = y;
        double r849091 = r849089 + r849090;
        double r849092 = r849088 * r849091;
        return r849092;
}

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