Average Error: 0.0 → 0.0
Time: 3.8s
Precision: 64
\[x \cdot y + z\]
\[x \cdot y + z\]
x \cdot y + z
x \cdot y + z
double f(double x, double y, double z) {
        double r1037381 = x;
        double r1037382 = y;
        double r1037383 = r1037381 * r1037382;
        double r1037384 = z;
        double r1037385 = r1037383 + r1037384;
        return r1037385;
}

double f(double x, double y, double z) {
        double r1037386 = x;
        double r1037387 = y;
        double r1037388 = r1037386 * r1037387;
        double r1037389 = z;
        double r1037390 = r1037388 + r1037389;
        return r1037390;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z\]
  2. Final simplification0.0

    \[\leadsto x \cdot y + z\]

Reproduce

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