Average Error: 0.0 → 0.0
Time: 11.0s
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 r153216 = x;
        double r153217 = y;
        double r153218 = r153216 * r153217;
        double r153219 = z;
        double r153220 = t;
        double r153221 = r153219 * r153220;
        double r153222 = r153218 + r153221;
        double r153223 = a;
        double r153224 = b;
        double r153225 = r153223 * r153224;
        double r153226 = r153222 + r153225;
        return r153226;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r153227 = x;
        double r153228 = y;
        double r153229 = r153227 * r153228;
        double r153230 = z;
        double r153231 = t;
        double r153232 = r153230 * r153231;
        double r153233 = r153229 + r153232;
        double r153234 = a;
        double r153235 = b;
        double r153236 = r153234 * r153235;
        double r153237 = r153233 + r153236;
        return r153237;
}

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 2020045 
(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)))