Average Error: 0.0 → 0.0
Time: 1.6s
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 r123963 = x;
        double r123964 = y;
        double r123965 = r123963 * r123964;
        double r123966 = z;
        double r123967 = t;
        double r123968 = r123966 * r123967;
        double r123969 = r123965 + r123968;
        return r123969;
}
↓
double f(double x, double y, double z, double t) {
        double r123970 = x;
        double r123971 = y;
        double r123972 = r123970 * r123971;
        double r123973 = z;
        double r123974 = t;
        double r123975 = r123973 * r123974;
        double r123976 = r123972 + r123975;
        return r123976;
}

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