Average Error: 0.0 → 0.0
Time: 2.2s
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 r155222 = x;
        double r155223 = y;
        double r155224 = r155222 * r155223;
        double r155225 = z;
        double r155226 = t;
        double r155227 = r155225 * r155226;
        double r155228 = r155224 + r155227;
        double r155229 = a;
        double r155230 = b;
        double r155231 = r155229 * r155230;
        double r155232 = r155228 + r155231;
        return r155232;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r155233 = x;
        double r155234 = y;
        double r155235 = r155233 * r155234;
        double r155236 = z;
        double r155237 = t;
        double r155238 = r155236 * r155237;
        double r155239 = r155235 + r155238;
        double r155240 = a;
        double r155241 = b;
        double r155242 = r155240 * r155241;
        double r155243 = r155239 + r155242;
        return r155243;
}

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