Average Error: 0.0 → 0.0
Time: 3.7s
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 r108955 = x;
        double r108956 = y;
        double r108957 = r108955 * r108956;
        double r108958 = z;
        double r108959 = t;
        double r108960 = r108958 * r108959;
        double r108961 = r108957 + r108960;
        double r108962 = a;
        double r108963 = b;
        double r108964 = r108962 * r108963;
        double r108965 = r108961 + r108964;
        return r108965;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r108966 = x;
        double r108967 = y;
        double r108968 = r108966 * r108967;
        double r108969 = z;
        double r108970 = t;
        double r108971 = r108969 * r108970;
        double r108972 = r108968 + r108971;
        double r108973 = a;
        double r108974 = b;
        double r108975 = r108973 * r108974;
        double r108976 = r108972 + r108975;
        return r108976;
}

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 2019323 +o rules:numerics
(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)))