Average Error: 0.0 → 0.0
Time: 6.7s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z, double t, double a, double b) {
	return ((double) (((double) (((double) (x * y)) + ((double) (z * t)))) + ((double) (a * b))));
}

↓
double code(double x, double y, double z, double t, double a, double b) {
	return ((double) (((double) (x * y)) + ((double) (((double) (z * t)) + ((double) (a * b))))));
}

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
    \[\]
  2. Simplified0.0
    \[\leadsto \]
  3. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(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)))