Average Error: 0.0 → 0.0
Time: 7.2s
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 r83657 = x;
        double r83658 = y;
        double r83659 = r83657 * r83658;
        double r83660 = z;
        double r83661 = t;
        double r83662 = r83660 * r83661;
        double r83663 = r83659 + r83662;
        double r83664 = a;
        double r83665 = b;
        double r83666 = r83664 * r83665;
        double r83667 = r83663 + r83666;
        return r83667;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r83668 = x;
        double r83669 = y;
        double r83670 = r83668 * r83669;
        double r83671 = z;
        double r83672 = t;
        double r83673 = r83671 * r83672;
        double r83674 = r83670 + r83673;
        double r83675 = a;
        double r83676 = b;
        double r83677 = r83675 * r83676;
        double r83678 = r83674 + r83677;
        return r83678;
}

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