Average Error: 0.0 → 0.0
Time: 8.1s
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 r176277 = x;
        double r176278 = y;
        double r176279 = r176277 * r176278;
        double r176280 = z;
        double r176281 = t;
        double r176282 = r176280 * r176281;
        double r176283 = r176279 + r176282;
        return r176283;
}
↓
double f(double x, double y, double z, double t) {
        double r176284 = x;
        double r176285 = y;
        double r176286 = r176284 * r176285;
        double r176287 = z;
        double r176288 = t;
        double r176289 = r176287 * r176288;
        double r176290 = r176286 + r176289;
        return r176290;
}

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