Average Error: 0.0 → 0.0
Time: 1.5s
Precision: binary64
\[\left(A \cdot B + B \cdot C\right) + B \cdot D\]
↓
\[\left(A \cdot B + B \cdot C\right) + B \cdot D\]
\left(A \cdot B + B \cdot C\right) + B \cdot D
↓
\left(A \cdot B + B \cdot C\right) + B \cdot D
double code(double A, double B, double C, double D) {
	return ((double) (((double) (((double) (A * B)) + ((double) (B * C)))) + ((double) (B * D))));
}
↓
double code(double A, double B, double C, double D) {
	return ((double) (((double) (((double) (A * B)) + ((double) (B * C)))) + ((double) (B * D))));
}

Error

Bits error versus A

Bits error versus B

Bits error versus C

Bits error versus D

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(A \cdot B + B \cdot C\right) + B \cdot D\]

  2. Final simplification0.0

    \[\leadsto \left(A \cdot B + B \cdot C\right) + B \cdot D\]

Reproduce

herbie shell --seed 2020153 
(FPCore (A B C D)
  :name "(+ (+ (* A B) (* B C)) (* B D))"
  :precision binary64
  (+ (+ (* A B) (* B C)) (* B D)))