Average Error: 0.2 → 0.2
Time: 58.7s
Precision: 64
Internal Precision: 576
\[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]
↓
\[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a + \left(a \cdot a\right) \cdot \left(-a\right)\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]

Error

Bits error versus a

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.2

    \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 - a\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]
  2. Using strategy rm

  3. Applied sub-neg0.2

    \[\leadsto \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \color{blue}{\left(1 + \left(-a\right)\right)} + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]

  4. Applied distribute-lft-in0.2

    \[\leadsto \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\color{blue}{\left(\left(a \cdot a\right) \cdot 1 + \left(a \cdot a\right) \cdot \left(-a\right)\right)} + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]

  5. Applied simplify0.2

    \[\leadsto \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(\color{blue}{a \cdot a} + \left(a \cdot a\right) \cdot \left(-a\right)\right) + \left(b \cdot b\right) \cdot \left(3 + a\right)\right)\right) - 1\]

Runtime

Time bar (total: 58.7s)Debug logProfile

herbie shell --seed 2018207 +o rules:numerics
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (24)"
  (- (+ (pow (+ (* a a) (* b b)) 2) (* 4 (+ (* (* a a) (- 1 a)) (* (* b b) (+ 3 a))))) 1))