Average Error: 0.2 → 0.5
Time: 29.7s
Precision: 64
Internal Precision: 576
\[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(b \cdot b\right)\right) - 1\]
↓
\[\left(4 \cdot \left(b \cdot b\right) + \left(\left(a \cdot a + b \cdot b\right) \cdot \sqrt[3]{a \cdot a + b \cdot b}\right) \cdot {\left(\sqrt[3]{a \cdot a + b \cdot b}\right)}^{2}\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(b \cdot b\right)\right) - 1\]
  2. Using strategy rm

  3. Applied add-cube-cbrt0.7

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

  4. Applied unpow-prod-down0.7

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

  5. Simplified0.5

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

  6. Final simplification0.5

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

Runtime

Time bar (total: 29.7s)Debug logProfile

herbie shell --seed 2018217 
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (26)"
  (- (+ (pow (+ (* a a) (* b b)) 2) (* 4 (* b b))) 1))