Average Error: 0.0 → 0.0
Time: 10.3s
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 r99661 = x;
        double r99662 = y;
        double r99663 = r99661 * r99662;
        double r99664 = z;
        double r99665 = t;
        double r99666 = r99664 * r99665;
        double r99667 = r99663 + r99666;
        return r99667;
}
↓
double f(double x, double y, double z, double t) {
        double r99668 = x;
        double r99669 = y;
        double r99670 = r99668 * r99669;
        double r99671 = z;
        double r99672 = t;
        double r99673 = r99671 * r99672;
        double r99674 = r99670 + r99673;
        return r99674;
}

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