Average Error: 0.0 → 0.0
Time: 6.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 r5511366 = x;
        double r5511367 = y;
        double r5511368 = r5511366 * r5511367;
        double r5511369 = z;
        double r5511370 = t;
        double r5511371 = r5511369 * r5511370;
        double r5511372 = r5511368 + r5511371;
        return r5511372;
}
↓
double f(double x, double y, double z, double t) {
        double r5511373 = z;
        double r5511374 = t;
        double r5511375 = r5511373 * r5511374;
        double r5511376 = x;
        double r5511377 = y;
        double r5511378 = r5511376 * r5511377;
        double r5511379 = r5511375 + r5511378;
        return r5511379;
}

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