Average Error: 0.0 → 0.0
Time: 16.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 r14802349 = x;
        double r14802350 = y;
        double r14802351 = r14802349 * r14802350;
        double r14802352 = z;
        double r14802353 = t;
        double r14802354 = r14802352 * r14802353;
        double r14802355 = r14802351 + r14802354;
        return r14802355;
}
↓
double f(double x, double y, double z, double t) {
        double r14802356 = x;
        double r14802357 = y;
        double r14802358 = r14802356 * r14802357;
        double r14802359 = z;
        double r14802360 = t;
        double r14802361 = r14802359 * r14802360;
        double r14802362 = r14802358 + r14802361;
        return r14802362;
}

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