Average Error: 0.0 → 0.0
Time: 782.0ms
Precision: binary64
\[\]
↓
\[\]
↓
double code(double x, double y) {
	return ((double) (((double) (x + y)) * ((double) (x + y))));
}

↓
double code(double x, double y) {
	return ((double) (((double) (x * ((double) (x + y)))) + ((double) (y * ((double) (x + y))))));
}

Error
Bits error versus x
Bits error versus y
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 distribute-lft-in0.0
    \[\leadsto \]
  4. Simplified0.0
    \[\leadsto \]
  5. Simplified0.0
    \[\leadsto \]
  6. Final simplification0.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (x y)
  :name "Examples.Basics.BasicTests:f3 from sbv-4.4"
  :precision binary64

  :herbie-target
  (+ (* x x) (+ (* y y) (* 2.0 (* y x))))

  (* (+ x y) (+ x y)))