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

Error

Bits error versus a

Bits error versus x

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[a \cdot x + b \cdot x\]

  2. Simplified0.0

    \[\leadsto \color{blue}{x \cdot \left(a + b\right)}\]

  3. Final simplification0.0

    \[\leadsto x \cdot \left(a + b\right)\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a x b)
  :name "(+ (* a x) (* b x))"
  :precision binary64
  (+ (* a x) (* b x)))