Average Error: 0.0 → 0.0
Time: 3.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 r95008 = x;
        double r95009 = y;
        double r95010 = r95008 * r95009;
        double r95011 = z;
        double r95012 = t;
        double r95013 = r95011 * r95012;
        double r95014 = r95010 + r95013;
        return r95014;
}
↓
double f(double x, double y, double z, double t) {
        double r95015 = x;
        double r95016 = y;
        double r95017 = r95015 * r95016;
        double r95018 = z;
        double r95019 = t;
        double r95020 = r95018 * r95019;
        double r95021 = r95017 + r95020;
        return r95021;
}

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