Average Error: 0.0 → 0.0
Time: 6.1s
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 r118966 = x;
        double r118967 = y;
        double r118968 = r118966 * r118967;
        double r118969 = z;
        double r118970 = t;
        double r118971 = r118969 * r118970;
        double r118972 = r118968 + r118971;
        double r118973 = a;
        double r118974 = b;
        double r118975 = r118973 * r118974;
        double r118976 = r118972 + r118975;
        return r118976;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r118977 = x;
        double r118978 = y;
        double r118979 = r118977 * r118978;
        double r118980 = z;
        double r118981 = t;
        double r118982 = r118980 * r118981;
        double r118983 = r118979 + r118982;
        double r118984 = a;
        double r118985 = b;
        double r118986 = r118984 * r118985;
        double r118987 = r118983 + r118986;
        return r118987;
}

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