Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.0% → 99.9%

Time: 8.0s

Alternatives: 15

Speedup: 5.9×

• 60.5% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ \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(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (-
  (+
   (pow (+ (* a a) (* b b)) 2.0)
   (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a))))))
  1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 + a)) + ((b * b) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0

Julia

function code(a, b)
	return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 + a)) + Float64(Float64(b * b) * Float64(1.0 - Float64(3.0 * a)))))) - 1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
end

Wolfram

code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(3.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Initial Program: 73.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \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(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (-
  (+
   (pow (+ (* a a) (* b b)) 2.0)
   (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a))))))
  1.0))

C

double code(double a, double b) {
	return (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 + a)) + ((b * b) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0
end function

Java

public static double code(double a, double b) {
	return (Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
}

Python

def code(a, b):
	return (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0

Julia

function code(a, b)
	return Float64(Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(1.0 + a)) + Float64(Float64(b * b) * Float64(1.0 - Float64(3.0 * a)))))) - 1.0)
end

MATLAB

function tmp = code(a, b)
	tmp = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
end

Wolfram

code[a_, b_] := N[(N[(N[Power[N[(N[(a * a), $MachinePrecision] + N[(b * b), $MachinePrecision]), $MachinePrecision], 2.0], $MachinePrecision] + N[(4.0 * N[(N[(N[(a * a), $MachinePrecision] * N[(1.0 + a), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(3.0 * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Alternative 1: 99.9% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right) \cdot a, a, -1\right)\right) \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (fma
  (* (fma (fma 2.0 a -12.0) a (fma b b 4.0)) b)
  b
  (fma (* (fma (+ 4.0 a) a 4.0) a) a -1.0)))

C

double code(double a, double b) {
	return fma((fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, fma((fma((4.0 + a), a, 4.0) * a), a, -1.0));
}

Julia

function code(a, b)
	return fma(Float64(fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, fma(Float64(fma(Float64(4.0 + a), a, 4.0) * a), a, -1.0))
end

Wolfram

code[a_, b_] := N[(N[(N[(N[(2.0 * a + -12.0), $MachinePrecision] * a + N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(N[(N[(N[(4.0 + a), $MachinePrecision] * a + 4.0), $MachinePrecision] * a), $MachinePrecision] * a + -1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 80.4%

   \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + \left(a \cdot \left(-12 \cdot {b}^{2} + a \cdot \left(4 + 2 \cdot {b}^{2}\right)\right) + {b}^{4}\right)\right) - 1} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. associate-+l+ N/A

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

   3. +-commutative N/A

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

   4. associate--l+ N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

5. Applied rewrites 82.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(2, a, -12\right), 4 \cdot a\right), a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right)} \]

6. Taylor expanded in b around 0

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

8. Applied rewrites 99.9%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \mathsf{fma}\left(\mathsf{fma}\left(a + 4, a, 4\right) \cdot a, a, -1\right)\right)} \]

9. Final simplification 99.9%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \mathsf{fma}\left(\mathsf{fma}\left(4 + a, a, 4\right) \cdot a, a, -1\right)\right) \]
10. Add Preprocessing

Alternative 2: 99.2% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot a\right) \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 5e-9)
   (fma (fma a (+ 4.0 a) 4.0) (* a a) -1.0)
   (fma (* (fma (fma 2.0 a -12.0) a (fma b b 4.0)) b) b (* (* (* a a) a) a))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 5e-9) {
		tmp = fma(fma(a, (4.0 + a), 4.0), (a * a), -1.0);
	} else {
		tmp = fma((fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, (((a * a) * a) * a));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 5e-9)
		tmp = fma(fma(a, Float64(4.0 + a), 4.0), Float64(a * a), -1.0);
	else
		tmp = fma(Float64(fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b), b, Float64(Float64(Float64(a * a) * a) * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 5e-9], N[(N[(a * N[(4.0 + a), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(2.0 * a + -12.0), $MachinePrecision] * a + N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5.0000000000000001e-9

   1. Initial program 86.0%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)} \]

   if 5.0000000000000001e-9 < (*.f64 b b)

   1. Initial program 73.4%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + \left(a \cdot \left(-12 \cdot {b}^{2} + a \cdot \left(4 + 2 \cdot {b}^{2}\right)\right) + {b}^{4}\right)\right) - 1} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-+l+ N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

   5. Applied rewrites 83.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(2, a, -12\right), 4 \cdot a\right), a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right)} \]

   6. Taylor expanded in b around 0

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

   8. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \mathsf{fma}\left(\mathsf{fma}\left(a + 4, a, 4\right) \cdot a, a, -1\right)\right)} \]

   9. Taylor expanded in a around inf

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, {a}^{4}\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 99.9%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot a\right) \cdot a\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b, b, \left(\left(a \cdot a\right) \cdot a\right) \cdot a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.2% accurate, 3.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{-20}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, 2, 4\right) \cdot a, a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e-20)
   (fma (fma a (+ 4.0 a) 4.0) (* a a) -1.0)
   (fma (* (fma (* b b) 2.0 4.0) a) a (fma (* b b) (fma b b 4.0) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e-20) {
		tmp = fma(fma(a, (4.0 + a), 4.0), (a * a), -1.0);
	} else {
		tmp = fma((fma((b * b), 2.0, 4.0) * a), a, fma((b * b), fma(b, b, 4.0), -1.0));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e-20)
		tmp = fma(fma(a, Float64(4.0 + a), 4.0), Float64(a * a), -1.0);
	else
		tmp = fma(Float64(fma(Float64(b * b), 2.0, 4.0) * a), a, fma(Float64(b * b), fma(b, b, 4.0), -1.0));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e-20], N[(N[(a * N[(4.0 + a), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(b * b), $MachinePrecision] * 2.0 + 4.0), $MachinePrecision] * a), $MachinePrecision] * a + N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 9.99999999999999945e-21

   1. Initial program 85.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.2

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.2%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.9%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)} \]

   if 9.99999999999999945e-21 < (*.f64 b b)

   1. Initial program 73.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + \left(a \cdot \left(-12 \cdot {b}^{2} + a \cdot \left(4 + 2 \cdot {b}^{2}\right)\right) + {b}^{4}\right)\right) - 1} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. associate-+l+ N/A

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

      3. +-commutative N/A

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

      4. associate--l+ N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

   5. Applied rewrites 84.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(2, a, -12\right), 4 \cdot a\right), a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right)} \]

   6. Taylor expanded in a around inf

      \[\leadsto \mathsf{fma}\left(a \cdot \left(4 + 2 \cdot {b}^{2}\right), a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 98.9%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, 2, 4\right) \cdot a, a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right) \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{-20}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b \cdot b, 2, 4\right) \cdot a, a, \mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 97.7% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 5e-9)
   (fma (fma a (+ 4.0 a) 4.0) (* a a) -1.0)
   (* (* b b) (fma (fma 2.0 a -12.0) a (fma b b 4.0)))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 5e-9) {
		tmp = fma(fma(a, (4.0 + a), 4.0), (a * a), -1.0);
	} else {
		tmp = (b * b) * fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0));
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 5e-9)
		tmp = fma(fma(a, Float64(4.0 + a), 4.0), Float64(a * a), -1.0);
	else
		tmp = Float64(Float64(b * b) * fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 5e-9], N[(N[(a * N[(4.0 + a), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(N[(2.0 * a + -12.0), $MachinePrecision] * a + N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5.0000000000000001e-9

   1. Initial program 86.0%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)} \]

   if 5.0000000000000001e-9 < (*.f64 b b)

   1. Initial program 73.4%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{{b}^{4} \cdot \left(1 + \left(2 \cdot \frac{{a}^{2}}{{b}^{2}} + 4 \cdot \frac{1 - 3 \cdot a}{{b}^{2}}\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{4}{b \cdot b}, \mathsf{fma}\left(-3, a, 1\right), \mathsf{fma}\left(\frac{a}{b \cdot b}, 2 \cdot a, 1\right)\right) \cdot \left(\left(\left(b \cdot b\right) \cdot b\right) \cdot b\right)} \]

   6. Taylor expanded in b around 0

      \[\leadsto {b}^{2} \cdot \color{blue}{\left(2 \cdot {a}^{2} + \left(4 \cdot \left(1 + -3 \cdot a\right) + {b}^{2}\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.8%

      \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b\right) \cdot \color{blue}{b} \]

   9. Taylor expanded in b around 0

      \[\leadsto {b}^{2} \cdot \color{blue}{\left(2 \cdot {a}^{2} + \left(4 \cdot \left(1 + -3 \cdot a\right) + {b}^{2}\right)\right)} \]
   10. Step-by-step derivation

   11. Applied rewrites 98.9%

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot \color{blue}{\left(b \cdot b\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 97.7% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 5e-9)
   (fma (fma a (+ 4.0 a) 4.0) (* a a) -1.0)
   (* (* (fma (fma 2.0 a -12.0) a (fma b b 4.0)) b) b)))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 5e-9) {
		tmp = fma(fma(a, (4.0 + a), 4.0), (a * a), -1.0);
	} else {
		tmp = (fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b) * b;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 5e-9)
		tmp = fma(fma(a, Float64(4.0 + a), 4.0), Float64(a * a), -1.0);
	else
		tmp = Float64(Float64(fma(fma(2.0, a, -12.0), a, fma(b, b, 4.0)) * b) * b);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 5e-9], N[(N[(a * N[(4.0 + a), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(N[(N[(2.0 * a + -12.0), $MachinePrecision] * a + N[(b * b + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 5.0000000000000001e-9

   1. Initial program 86.0%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)} \]

   if 5.0000000000000001e-9 < (*.f64 b b)

   1. Initial program 73.4%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{{b}^{4} \cdot \left(1 + \left(2 \cdot \frac{{a}^{2}}{{b}^{2}} + 4 \cdot \frac{1 - 3 \cdot a}{{b}^{2}}\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{4}{b \cdot b}, \mathsf{fma}\left(-3, a, 1\right), \mathsf{fma}\left(\frac{a}{b \cdot b}, 2 \cdot a, 1\right)\right) \cdot \left(\left(\left(b \cdot b\right) \cdot b\right) \cdot b\right)} \]

   6. Taylor expanded in b around 0

      \[\leadsto {b}^{2} \cdot \color{blue}{\left(2 \cdot {a}^{2} + \left(4 \cdot \left(1 + -3 \cdot a\right) + {b}^{2}\right)\right)} \]
   7. Step-by-step derivation

   8. Applied rewrites 98.8%

      \[\leadsto \left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b\right) \cdot \color{blue}{b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 5 \cdot 10^{-9}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(\mathsf{fma}\left(2, a, -12\right), a, \mathsf{fma}\left(b, b, 4\right)\right) \cdot b\right) \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 94.2% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+17)
   (fma (fma a (+ 4.0 a) 4.0) (* a a) -1.0)
   (fma (* b b) (fma b b 4.0) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+17) {
		tmp = fma(fma(a, (4.0 + a), 4.0), (a * a), -1.0);
	} else {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+17)
		tmp = fma(fma(a, Float64(4.0 + a), 4.0), Float64(a * a), -1.0);
	else
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+17], N[(N[(a * N[(4.0 + a), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e17

   1. Initial program 85.5%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]
   6. Step-by-step derivation

   7. Applied rewrites 99.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)} \]

   if 1e17 < (*.f64 b b)

   1. Initial program 73.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 92.4

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 92.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 96.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, 4 + a, 4\right), a \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 93.6% accurate, 5.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, \left(4 + a\right) \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+17)
   (fma (* a a) (* (+ 4.0 a) a) -1.0)
   (fma (* b b) (fma b b 4.0) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+17) {
		tmp = fma((a * a), ((4.0 + a) * a), -1.0);
	} else {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+17)
		tmp = fma(Float64(a * a), Float64(Float64(4.0 + a) * a), -1.0);
	else
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+17], N[(N[(a * a), $MachinePrecision] * N[(N[(4.0 + a), $MachinePrecision] * a), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e17

   1. Initial program 85.5%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]

   6. Taylor expanded in a around 0

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 82.5%

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]

   9. Taylor expanded in a around inf

      \[\leadsto \mathsf{fma}\left(a \cdot a, {a}^{2} \cdot \color{blue}{\left(1 + 4 \cdot \frac{1}{a}\right)}, -1\right) \]
   10. Step-by-step derivation

   11. Applied rewrites 98.6%

       \[\leadsto \mathsf{fma}\left(a \cdot a, \left(a + 4\right) \cdot \color{blue}{a}, -1\right) \]

   if 1e17 < (*.f64 b b)

   1. Initial program 73.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 92.4

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 92.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 95.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, \left(4 + a\right) \cdot a, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 94.1% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{if}\;a \leq -4 \cdot 10^{+27}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 6.8 \cdot 10^{+18}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* (* a a) (* a a))))
   (if (<= a -4e+27)
     t_0
     (if (<= a 6.8e+18) (fma (* b b) (fma b b 4.0) -1.0) t_0))))

C

double code(double a, double b) {
	double t_0 = (a * a) * (a * a);
	double tmp;
	if (a <= -4e+27) {
		tmp = t_0;
	} else if (a <= 6.8e+18) {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(Float64(a * a) * Float64(a * a))
	tmp = 0.0
	if (a <= -4e+27)
		tmp = t_0;
	elseif (a <= 6.8e+18)
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4e+27], t$95$0, If[LessEqual[a, 6.8e+18], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -4.0000000000000001e27 or 6.8e18 < a

   1. Initial program 46.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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{{a}^{4}} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(3 + 1\right)}} \]

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      4. unpow3 N/A

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

      5. unpow2 N/A

         \[\leadsto \left(\color{blue}{{a}^{2}} \cdot a\right) \cdot a \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({a}^{2} \cdot a\right)} \cdot a \]

      7. unpow2 N/A

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

      8. lower-*.f64 93.0

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

   5. Applied rewrites 93.0%

      \[\leadsto \color{blue}{\left(\left(a \cdot a\right) \cdot a\right) \cdot a} \]
   6. Step-by-step derivation

   7. Applied rewrites 93.0%

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

   if -4.0000000000000001e27 < a < 6.8e18

   1. Initial program 99.9%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 98.1

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 98.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 93.3% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\left(\left(a \cdot a\right) \cdot a\right) \cdot a - 1\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+17)
   (- (* (* (* a a) a) a) 1.0)
   (fma (* b b) (fma b b 4.0) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+17) {
		tmp = (((a * a) * a) * a) - 1.0;
	} else {
		tmp = fma((b * b), fma(b, b, 4.0), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+17)
		tmp = Float64(Float64(Float64(Float64(a * a) * a) * a) - 1.0);
	else
		tmp = fma(Float64(b * b), fma(b, b, 4.0), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+17], N[(N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(b * b + 4.0), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e17

   1. Initial program 85.5%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{{a}^{4}} - 1 \]
   4. Step-by-step derivation

      1. metadata-eval N/A

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

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} - 1 \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} - 1 \]

      4. unpow3 N/A

         \[\leadsto \color{blue}{\left(\left(a \cdot a\right) \cdot a\right)} \cdot a - 1 \]

      5. unpow2 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

         \[\leadsto \left(\color{blue}{\left(a \cdot a\right)} \cdot a\right) \cdot a - 1 \]

      8. lower-*.f64 98.4

         \[\leadsto \left(\color{blue}{\left(a \cdot a\right)} \cdot a\right) \cdot a - 1 \]

   5. Applied rewrites 98.4%

      \[\leadsto \color{blue}{\left(\left(a \cdot a\right) \cdot a\right) \cdot a} - 1 \]

   if 1e17 < (*.f64 b b)

   1. Initial program 73.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 92.4

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 92.4%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 93.5% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{if}\;a \leq -4 \cdot 10^{+27}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 6.8 \cdot 10^{+18}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, b \cdot b, -1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* (* a a) (* a a))))
   (if (<= a -4e+27) t_0 (if (<= a 6.8e+18) (fma (* b b) (* b b) -1.0) t_0))))

C

double code(double a, double b) {
	double t_0 = (a * a) * (a * a);
	double tmp;
	if (a <= -4e+27) {
		tmp = t_0;
	} else if (a <= 6.8e+18) {
		tmp = fma((b * b), (b * b), -1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(Float64(a * a) * Float64(a * a))
	tmp = 0.0
	if (a <= -4e+27)
		tmp = t_0;
	elseif (a <= 6.8e+18)
		tmp = fma(Float64(b * b), Float64(b * b), -1.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -4e+27], t$95$0, If[LessEqual[a, 6.8e+18], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -4.0000000000000001e27 or 6.8e18 < a

   1. Initial program 46.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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{{a}^{4}} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(3 + 1\right)}} \]

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      4. unpow3 N/A

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

      5. unpow2 N/A

         \[\leadsto \left(\color{blue}{{a}^{2}} \cdot a\right) \cdot a \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({a}^{2} \cdot a\right)} \cdot a \]

      7. unpow2 N/A

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

      8. lower-*.f64 93.0

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

   5. Applied rewrites 93.0%

      \[\leadsto \color{blue}{\left(\left(a \cdot a\right) \cdot a\right) \cdot a} \]
   6. Step-by-step derivation

   7. Applied rewrites 93.0%

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

   if -4.0000000000000001e27 < a < 6.8e18

   1. Initial program 99.9%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 98.1

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 98.1%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]

   6. Taylor expanded in b around inf

      \[\leadsto \mathsf{fma}\left(b \cdot b, {b}^{\color{blue}{2}}, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 97.8%

      \[\leadsto \mathsf{fma}\left(b \cdot b, b \cdot \color{blue}{b}, -1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 11: 81.7% accurate, 5.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{if}\;a \leq -3.8 \cdot 10^{+27}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 185:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, -1\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (* (* a a) (* a a))))
   (if (<= a -3.8e+27) t_0 (if (<= a 185.0) (fma (* b b) 4.0 -1.0) t_0))))

C

double code(double a, double b) {
	double t_0 = (a * a) * (a * a);
	double tmp;
	if (a <= -3.8e+27) {
		tmp = t_0;
	} else if (a <= 185.0) {
		tmp = fma((b * b), 4.0, -1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(Float64(a * a) * Float64(a * a))
	tmp = 0.0
	if (a <= -3.8e+27)
		tmp = t_0;
	elseif (a <= 185.0)
		tmp = fma(Float64(b * b), 4.0, -1.0);
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -3.8e+27], t$95$0, If[LessEqual[a, 185.0], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -3.80000000000000022e27 or 185 < a

   1. Initial program 47.3%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

      \[\leadsto \color{blue}{{a}^{4}} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto {a}^{\color{blue}{\left(3 + 1\right)}} \]

      2. pow-plus N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      3. lower-*.f64 N/A

         \[\leadsto \color{blue}{{a}^{3} \cdot a} \]

      4. unpow3 N/A

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

      5. unpow2 N/A

         \[\leadsto \left(\color{blue}{{a}^{2}} \cdot a\right) \cdot a \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({a}^{2} \cdot a\right)} \cdot a \]

      7. unpow2 N/A

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

      8. lower-*.f64 91.4

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

   5. Applied rewrites 91.4%

      \[\leadsto \color{blue}{\left(\left(a \cdot a\right) \cdot a\right) \cdot a} \]
   6. Step-by-step derivation

   7. Applied rewrites 91.4%

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

   if -3.80000000000000022e27 < a < 185

   1. Initial program 99.9%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 98.7

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 98.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 79.6%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 12: 82.0% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{+17}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, 4, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(b \cdot b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 1e+17) (fma (* a a) 4.0 -1.0) (* (* b b) (* b b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e+17) {
		tmp = fma((a * a), 4.0, -1.0);
	} else {
		tmp = (b * b) * (b * b);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 1e+17)
		tmp = fma(Float64(a * a), 4.0, -1.0);
	else
		tmp = Float64(Float64(b * b) * Float64(b * b));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 1e+17], N[(N[(a * a), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1e17

   1. Initial program 85.5%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 99.0

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]

   6. Taylor expanded in a around 0

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 82.5%

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]

   if 1e17 < (*.f64 b b)

   1. Initial program 73.8%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around inf

      \[\leadsto \color{blue}{{b}^{4}} \]
   4. Step-by-step derivation

      1. metadata-eval N/A

         \[\leadsto {b}^{\color{blue}{\left(3 + 1\right)}} \]

      2. pow-plus N/A

         \[\leadsto \color{blue}{{b}^{3} \cdot b} \]

      3. cube-unmult N/A

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

      4. unpow2 N/A

         \[\leadsto \left(b \cdot \color{blue}{{b}^{2}}\right) \cdot b \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(b \cdot {b}^{2}\right) \cdot b} \]

      6. *-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{2} \cdot b\right)} \cdot b \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left({b}^{2} \cdot b\right)} \cdot b \]

      8. unpow2 N/A

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

      9. lower-*.f64 92.4

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

   5. Applied rewrites 92.4%

      \[\leadsto \color{blue}{\left(\left(b \cdot b\right) \cdot b\right) \cdot b} \]
   6. Step-by-step derivation

   7. Applied rewrites 92.4%

      \[\leadsto \left(b \cdot b\right) \cdot \color{blue}{\left(b \cdot b\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 69.0% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 6.8 \cdot 10^{+283}:\\ \;\;\;\;\mathsf{fma}\left(a \cdot a, 4, -1\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(b \cdot b, 4, -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 6.8e+283) (fma (* a a) 4.0 -1.0) (fma (* b b) 4.0 -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 6.8e+283) {
		tmp = fma((a * a), 4.0, -1.0);
	} else {
		tmp = fma((b * b), 4.0, -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 6.8e+283)
		tmp = fma(Float64(a * a), 4.0, -1.0);
	else
		tmp = fma(Float64(b * b), 4.0, -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 6.8e+283], N[(N[(a * a), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 6.8000000000000003e283

   1. Initial program 82.3%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in b around 0

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. *-commutative N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      7. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      8. metadata-eval N/A

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

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

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

      11. lower-*.f64 N/A

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

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

      13. lower-fma.f64 N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

      14. +-commutative N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

      15. distribute-lft-in N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

      16. metadata-eval N/A

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

      17. lower-fma.f64 83.5

          \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

   5. Applied rewrites 83.5%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]

   6. Taylor expanded in a around 0

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 68.6%

      \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]

   if 6.8000000000000003e283 < (*.f64 b b)

   1. Initial program 74.6%

      \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
   4. Step-by-step derivation

      1. sub-neg N/A

         \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      3. metadata-eval N/A

         \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      4. pow-sqr N/A

         \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

      5. distribute-rgt-out N/A

         \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

      6. metadata-eval N/A

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

      7. lower-fma.f64 N/A

         \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

      8. unpow2 N/A

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

      9. lower-*.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

      11. lower-fma.f64 100.0

          \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]

   6. Taylor expanded in b around 0

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 91.5%

      \[\leadsto \mathsf{fma}\left(b \cdot b, 4, -1\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 14: 51.4% accurate, 13.3× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a \cdot a, 4, -1\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (fma (* a a) 4.0 -1.0))

C

double code(double a, double b) {
	return fma((a * a), 4.0, -1.0);
}

Julia

function code(a, b)
	return fma(Float64(a * a), 4.0, -1.0)
end

Wolfram

code[a_, b_] := N[(N[(a * a), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision]

Derivation

1. Initial program 80.4%

   \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
2. Add Preprocessing

3. Taylor expanded in b around 0

   \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) - 1} \]
4. Step-by-step derivation

   1. sub-neg N/A

      \[\leadsto \color{blue}{\left(4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right) + {a}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{\left({a}^{4} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   3. metadata-eval N/A

      \[\leadsto \left({a}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   4. pow-sqr N/A

      \[\leadsto \left(\color{blue}{{a}^{2} \cdot {a}^{2}} + 4 \cdot \left({a}^{2} \cdot \left(1 + a\right)\right)\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   5. *-commutative N/A

      \[\leadsto \left({a}^{2} \cdot {a}^{2} + 4 \cdot \color{blue}{\left(\left(1 + a\right) \cdot {a}^{2}\right)}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   6. associate-*r* N/A

      \[\leadsto \left({a}^{2} \cdot {a}^{2} + \color{blue}{\left(4 \cdot \left(1 + a\right)\right) \cdot {a}^{2}}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   7. distribute-rgt-out N/A

      \[\leadsto \color{blue}{{a}^{2} \cdot \left({a}^{2} + 4 \cdot \left(1 + a\right)\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   8. metadata-eval N/A

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

   9. lower-fma.f64 N/A

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

   10. unpow2 N/A

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

   11. lower-*.f64 N/A

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

   12. unpow2 N/A

       \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{a \cdot a} + 4 \cdot \left(1 + a\right), -1\right) \]

   13. lower-fma.f64 N/A

       \[\leadsto \mathsf{fma}\left(a \cdot a, \color{blue}{\mathsf{fma}\left(a, a, 4 \cdot \left(1 + a\right)\right)}, -1\right) \]

   14. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot \color{blue}{\left(a + 1\right)}\right), -1\right) \]

   15. distribute-lft-in N/A

       \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{4 \cdot a + 4 \cdot 1}\right), -1\right) \]

   16. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, 4 \cdot a + \color{blue}{4}\right), -1\right) \]

   17. lower-fma.f64 69.1

       \[\leadsto \mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \color{blue}{\mathsf{fma}\left(4, a, 4\right)}\right), -1\right) \]

5. Applied rewrites 69.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left(a \cdot a, \mathsf{fma}\left(a, a, \mathsf{fma}\left(4, a, 4\right)\right), -1\right)} \]

6. Taylor expanded in a around 0

   \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]
7. Step-by-step derivation

8. Applied rewrites 56.0%

   \[\leadsto \mathsf{fma}\left(a \cdot a, 4, -1\right) \]
9. Add Preprocessing

Alternative 15: 24.4% accurate, 160.0× speedup

Math

\[\begin{array}{l} \\ -1 \end{array} \]

FPCore

(FPCore (a b) :precision binary64 -1.0)

C

double code(double a, double b) {
	return -1.0;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = -1.0d0
end function

Java

public static double code(double a, double b) {
	return -1.0;
}

Python

def code(a, b):
	return -1.0

Julia

function code(a, b)
	return -1.0
end

MATLAB

function tmp = code(a, b)
	tmp = -1.0;
end

Wolfram

code[a_, b_] := -1.0

Derivation

1. Initial program 80.4%

   \[\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(1 - 3 \cdot a\right)\right)\right) - 1 \]
2. Add Preprocessing

3. Taylor expanded in a around 0

   \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) - 1} \]
4. Step-by-step derivation

   1. sub-neg N/A

      \[\leadsto \color{blue}{\left(4 \cdot {b}^{2} + {b}^{4}\right) + \left(\mathsf{neg}\left(1\right)\right)} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{\left({b}^{4} + 4 \cdot {b}^{2}\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   3. metadata-eval N/A

      \[\leadsto \left({b}^{\color{blue}{\left(2 \cdot 2\right)}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   4. pow-sqr N/A

      \[\leadsto \left(\color{blue}{{b}^{2} \cdot {b}^{2}} + 4 \cdot {b}^{2}\right) + \left(\mathsf{neg}\left(1\right)\right) \]

   5. distribute-rgt-out N/A

      \[\leadsto \color{blue}{{b}^{2} \cdot \left({b}^{2} + 4\right)} + \left(\mathsf{neg}\left(1\right)\right) \]

   6. metadata-eval N/A

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

   7. lower-fma.f64 N/A

      \[\leadsto \color{blue}{\mathsf{fma}\left({b}^{2}, {b}^{2} + 4, -1\right)} \]

   8. unpow2 N/A

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

   9. lower-*.f64 N/A

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

   10. unpow2 N/A

       \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{b \cdot b} + 4, -1\right) \]

   11. lower-fma.f64 74.6

       \[\leadsto \mathsf{fma}\left(b \cdot b, \color{blue}{\mathsf{fma}\left(b, b, 4\right)}, -1\right) \]

5. Applied rewrites 74.6%

   \[\leadsto \color{blue}{\mathsf{fma}\left(b \cdot b, \mathsf{fma}\left(b, b, 4\right), -1\right)} \]

6. Taylor expanded in b around 0

   \[\leadsto -1 \]
7. Step-by-step derivation

8. Applied rewrites 34.6%

   \[\leadsto -1 \]
9. Add Preprocessing

Reproduce

herbie shell --seed 2024240 
(FPCore (a b)
  :name "Bouland and Aaronson, Equation (25)"
  :precision binary64
  (- (+ (pow (+ (* a a) (* b b)) 2.0) (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a)))))) 1.0))