Average Error: 0.1 → 0.1
Time: 826.0ms
Precision: binary64
\[\left(x + x \cdot x\right) + 2 \cdot x\]
↓
\[x \cdot \left(\left(x + 1\right) + 2\right)\]
\left(x + x \cdot x\right) + 2 \cdot x
↓
x \cdot \left(\left(x + 1\right) + 2\right)
double code(double x) {
	return ((double) (((double) (x + ((double) (x * x)))) + ((double) (2.0 * x))));
}
↓
double code(double x) {
	return ((double) (x * ((double) (((double) (x + 1.0)) + 2.0))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\left(x + x \cdot x\right) + 2 \cdot x\]

  2. Simplified0.1

    \[\leadsto \color{blue}{x \cdot \left(\left(x + 1\right) + 2\right)}\]

  3. Final simplification0.1

    \[\leadsto x \cdot \left(\left(x + 1\right) + 2\right)\]

Reproduce

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