Average Error: 0.0 → 0.0
Time: 3.7s
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 r86329 = x;
        double r86330 = y;
        double r86331 = r86329 * r86330;
        double r86332 = z;
        double r86333 = t;
        double r86334 = r86332 * r86333;
        double r86335 = r86331 + r86334;
        double r86336 = a;
        double r86337 = b;
        double r86338 = r86336 * r86337;
        double r86339 = r86335 + r86338;
        return r86339;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r86340 = x;
        double r86341 = y;
        double r86342 = r86340 * r86341;
        double r86343 = z;
        double r86344 = t;
        double r86345 = r86343 * r86344;
        double r86346 = r86342 + r86345;
        double r86347 = a;
        double r86348 = b;
        double r86349 = r86347 * r86348;
        double r86350 = r86346 + r86349;
        return r86350;
}

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 2019323 +o rules:numerics
(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)))