Average Error: 0.0 → 0.0
Time: 13.8s
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 r88557 = x;
        double r88558 = y;
        double r88559 = r88557 * r88558;
        double r88560 = z;
        double r88561 = t;
        double r88562 = r88560 * r88561;
        double r88563 = r88559 + r88562;
        return r88563;
}
↓
double f(double x, double y, double z, double t) {
        double r88564 = x;
        double r88565 = y;
        double r88566 = r88564 * r88565;
        double r88567 = z;
        double r88568 = t;
        double r88569 = r88567 * r88568;
        double r88570 = r88566 + r88569;
        return r88570;
}

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