Average Error: 0.0 → 0.0
Time: 3.7s
Precision: 64
\[x + a \cdot b\]
\[x + a \cdot b\]
x + a \cdot b
x + a \cdot b
double f(double x, double a, double b) {
        double r53158 = x;
        double r53159 = a;
        double r53160 = b;
        double r53161 = r53159 * r53160;
        double r53162 = r53158 + r53161;
        return r53162;
}

double f(double x, double a, double b) {
        double r53163 = x;
        double r53164 = a;
        double r53165 = b;
        double r53166 = r53164 * r53165;
        double r53167 = r53163 + r53166;
        return r53167;
}

Error

Bits error versus x

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x + a \cdot b\]
  2. Final simplification0.0

    \[\leadsto x + a \cdot b\]

Reproduce

herbie shell --seed 1 
(FPCore (x a b)
  :name "x + a*b"
  :precision binary64
  (+ x (* a b)))