Average Error: 0.0 → 0.0
Time: 6.5s
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 r126764 = x;
        double r126765 = y;
        double r126766 = r126764 * r126765;
        double r126767 = z;
        double r126768 = t;
        double r126769 = r126767 * r126768;
        double r126770 = r126766 + r126769;
        return r126770;
}
↓
double f(double x, double y, double z, double t) {
        double r126771 = x;
        double r126772 = y;
        double r126773 = r126771 * r126772;
        double r126774 = z;
        double r126775 = t;
        double r126776 = r126774 * r126775;
        double r126777 = r126773 + r126776;
        return r126777;
}

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