Average Error: 0.0 → 0.0
Time: 1.7s
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 r118940 = x;
        double r118941 = y;
        double r118942 = r118940 * r118941;
        double r118943 = z;
        double r118944 = t;
        double r118945 = r118943 * r118944;
        double r118946 = r118942 + r118945;
        return r118946;
}
↓
double f(double x, double y, double z, double t) {
        double r118947 = x;
        double r118948 = y;
        double r118949 = r118947 * r118948;
        double r118950 = z;
        double r118951 = t;
        double r118952 = r118950 * r118951;
        double r118953 = r118949 + r118952;
        return r118953;
}

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