Average Error: 0.0 → 0.0
Time: 2.6s
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 r96001 = x;
        double r96002 = y;
        double r96003 = r96001 * r96002;
        double r96004 = z;
        double r96005 = t;
        double r96006 = r96004 * r96005;
        double r96007 = r96003 + r96006;
        double r96008 = a;
        double r96009 = b;
        double r96010 = r96008 * r96009;
        double r96011 = r96007 + r96010;
        return r96011;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r96012 = x;
        double r96013 = y;
        double r96014 = r96012 * r96013;
        double r96015 = z;
        double r96016 = t;
        double r96017 = r96015 * r96016;
        double r96018 = r96014 + r96017;
        double r96019 = a;
        double r96020 = b;
        double r96021 = r96019 * r96020;
        double r96022 = r96018 + r96021;
        return r96022;
}

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