Average Error: 0.0 → 0.0
Time: 34.8s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[z \cdot t + x \cdot y\]
x \cdot y + z \cdot t
↓
z \cdot t + x \cdot y
double f(double x, double y, double z, double t) {
        double r9936276 = x;
        double r9936277 = y;
        double r9936278 = r9936276 * r9936277;
        double r9936279 = z;
        double r9936280 = t;
        double r9936281 = r9936279 * r9936280;
        double r9936282 = r9936278 + r9936281;
        return r9936282;
}
↓
double f(double x, double y, double z, double t) {
        double r9936283 = z;
        double r9936284 = t;
        double r9936285 = r9936283 * r9936284;
        double r9936286 = x;
        double r9936287 = y;
        double r9936288 = r9936286 * r9936287;
        double r9936289 = r9936285 + r9936288;
        return r9936289;
}

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 z \cdot t + x \cdot y\]

Reproduce

herbie shell --seed 2019162 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))