Average Error: 0.0 → 0.0
Time: 3.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 r100940 = x;
        double r100941 = y;
        double r100942 = r100940 * r100941;
        double r100943 = z;
        double r100944 = t;
        double r100945 = r100943 * r100944;
        double r100946 = r100942 + r100945;
        return r100946;
}
↓
double f(double x, double y, double z, double t) {
        double r100947 = x;
        double r100948 = y;
        double r100949 = r100947 * r100948;
        double r100950 = z;
        double r100951 = t;
        double r100952 = r100950 * r100951;
        double r100953 = r100949 + r100952;
        return r100953;
}

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