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

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) + \left(x \cdot x\right) \cdot x\]

  2. Final simplification0.1

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

Reproduce

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