Average Error: 0.0 → 0.0
Time: 8.6s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(x \cdot y + z \cdot t\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r130491 = x;
        double r130492 = y;
        double r130493 = r130491 * r130492;
        double r130494 = z;
        double r130495 = t;
        double r130496 = r130494 * r130495;
        double r130497 = r130493 + r130496;
        double r130498 = a;
        double r130499 = b;
        double r130500 = r130498 * r130499;
        double r130501 = r130497 + r130500;
        return r130501;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r130502 = x;
        double r130503 = y;
        double r130504 = r130502 * r130503;
        double r130505 = z;
        double r130506 = t;
        double r130507 = r130505 * r130506;
        double r130508 = r130504 + r130507;
        double r130509 = a;
        double r130510 = b;
        double r130511 = r130509 * r130510;
        double r130512 = r130508 + r130511;
        return r130512;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot y + z \cdot t\right) + a \cdot b\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot y + z \cdot t\right) + a \cdot b\]

Reproduce

herbie shell --seed 2019350 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  :precision binary64
  (+ (+ (* x y) (* z t)) (* a b)))