Average Error: 0.0 → 0.0
Time: 599.0ms
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 r141668 = x;
        double r141669 = y;
        double r141670 = r141668 * r141669;
        double r141671 = z;
        double r141672 = t;
        double r141673 = r141671 * r141672;
        double r141674 = r141670 + r141673;
        return r141674;
}
↓
double f(double x, double y, double z, double t) {
        double r141675 = x;
        double r141676 = y;
        double r141677 = r141675 * r141676;
        double r141678 = z;
        double r141679 = t;
        double r141680 = r141678 * r141679;
        double r141681 = r141677 + r141680;
        return r141681;
}

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