Average Error: 0.0 → 0.0
Time: 7.6s
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 r124862 = x;
        double r124863 = y;
        double r124864 = r124862 * r124863;
        double r124865 = z;
        double r124866 = t;
        double r124867 = r124865 * r124866;
        double r124868 = r124864 + r124867;
        return r124868;
}
↓
double f(double x, double y, double z, double t) {
        double r124869 = x;
        double r124870 = y;
        double r124871 = r124869 * r124870;
        double r124872 = z;
        double r124873 = t;
        double r124874 = r124872 * r124873;
        double r124875 = r124871 + r124874;
        return r124875;
}

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