Average Error: 0.0 → 0.0
Time: 10.8s
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 r135222 = x;
        double r135223 = y;
        double r135224 = r135222 * r135223;
        double r135225 = z;
        double r135226 = t;
        double r135227 = r135225 * r135226;
        double r135228 = r135224 + r135227;
        double r135229 = a;
        double r135230 = b;
        double r135231 = r135229 * r135230;
        double r135232 = r135228 + r135231;
        return r135232;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r135233 = x;
        double r135234 = y;
        double r135235 = r135233 * r135234;
        double r135236 = z;
        double r135237 = t;
        double r135238 = r135236 * r135237;
        double r135239 = r135235 + r135238;
        double r135240 = a;
        double r135241 = b;
        double r135242 = r135240 * r135241;
        double r135243 = r135239 + r135242;
        return r135243;
}

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