Average Error: 0.1 → 0.0
Time: 1.5s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y, double z) {
	return ((double) (1.0 + ((double) (((double) (4.0 * ((double) (((double) (x + ((double) (y * 0.25)))) - z)))) / y))));
}

↓
double code(double x, double y, double z) {
	return ((double) (((double) (1.0 + ((double) (4.0 * 0.25)))) + ((double) (4.0 * ((double) (((double) (x - z)) / y))))));
}

Error
Bits error versus x
Bits error versus y
Bits error versus z
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 0.1
    \[\]
  2. Simplified0.0
    \[\leadsto \]
  3. Using strategy rm
  4. Applied distribute-lft-in0.0
    \[\leadsto \]
  5. Applied associate-+r+0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x y z)
  :name "Data.Array.Repa.Algorithms.ColorRamp:rampColorHotToCold from repa-algorithms-3.4.0.1, C"
  :precision binary64
  (+ 1.0 (/ (* 4.0 (- (+ x (* y 0.25)) z)) y)))