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

Error

Bits error versus ax

Bits error versus x

Bits error versus b

Bits error versus c

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(ax \cdot x + b \cdot x\right) + c\]

  2. Simplified0.0

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

  3. Final simplification0.0

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

Reproduce

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