Average Error: 0.0 → 0.0
Time: 4.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 r127783 = x;
        double r127784 = y;
        double r127785 = r127783 * r127784;
        double r127786 = z;
        double r127787 = t;
        double r127788 = r127786 * r127787;
        double r127789 = r127785 + r127788;
        double r127790 = a;
        double r127791 = b;
        double r127792 = r127790 * r127791;
        double r127793 = r127789 + r127792;
        return r127793;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r127794 = x;
        double r127795 = y;
        double r127796 = r127794 * r127795;
        double r127797 = z;
        double r127798 = t;
        double r127799 = r127797 * r127798;
        double r127800 = r127796 + r127799;
        double r127801 = a;
        double r127802 = b;
        double r127803 = r127801 * r127802;
        double r127804 = r127800 + r127803;
        return r127804;
}

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