Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.8% → 98.0%

Time: 6.7s

Alternatives: 4

Speedup: 1.1×

• 60.7% 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.8% 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.0% 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}:\\ \;\;\;\;{a}^{4} + -1\\ \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) (+ (pow a 4.0) -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 = pow(a, 4.0) + -1.0;
	}
	return tmp;
}

Java

public static double code(double a, double b) {
	double t_0 = Math.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.POSITIVE_INFINITY) {
		tmp = t_0 + -1.0;
	} else {
		tmp = Math.pow(a, 4.0) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))))
	tmp = 0
	if t_0 <= math.inf:
		tmp = t_0 + -1.0
	else:
		tmp = math.pow(a, 4.0) + -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 = Float64((a ^ 4.0) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = (((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (a + 1.0)) + ((b * b) * (1.0 - (a * 3.0)))));
	tmp = 0.0;
	if (t_0 <= Inf)
		tmp = t_0 + -1.0;
	else
		tmp = (a ^ 4.0) + -1.0;
	end
	tmp_2 = 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[Power[a, 4.0], $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (pow.f64 (+.f64 (*.f64 a a) (*.f64 b b)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (+.f64 1 a)) (*.f64 (*.f64 b b) (-.f64 1 (*.f64 3 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)) 2) (*.f64 4 (+.f64 (*.f64 (*.f64 a a) (+.f64 1 a)) (*.f64 (*.f64 b b) (-.f64 1 (*.f64 3 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. Step-by-step derivation

      1. sub-neg 0.0%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 4.8%

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

   5. Taylor expanded in a around inf 92.3%

      \[\leadsto \color{blue}{{a}^{4}} + -1 \]
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:\\ \;\;\;\;\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}:\\ \;\;\;\;{a}^{4} + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 80.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq 1.26 \cdot 10^{+35}:\\ \;\;\;\;-1 + {a}^{3} \cdot \left(a + 4\right)\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+59} \lor \neg \left(b \leq 1.26 \cdot 10^{+74}\right):\\ \;\;\;\;-1 + {b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4} + -1\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= b 1.26e+35)
   (+ -1.0 (* (pow a 3.0) (+ a 4.0)))
   (if (or (<= b 7.2e+59) (not (<= b 1.26e+74)))
     (+ -1.0 (pow b 4.0))
     (+ (pow a 4.0) -1.0))))

C

double code(double a, double b) {
	double tmp;
	if (b <= 1.26e+35) {
		tmp = -1.0 + (pow(a, 3.0) * (a + 4.0));
	} else if ((b <= 7.2e+59) || !(b <= 1.26e+74)) {
		tmp = -1.0 + pow(b, 4.0);
	} else {
		tmp = pow(a, 4.0) + -1.0;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if (b <= 1.26d+35) then
        tmp = (-1.0d0) + ((a ** 3.0d0) * (a + 4.0d0))
    else if ((b <= 7.2d+59) .or. (.not. (b <= 1.26d+74))) then
        tmp = (-1.0d0) + (b ** 4.0d0)
    else
        tmp = (a ** 4.0d0) + (-1.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (b <= 1.26e+35) {
		tmp = -1.0 + (Math.pow(a, 3.0) * (a + 4.0));
	} else if ((b <= 7.2e+59) || !(b <= 1.26e+74)) {
		tmp = -1.0 + Math.pow(b, 4.0);
	} else {
		tmp = Math.pow(a, 4.0) + -1.0;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if b <= 1.26e+35:
		tmp = -1.0 + (math.pow(a, 3.0) * (a + 4.0))
	elif (b <= 7.2e+59) or not (b <= 1.26e+74):
		tmp = -1.0 + math.pow(b, 4.0)
	else:
		tmp = math.pow(a, 4.0) + -1.0
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (b <= 1.26e+35)
		tmp = Float64(-1.0 + Float64((a ^ 3.0) * Float64(a + 4.0)));
	elseif ((b <= 7.2e+59) || !(b <= 1.26e+74))
		tmp = Float64(-1.0 + (b ^ 4.0));
	else
		tmp = Float64((a ^ 4.0) + -1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (b <= 1.26e+35)
		tmp = -1.0 + ((a ^ 3.0) * (a + 4.0));
	elseif ((b <= 7.2e+59) || ~((b <= 1.26e+74)))
		tmp = -1.0 + (b ^ 4.0);
	else
		tmp = (a ^ 4.0) + -1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[b, 1.26e+35], N[(-1.0 + N[(N[Power[a, 3.0], $MachinePrecision] * N[(a + 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[b, 7.2e+59], N[Not[LessEqual[b, 1.26e+74]], $MachinePrecision]], N[(-1.0 + N[Power[b, 4.0], $MachinePrecision]), $MachinePrecision], N[(N[Power[a, 4.0], $MachinePrecision] + -1.0), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < 1.26e35

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

      1. sub-neg 78.1%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 79.6%

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

   5. Taylor expanded in b around 0 64.3%

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

      1. add-cube-cbrt 64.3%

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

      2. fma-define 64.3%

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

   7. Applied egg-rr 64.3%

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

   8. Taylor expanded in a around inf 62.7%

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

      1. metadata-eval 62.7%

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

      2. pow-sqr 62.7%

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

      3. unpow2 62.7%

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

      4. associate-*l* 62.7%

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

      5. unpow2 62.7%

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

      6. cube-mult 62.7%

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

      7. distribute-rgt-out 80.1%

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

   10. Simplified 80.1%

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

   if 1.26e35 < b < 7.1999999999999997e59 or 1.26000000000000008e74 < b

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

      1. sub-neg 68.6%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 68.6%

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

   5. Taylor expanded in b around inf 98.2%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]

   if 7.1999999999999997e59 < b < 1.26000000000000008e74

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

      1. sub-neg 33.3%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 33.3%

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

   5. Taylor expanded in a around inf 100.0%

      \[\leadsto \color{blue}{{a}^{4}} + -1 \]
3. Recombined 3 regimes into one program.

4. Final simplification 83.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq 1.26 \cdot 10^{+35}:\\ \;\;\;\;-1 + {a}^{3} \cdot \left(a + 4\right)\\ \mathbf{elif}\;b \leq 7.2 \cdot 10^{+59} \lor \neg \left(b \leq 1.26 \cdot 10^{+74}\right):\\ \;\;\;\;-1 + {b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4} + -1\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 93.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{+37} \lor \neg \left(a \leq 3.45 \cdot 10^{+22}\right):\\ \;\;\;\;{a}^{4} + -1\\ \mathbf{else}:\\ \;\;\;\;-1 + {b}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -3.1e+37) (not (<= a 3.45e+22)))
   (+ (pow a 4.0) -1.0)
   (+ -1.0 (pow b 4.0))))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -3.1e+37) || !(a <= 3.45e+22)) {
		tmp = pow(a, 4.0) + -1.0;
	} else {
		tmp = -1.0 + pow(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 <= (-3.1d+37)) .or. (.not. (a <= 3.45d+22))) then
        tmp = (a ** 4.0d0) + (-1.0d0)
    else
        tmp = (-1.0d0) + (b ** 4.0d0)
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((a <= -3.1e+37) || !(a <= 3.45e+22)) {
		tmp = Math.pow(a, 4.0) + -1.0;
	} else {
		tmp = -1.0 + Math.pow(b, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (a <= -3.1e+37) or not (a <= 3.45e+22):
		tmp = math.pow(a, 4.0) + -1.0
	else:
		tmp = -1.0 + math.pow(b, 4.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -3.1e+37) || !(a <= 3.45e+22))
		tmp = Float64((a ^ 4.0) + -1.0);
	else
		tmp = Float64(-1.0 + (b ^ 4.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((a <= -3.1e+37) || ~((a <= 3.45e+22)))
		tmp = (a ^ 4.0) + -1.0;
	else
		tmp = -1.0 + (b ^ 4.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -3.1e+37], N[Not[LessEqual[a, 3.45e+22]], $MachinePrecision]], N[(N[Power[a, 4.0], $MachinePrecision] + -1.0), $MachinePrecision], N[(-1.0 + N[Power[b, 4.0], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -3.1000000000000002e37 or 3.4499999999999999e22 < a

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

      1. sub-neg 44.8%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 47.6%

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

   5. Taylor expanded in a around inf 97.4%

      \[\leadsto \color{blue}{{a}^{4}} + -1 \]

   if -3.1000000000000002e37 < a < 3.4499999999999999e22

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

      1. sub-neg 97.9%

         \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

   3. Simplified 97.9%

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

   5. Taylor expanded in b around inf 92.5%

      \[\leadsto \color{blue}{{b}^{4}} + -1 \]
3. Recombined 2 regimes into one program.

4. Final simplification 94.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -3.1 \cdot 10^{+37} \lor \neg \left(a \leq 3.45 \cdot 10^{+22}\right):\\ \;\;\;\;{a}^{4} + -1\\ \mathbf{else}:\\ \;\;\;\;-1 + {b}^{4}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 69.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ {a}^{4} + -1 \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 75.7%

   \[\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. Step-by-step derivation

   1. sub-neg 75.7%

      \[\leadsto \color{blue}{\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) + \left(-1\right)} \]

3. Simplified 76.9%

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

5. Taylor expanded in a around inf 69.9%

   \[\leadsto \color{blue}{{a}^{4}} + -1 \]

6. Final simplification 69.9%

   \[\leadsto {a}^{4} + -1 \]
7. Add Preprocessing

Reproduce

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