Average Error: 0.0 → 0.0
Time: 10.3s
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 r118036 = x;
        double r118037 = y;
        double r118038 = r118036 * r118037;
        double r118039 = z;
        double r118040 = t;
        double r118041 = r118039 * r118040;
        double r118042 = r118038 + r118041;
        return r118042;
}
↓
double f(double x, double y, double z, double t) {
        double r118043 = x;
        double r118044 = y;
        double r118045 = r118043 * r118044;
        double r118046 = z;
        double r118047 = t;
        double r118048 = r118046 * r118047;
        double r118049 = r118045 + r118048;
        return r118049;
}

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