Average Error: 0.0 → 0.0
Time: 1.6s
Precision: binary64
\[\left(a \cdot b + c \cdot d\right) + e \cdot f\]
↓
\[\left(a \cdot b + c \cdot d\right) + e \cdot f\]
\left(a \cdot b + c \cdot d\right) + e \cdot f
↓
\left(a \cdot b + c \cdot d\right) + e \cdot f
double code(double a, double b, double c, double d, double e, double f) {
	return ((double) (((double) (((double) (a * b)) + ((double) (c * d)))) + ((double) (e * f))));
}
↓
double code(double a, double b, double c, double d, double e, double f) {
	return ((double) (((double) (((double) (a * b)) + ((double) (c * d)))) + ((double) (e * f))));
}

Error

Bits error versus a

Bits error versus b

Bits error versus c

Bits error versus d

Bits error versus e

Bits error versus f

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(a \cdot b + c \cdot d\right) + e \cdot f\]

  2. Final simplification0.0

    \[\leadsto \left(a \cdot b + c \cdot d\right) + e \cdot f\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a b c d e f)
  :name "(+ (+ (* a b) (* c d)) (* e f))"
  :precision binary64
  (+ (+ (* a b) (* c d)) (* e f)))