Average Error: 0.0 → 0.0
Time: 1.2s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double a, double b) {
	return ((double) (((double) (a + b)) * ((double) (a + b))));
}

↓
double code(double a, double b) {
	return ((double) (((double) (a * a)) + ((double) (b * ((double) (b + ((double) (a * 2.0))))))));
}

Error
Bits error versus a
Bits error versus b
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original0.0
Target0.0
Herbie0.0
\[\]
Derivation
  1. Initial program 0.0
    \[\]
  2. Using strategy rm
  3. Applied flip-+0.0
    \[\leadsto \]
  4. Applied associate-*r/0.1
    \[\leadsto \]
  5. Simplified0.1
    \[\leadsto \]
  6. Taylor expanded around 0 0.0
    \[\leadsto \]
  7. Simplified0.0
    \[\leadsto \]
  8. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020181 
(FPCore (a b)
  :name "Expression 4, p15"
  :precision binary64
  :pre (and (<= 5.0 a 10.0) (<= 0.0 b 0.001))

  :herbie-target
  (+ (+ (+ (* b a) (* b b)) (* b a)) (* a a))

  (* (+ a b) (+ a b)))