Average Error: 0.0 → 0.0
Time: 2.8s
Precision: binary64
Cost: 704
\[5 \leq a \land a \leq 10 \land 0 \leq b \land b \leq 0.001\]
\[\left(a + b\right) \cdot \left(a + b\right)\]
↓
\[a \cdot \left(a + b\right) + b \cdot \left(a + b\right)\]
\left(a + b\right) \cdot \left(a + b\right)
↓
a \cdot \left(a + b\right) + b \cdot \left(a + b\right)
(FPCore (a b) :precision binary64 (* (+ a b) (+ a b)))
↓
(FPCore (a b) :precision binary64 (+ (* a (+ a b)) (* b (+ a b))))
double code(double a, double b) {
	return (a + b) * (a + b);
}
↓
double code(double a, double b) {
	return (a * (a + b)) + (b * (a + b));
}

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
\[\left(\left(b \cdot a + b \cdot b\right) + b \cdot a\right) + a \cdot a\]

Alternatives

Alternative 1
Error0.0
Cost448
\[\left(a + b\right) \cdot \left(a + b\right)\]
Alternative 2
Error0.2
Cost448
\[a \cdot \left(a + b \cdot 2\right)\]
Alternative 3
Error0.8
Cost192
\[a \cdot a\]
Alternative 4
Error54.5
Cost64
\[1\]

Error

Derivation

  1. Initial program 0.0

    \[\left(a + b\right) \cdot \left(a + b\right)\]
  2. Using strategy rm

  3. Applied distribute-rgt-in_binary64_10510.0

    \[\leadsto \color{blue}{a \cdot \left(a + b\right) + b \cdot \left(a + b\right)}\]

  4. Simplified0.0

    \[\leadsto \color{blue}{a \cdot \left(a + b\right) + b \cdot \left(a + b\right)}\]

  5. Final simplification0.0

    \[\leadsto a \cdot \left(a + b\right) + b \cdot \left(a + b\right)\]

Reproduce

herbie shell --seed 2021044 
(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)))