Average Error: 0.0 → 0.0
Time: 2.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 r101850 = x;
        double r101851 = y;
        double r101852 = r101850 * r101851;
        double r101853 = z;
        double r101854 = t;
        double r101855 = r101853 * r101854;
        double r101856 = r101852 + r101855;
        return r101856;
}
↓
double f(double x, double y, double z, double t) {
        double r101857 = x;
        double r101858 = y;
        double r101859 = r101857 * r101858;
        double r101860 = z;
        double r101861 = t;
        double r101862 = r101860 * r101861;
        double r101863 = r101859 + r101862;
        return r101863;
}

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