Average Error: 0.0 → 0.0
Time: 3.4s
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 r190153 = x;
        double r190154 = y;
        double r190155 = r190153 * r190154;
        double r190156 = z;
        double r190157 = t;
        double r190158 = r190156 * r190157;
        double r190159 = r190155 + r190158;
        return r190159;
}
↓
double f(double x, double y, double z, double t) {
        double r190160 = x;
        double r190161 = y;
        double r190162 = r190160 * r190161;
        double r190163 = z;
        double r190164 = t;
        double r190165 = r190163 * r190164;
        double r190166 = r190162 + r190165;
        return r190166;
}

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