Average Error: 0.0 → 0.0
Time: 17.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 r109788 = x;
        double r109789 = y;
        double r109790 = r109788 * r109789;
        double r109791 = z;
        double r109792 = t;
        double r109793 = r109791 * r109792;
        double r109794 = r109790 + r109793;
        double r109795 = a;
        double r109796 = b;
        double r109797 = r109795 * r109796;
        double r109798 = r109794 + r109797;
        return r109798;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r109799 = x;
        double r109800 = y;
        double r109801 = r109799 * r109800;
        double r109802 = z;
        double r109803 = t;
        double r109804 = r109802 * r109803;
        double r109805 = r109801 + r109804;
        double r109806 = a;
        double r109807 = b;
        double r109808 = r109806 * r109807;
        double r109809 = r109805 + r109808;
        return r109809;
}

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