Average Error: 0.0 → 0.0
Time: 3.2s
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 r135721 = x;
        double r135722 = y;
        double r135723 = r135721 * r135722;
        double r135724 = z;
        double r135725 = t;
        double r135726 = r135724 * r135725;
        double r135727 = r135723 + r135726;
        return r135727;
}
↓
double f(double x, double y, double z, double t) {
        double r135728 = x;
        double r135729 = y;
        double r135730 = r135728 * r135729;
        double r135731 = z;
        double r135732 = t;
        double r135733 = r135731 * r135732;
        double r135734 = r135730 + r135733;
        return r135734;
}

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 2020034 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  :precision binary64
  (+ (* x y) (* z t)))