Average Error: 0.0 → 0.0
Time: 5.0s
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 r7907476 = x;
        double r7907477 = y;
        double r7907478 = r7907476 * r7907477;
        double r7907479 = z;
        double r7907480 = t;
        double r7907481 = r7907479 * r7907480;
        double r7907482 = r7907478 + r7907481;
        double r7907483 = a;
        double r7907484 = b;
        double r7907485 = r7907483 * r7907484;
        double r7907486 = r7907482 + r7907485;
        return r7907486;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r7907487 = z;
        double r7907488 = t;
        double r7907489 = r7907487 * r7907488;
        double r7907490 = x;
        double r7907491 = y;
        double r7907492 = r7907490 * r7907491;
        double r7907493 = r7907489 + r7907492;
        double r7907494 = a;
        double r7907495 = b;
        double r7907496 = r7907494 * r7907495;
        double r7907497 = r7907493 + r7907496;
        return r7907497;
}

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 2019162 
(FPCore (x y z t a b)
  :name "Linear.V3:$cdot from linear-1.19.1.3, B"
  (+ (+ (* x y) (* z t)) (* a b)))