Average Error: 0.0 → 0.0
Time: 5.9s
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 r162825 = x;
        double r162826 = y;
        double r162827 = r162825 * r162826;
        double r162828 = z;
        double r162829 = t;
        double r162830 = r162828 * r162829;
        double r162831 = r162827 + r162830;
        return r162831;
}
↓
double f(double x, double y, double z, double t) {
        double r162832 = x;
        double r162833 = y;
        double r162834 = r162832 * r162833;
        double r162835 = z;
        double r162836 = t;
        double r162837 = r162835 * r162836;
        double r162838 = r162834 + r162837;
        return r162838;
}

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