Average Error: 0.0 → 0.0
Time: 10.3s
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 r109947 = x;
        double r109948 = y;
        double r109949 = r109947 * r109948;
        double r109950 = z;
        double r109951 = t;
        double r109952 = r109950 * r109951;
        double r109953 = r109949 + r109952;
        double r109954 = a;
        double r109955 = b;
        double r109956 = r109954 * r109955;
        double r109957 = r109953 + r109956;
        return r109957;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109958 = x;
        double r109959 = y;
        double r109960 = r109958 * r109959;
        double r109961 = z;
        double r109962 = t;
        double r109963 = r109961 * r109962;
        double r109964 = r109960 + r109963;
        double r109965 = a;
        double r109966 = b;
        double r109967 = r109965 * r109966;
        double r109968 = r109964 + r109967;
        return r109968;
}

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