Average Error: 0.0 → 0.0
Time: 1.4s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r146337 = x;
        double r146338 = y;
        double r146339 = r146337 * r146338;
        double r146340 = z;
        double r146341 = t;
        double r146342 = r146340 * r146341;
        double r146343 = r146339 + r146342;
        return r146343;
}
↓
double f(double x, double y, double z, double t) {
        double r146344 = x;
        double r146345 = y;
        double r146346 = r146344 * r146345;
        double r146347 = z;
        double r146348 = t;
        double r146349 = r146347 * r146348;
        double r146350 = r146346 + r146349;
        return r146350;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019362 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))