Average Error: 0.0 → 0.0
Time: 3.9s
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 r154919 = x;
        double r154920 = y;
        double r154921 = r154919 * r154920;
        double r154922 = z;
        double r154923 = t;
        double r154924 = r154922 * r154923;
        double r154925 = r154921 + r154924;
        double r154926 = a;
        double r154927 = b;
        double r154928 = r154926 * r154927;
        double r154929 = r154925 + r154928;
        return r154929;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r154930 = x;
        double r154931 = y;
        double r154932 = r154930 * r154931;
        double r154933 = z;
        double r154934 = t;
        double r154935 = r154933 * r154934;
        double r154936 = r154932 + r154935;
        double r154937 = a;
        double r154938 = b;
        double r154939 = r154937 * r154938;
        double r154940 = r154936 + r154939;
        return r154940;
}

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