Average Error: 0.0 → 0.0
Time: 4.0s
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 r142660 = x;
        double r142661 = y;
        double r142662 = r142660 * r142661;
        double r142663 = z;
        double r142664 = t;
        double r142665 = r142663 * r142664;
        double r142666 = r142662 + r142665;
        return r142666;
}
↓
double f(double x, double y, double z, double t) {
        double r142667 = x;
        double r142668 = y;
        double r142669 = r142667 * r142668;
        double r142670 = z;
        double r142671 = t;
        double r142672 = r142670 * r142671;
        double r142673 = r142669 + r142672;
        return r142673;
}

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