Average Error: 0.0 → 0.0
Time: 845.0ms
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x) {
	return ((double) (x * ((double) (1.0 - ((double) (x * 0.5))))));
}

↓
double code(double x) {
	return ((double) (((double) (x * 1.0)) - ((double) (x * ((double) (x * 0.5))))));
}

Error
Bits error versus x
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied sub-neg0.0
    \[\leadsto \]
  4. Applied distribute-lft-in0.0
    \[\leadsto \]
  5. Simplified0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (x)
  :name "Numeric.SpecFunctions:log1p from math-functions-0.1.5.2, B"
  :precision binary64
  (* x (- 1.0 (* x 0.5))))