Average Error: 0.0 → 0.0
Time: 19.8s
Precision: 64
\[\left(x \cdot y + z \cdot t\right) + a \cdot b\]
↓
\[\left(z \cdot t + x \cdot y\right) + a \cdot b\]
\left(x \cdot y + z \cdot t\right) + a \cdot b
↓
\left(z \cdot t + x \cdot y\right) + a \cdot b
double f(double x, double y, double z, double t, double a, double b) {
        double r6009485 = x;
        double r6009486 = y;
        double r6009487 = r6009485 * r6009486;
        double r6009488 = z;
        double r6009489 = t;
        double r6009490 = r6009488 * r6009489;
        double r6009491 = r6009487 + r6009490;
        double r6009492 = a;
        double r6009493 = b;
        double r6009494 = r6009492 * r6009493;
        double r6009495 = r6009491 + r6009494;
        return r6009495;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r6009496 = z;
        double r6009497 = t;
        double r6009498 = r6009496 * r6009497;
        double r6009499 = x;
        double r6009500 = y;
        double r6009501 = r6009499 * r6009500;
        double r6009502 = r6009498 + r6009501;
        double r6009503 = a;
        double r6009504 = b;
        double r6009505 = r6009503 * r6009504;
        double r6009506 = r6009502 + r6009505;
        return r6009506;
}

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(z \cdot t + x \cdot y\right) + a \cdot b\]

Reproduce

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