Average Error: 0.1 → 0.1
Time: 1.7s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (((double) (0.954929658551372 * x)) - ((double) (0.12900613773279798 * ((double) (((double) (x * x)) * x))))));
}

↓
double code(double x) {
	return ((double) (((double) (0.954929658551372 * x)) - ((double) (((double) (x * 0.12900613773279798)) * ((double) (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
    \[\]
  2. Simplified0.1
    \[\leadsto \]
  3. Using strategy rm
  4. Applied cube-mult0.1
    \[\leadsto \]
  5. Applied associate-*r*0.1
    \[\leadsto \]
  6. Final simplification0.1
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "Rosa's Benchmark"
  :precision binary64
  (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))