Average Error: 0.0 → 0.0
Time: 3.1s
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 r144907 = x;
        double r144908 = y;
        double r144909 = r144907 * r144908;
        double r144910 = z;
        double r144911 = t;
        double r144912 = r144910 * r144911;
        double r144913 = r144909 + r144912;
        return r144913;
}
↓
double f(double x, double y, double z, double t) {
        double r144914 = x;
        double r144915 = y;
        double r144916 = r144914 * r144915;
        double r144917 = z;
        double r144918 = t;
        double r144919 = r144917 * r144918;
        double r144920 = r144916 + r144919;
        return r144920;
}

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