Average Error: 0.0 → 0.0
Time: 10.9s
Precision: 64
\[\frac{x + y}{10}\]
↓
\[\frac{x + y}{10}\]
\frac{x + y}{10}
↓
\frac{x + y}{10}
double f(double x, double y) {
        double r12250 = x;
        double r12251 = y;
        double r12252 = r12250 + r12251;
        double r12253 = 10.0;
        double r12254 = r12252 / r12253;
        return r12254;
}
↓
double f(double x, double y) {
        double r12255 = x;
        double r12256 = y;
        double r12257 = r12255 + r12256;
        double r12258 = 10.0;
        double r12259 = r12257 / r12258;
        return r12259;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\frac{x + y}{10}\]

  2. Final simplification0.0

    \[\leadsto \frac{x + y}{10}\]

Reproduce

herbie shell --seed 2019325 
(FPCore (x y)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A"
  :precision binary64
  (/ (+ x y) 10))