Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.7% → 98.2%

Time: 9.9s

Alternatives: 13

Speedup: 5.9×

• 61.3% 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.7% 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: 98.2% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0
         (+
          (pow (+ (* a a) (* b b)) 2.0)
          (* 4.0 (+ (* (* a a) (+ a 1.0)) (* (* b b) (- 1.0 (* a 3.0))))))))
   (if (<= t_0 INFINITY)
     (+ t_0 -1.0)
     (fma (fma a (+ a 4.0) 4.0) (* a a) -1.0))))

C

double code(double a, double b) {
	double t_0 = pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))));
	double tmp;
	if (t_0 <= ((double) INFINITY)) {
		tmp = t_0 + -1.0;
	} else {
		tmp = fma(fma(a, (a + 4.0), 4.0), (a * a), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(a + 1.0)) + Float64(Float64(b * b) * Float64(1.0 - Float64(a * 3.0))))))
	tmp = 0.0
	if (t_0 <= Inf)
		tmp = Float64(t_0 + -1.0);
	else
		tmp = fma(fma(a, Float64(a + 4.0), 4.0), Float64(a * a), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = 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[(a + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, Infinity], N[(t$95$0 + -1.0), $MachinePrecision], N[(N[(a * N[(a + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) < +inf.0

   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

   if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a))))))

   1. Initial program 0.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 93.3

          \[\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 93.3%

      \[\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 93.3%

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

4. Final simplification 98.1%

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

Alternative 2: 98.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(a, a, b \cdot b\right)\\ \mathbf{if}\;{\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(a + 1\right) + \left(b \cdot b\right) \cdot \left(1 - a \cdot 3\right)\right) \leq \infty:\\ \;\;\;\;\frac{1}{\frac{1}{\mathsf{fma}\left(t\_0, t\_0, \mathsf{fma}\left(4, \mathsf{fma}\left(a, \mathsf{fma}\left(a, a, a\right), b \cdot \left(b \cdot \mathsf{fma}\left(a, -3, 1\right)\right)\right), -1\right)\right)}}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), a \cdot a, -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (fma a a (* b b))))
   (if (<=
        (+
         (pow (+ (* a a) (* b b)) 2.0)
         (* 4.0 (+ (* (* a a) (+ a 1.0)) (* (* b b) (- 1.0 (* a 3.0))))))
        INFINITY)
     (/
      1.0
      (/
       1.0
       (fma
        t_0
        t_0
        (fma 4.0 (fma a (fma a a a) (* b (* b (fma a -3.0 1.0)))) -1.0))))
     (fma (fma a (+ a 4.0) 4.0) (* a a) -1.0))))

C

double code(double a, double b) {
	double t_0 = fma(a, a, (b * b));
	double tmp;
	if ((pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= ((double) INFINITY)) {
		tmp = 1.0 / (1.0 / fma(t_0, t_0, fma(4.0, fma(a, fma(a, a, a), (b * (b * fma(a, -3.0, 1.0)))), -1.0)));
	} else {
		tmp = fma(fma(a, (a + 4.0), 4.0), (a * a), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = fma(a, a, Float64(b * b))
	tmp = 0.0
	if (Float64((Float64(Float64(a * a) + Float64(b * b)) ^ 2.0) + Float64(4.0 * Float64(Float64(Float64(a * a) * Float64(a + 1.0)) + Float64(Float64(b * b) * Float64(1.0 - Float64(a * 3.0)))))) <= Inf)
		tmp = Float64(1.0 / Float64(1.0 / fma(t_0, t_0, fma(4.0, fma(a, fma(a, a, a), Float64(b * Float64(b * fma(a, -3.0, 1.0)))), -1.0))));
	else
		tmp = fma(fma(a, Float64(a + 4.0), 4.0), Float64(a * a), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(a * a + N[(b * b), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[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[(a + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], Infinity], N[(1.0 / N[(1.0 / N[(t$95$0 * t$95$0 + N[(4.0 * N[(a * N[(a * a + a), $MachinePrecision] + N[(b * N[(b * N[(a * -3.0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(a * N[(a + 4.0), $MachinePrecision] + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) < +inf.0

   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

   4. Applied rewrites 99.9%

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

   if +inf.0 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a))))))

   1. Initial program 0.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 93.3

          \[\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 93.3%

      \[\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 93.3%

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

4. Final simplification 98.0%

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

Alternative 3: 50.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<=
      (+
       (pow (+ (* a a) (* b b)) 2.0)
       (* 4.0 (+ (* (* a a) (+ a 1.0)) (* (* b b) (- 1.0 (* a 3.0))))))
      5e-7)
   -1.0
   (* (* b b) 4.0)))

C

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

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (a + 1.0d0)) + ((b * b) * (1.0d0 - (a * 3.0d0)))))) <= 5d-7) then
        tmp = -1.0d0
    else
        tmp = (b * b) * 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((Math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 5e-7) {
		tmp = -1.0;
	} else {
		tmp = (b * b) * 4.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 5e-7:
		tmp = -1.0
	else:
		tmp = (b * b) * 4.0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))) <= 5e-7)
		tmp = -1.0;
	else
		tmp = (b * b) * 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[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[(a + 1.0), $MachinePrecision]), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * N[(1.0 - N[(a * 3.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], 5e-7], -1.0, N[(N[(b * b), $MachinePrecision] * 4.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a)))))) < 4.99999999999999977e-7

   1. Initial program 100.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 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 -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 98.8%

      \[\leadsto -1 \]

   if 4.99999999999999977e-7 < (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) #s(literal 2 binary64)) (*.f64 #s(literal 4 binary64) (+.f64 (*.f64 (*.f64 a a) (+.f64 #s(literal 1 binary64) a)) (*.f64 (*.f64 b b) (-.f64 #s(literal 1 binary64) (*.f64 #s(literal 3 binary64) a))))))

   1. Initial program 64.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 61.2

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

   5. Applied rewrites 61.2%

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

   7. Applied rewrites 61.2%

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

   8. Taylor expanded in b around inf

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

   10. Applied rewrites 61.4%

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

   11. Taylor expanded in b around 0

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

   13. Applied rewrites 36.0%

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

4. Final simplification 49.7%

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

Alternative 4: 97.8% accurate, 2.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (*.f64 b b) < 1.0000000000000001e-18

   1. Initial program 84.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 99.9

          \[\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.9%

      \[\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 \mathsf{fma}\left(\mathsf{fma}\left(a, a + 4, 4\right), \color{blue}{a \cdot a}, -1\right) \]

   if 1.0000000000000001e-18 < (*.f64 b b) < 2.00000000000000003e306

   1. Initial program 69.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 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 \left(4 \cdot {b}^{2} + \color{blue}{\left({b}^{4} + a \cdot \left(-12 \cdot {b}^{2} + a \cdot \left(4 + 2 \cdot {b}^{2}\right)\right)\right)}\right) - 1 \]

      2. associate-+r+ N/A

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

      3. associate--l+ N/A

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

      4. +-commutative N/A

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

      5. metadata-eval N/A

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

      6. pow-plus N/A

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

      7. cube-unmult N/A

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

      8. unpow2 N/A

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

      9. unpow2 N/A

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

      10. associate-*r* N/A

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

      11. distribute-rgt-out N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 92.5%

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

   if 2.00000000000000003e306 < (*.f64 b b)

   1. Initial program 54.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 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. Step-by-step derivation

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in b around inf

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

   10. Applied rewrites 100.0%

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

   11. Taylor expanded in b around 0

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

   13. Applied rewrites 100.0%

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

4. Final simplification 97.8%

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

Alternative 5: 94.2% accurate, 4.8× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -1.82e+19)
   (* a (* a (* a a)))
   (if (<= a 15.5)
     (fma (* b b) (fma b b 4.0) -1.0)
     (fma (fma a (+ a 4.0) 4.0) (* a a) -1.0))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -1.82e19

   1. Initial program 26.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 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. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 93.8

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

   5. Applied rewrites 93.8%

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

   if -1.82e19 < a < 15.5

   1. Initial program 99.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 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 99.2

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

   5. Applied rewrites 99.2%

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

   if 15.5 < a

   1. Initial program 60.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 89.9

          \[\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 89.9%

      \[\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 89.9%

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

Alternative 6: 94.2% accurate, 5.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{if}\;a \leq -1.82 \cdot 10^{+19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 4.6 \cdot 10^{+21}:\\ \;\;\;\;\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 -1.82e+19)
     t_0
     (if (<= a 4.6e+21) (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 <= -1.82e+19) {
		tmp = t_0;
	} else if (a <= 4.6e+21) {
		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(a * Float64(a * Float64(a * a)))
	tmp = 0.0
	if (a <= -1.82e+19)
		tmp = t_0;
	elseif (a <= 4.6e+21)
		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[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -1.82e+19], t$95$0, If[LessEqual[a, 4.6e+21], 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 < -1.82e19 or 4.6e21 < a

   1. Initial program 42.1%

      \[\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. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 93.0

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

   5. Applied rewrites 93.0%

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

   if -1.82e19 < a < 4.6e21

   1. Initial program 99.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 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 97.0

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

   5. Applied rewrites 97.0%

      \[\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 7: 81.2% accurate, 5.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := a \cdot \left(a \cdot \left(a \cdot a\right)\right)\\ \mathbf{if}\;a \leq -2.55 \cdot 10^{+18}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;a \leq 26:\\ \;\;\;\;\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 -2.55e+18) t_0 (if (<= a 26.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 <= -2.55e+18) {
		tmp = t_0;
	} else if (a <= 26.0) {
		tmp = fma((b * b), 4.0, -1.0);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(a, b)
	t_0 = Float64(a * Float64(a * Float64(a * a)))
	tmp = 0.0
	if (a <= -2.55e+18)
		tmp = t_0;
	elseif (a <= 26.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[(a * N[(a * N[(a * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[a, -2.55e+18], t$95$0, If[LessEqual[a, 26.0], N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if a < -2.55e18 or 26 < a

   1. Initial program 44.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 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. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. cube-mult N/A

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

      6. unpow2 N/A

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

      7. lower-*.f64 N/A

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

      8. unpow2 N/A

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

      9. lower-*.f64 90.3

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

   5. Applied rewrites 90.3%

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

   if -2.55e18 < a < 26

   1. Initial program 99.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 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 99.2

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

   5. Applied rewrites 99.2%

      \[\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 71.4%

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

Alternative 8: 82.2% accurate, 5.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 9.9999999999999995e-8

   1. Initial program 84.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.3

          \[\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.3%

      \[\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 70.1%

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

   if 9.9999999999999995e-8 < (*.f64 b b)

   1. Initial program 61.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 87.7

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

   5. Applied rewrites 87.7%

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

   7. Applied rewrites 87.7%

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

   8. Taylor expanded in b around inf

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

   10. Applied rewrites 87.4%

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

Alternative 9: 82.1% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 10^{-7}:\\ \;\;\;\;\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-7) (fma (* a a) 4.0 -1.0) (* (* b b) (* b b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e-7) {
		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-7)
		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-7], 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) < 9.9999999999999995e-8

   1. Initial program 84.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.3

          \[\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.3%

      \[\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 70.1%

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

   if 9.9999999999999995e-8 < (*.f64 b b)

   1. Initial program 61.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(2 \cdot 2\right)}} \]

      2. pow-sqr N/A

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

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

   7. Applied rewrites 86.9%

      \[\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 10: 82.1% accurate, 5.9× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 1e-7) {
		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-7)
		tmp = fma(Float64(a * a), 4.0, -1.0);
	else
		tmp = Float64(b * Float64(b * Float64(b * b)));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 9.9999999999999995e-8

   1. Initial program 84.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.3

          \[\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.3%

      \[\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 70.1%

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

   if 9.9999999999999995e-8 < (*.f64 b b)

   1. Initial program 61.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(2 \cdot 2\right)}} \]

      2. pow-sqr N/A

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

      3. unpow2 N/A

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

      4. associate-*l* N/A

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

      5. lower-*.f64 N/A

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

      6. lower-*.f64 N/A

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

      7. unpow2 N/A

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

      8. lower-*.f64 86.9

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

   5. Applied rewrites 86.9%

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

Alternative 11: 68.8% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 1.05 \cdot 10^{+305}:\\ \;\;\;\;\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) 1.05e+305) (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) <= 1.05e+305) {
		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) <= 1.05e+305)
		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], 1.05e+305], 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) < 1.05000000000000003e305

   1. Initial program 78.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 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 77.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 77.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. Taylor expanded in a around 0

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

   8. Applied rewrites 52.7%

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

   if 1.05000000000000003e305 < (*.f64 b b)

   1. Initial program 55.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 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 98.7%

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

Alternative 12: 68.8% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 1.05000000000000003e305

   1. Initial program 78.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 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 77.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 77.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. Taylor expanded in a around 0

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

   8. Applied rewrites 52.7%

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

   if 1.05000000000000003e305 < (*.f64 b b)

   1. Initial program 55.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 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. Step-by-step derivation

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in b around inf

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

   10. Applied rewrites 100.0%

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

   11. Taylor expanded in b around 0

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

   13. Applied rewrites 98.7%

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

4. Final simplification 64.7%

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

Alternative 13: 24.2% 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 72.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 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 69.7

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

5. Applied rewrites 69.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 -1 \]
7. Step-by-step derivation

8. Applied rewrites 22.2%

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

Reproduce

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