Average Error: 0 → 0
Time: 2.7s
Precision: 64
\[\frac{1}{2} \cdot \left(x + y\right)\]
↓
\[\left(y + x\right) \cdot \frac{1}{2}\]
\frac{1}{2} \cdot \left(x + y\right)
↓
\left(y + x\right) \cdot \frac{1}{2}
double f(double x, double y) {
        double r26285381 = 1.0;
        double r26285382 = 2.0;
        double r26285383 = r26285381 / r26285382;
        double r26285384 = x;
        double r26285385 = y;
        double r26285386 = r26285384 + r26285385;
        double r26285387 = r26285383 * r26285386;
        return r26285387;
}
↓
double f(double x, double y) {
        double r26285388 = y;
        double r26285389 = x;
        double r26285390 = r26285388 + r26285389;
        double r26285391 = 1.0;
        double r26285392 = 2.0;
        double r26285393 = r26285391 / r26285392;
        double r26285394 = r26285390 * r26285393;
        return r26285394;
}

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 \left(y + x\right) \cdot \frac{1}{2}\]

Reproduce

herbie shell --seed 2019200 +o rules:numerics
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))