Average Error: 0.0 → 0.0
Time: 4.0s
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 r95587 = x;
        double r95588 = y;
        double r95589 = r95587 * r95588;
        double r95590 = z;
        double r95591 = t;
        double r95592 = r95590 * r95591;
        double r95593 = r95589 + r95592;
        return r95593;
}
↓
double f(double x, double y, double z, double t) {
        double r95594 = x;
        double r95595 = y;
        double r95596 = r95594 * r95595;
        double r95597 = z;
        double r95598 = t;
        double r95599 = r95597 * r95598;
        double r95600 = r95596 + r95599;
        return r95600;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z \cdot t + x \cdot y}\]

  3. Final simplification0.0

    \[\leadsto x \cdot y + z \cdot t\]

Reproduce

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