Average Error: 0.0 → 0.0
Time: 8.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 r174660 = x;
        double r174661 = y;
        double r174662 = r174660 * r174661;
        double r174663 = z;
        double r174664 = t;
        double r174665 = r174663 * r174664;
        double r174666 = r174662 + r174665;
        double r174667 = a;
        double r174668 = b;
        double r174669 = r174667 * r174668;
        double r174670 = r174666 + r174669;
        return r174670;
}
↓
double f(double x, double y, double z, double t, double a, double b) {
        double r174671 = x;
        double r174672 = y;
        double r174673 = r174671 * r174672;
        double r174674 = z;
        double r174675 = t;
        double r174676 = r174674 * r174675;
        double r174677 = r174673 + r174676;
        double r174678 = a;
        double r174679 = b;
        double r174680 = r174678 * r174679;
        double r174681 = r174677 + r174680;
        return r174681;
}

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