Average Error: 0.0 → 0.0
Time: 918.0ms
Precision: 64
\[5 \le a \le 10 \land 0.0 \le b \le 10^{-3}\]
\[\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)
double f(double a, double b) {
        double r100249 = a;
        double r100250 = b;
        double r100251 = r100249 + r100250;
        double r100252 = r100251 * r100251;
        return r100252;
}
↓
double f(double a, double b) {
        double r100253 = a;
        double r100254 = b;
        double r100255 = r100253 + r100254;
        double r100256 = r100253 * r100255;
        double r100257 = r100254 * r100255;
        double r100258 = r100256 + r100257;
        return r100258;
}

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\]

Derivation

  1. Initial program 0.0

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

  3. Applied distribute-lft-in0.0

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

  4. Simplified0.0

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

  5. Simplified0.0

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

  6. Final simplification0.0

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

Reproduce

herbie shell --seed 2020062 +o rules:numerics
(FPCore (a b)
  :name "Expression 4, p15"
  :precision binary64
  :pre (and (<= 5 a 10) (<= 0.0 b 0.001))

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

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