Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.7% → 98.3%

Time: 4.8s

Alternatives: 7

Speedup: 1.1×

• 61.1% 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.3% accurate, 0.2× 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 \infty:\\ \;\;\;\;\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), {\left(\mathsf{hypot}\left(a, b\right)\right)}^{4}\right) + -1\\ \mathbf{else}:\\ \;\;\;\;{a}^{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))))))
      INFINITY)
   (+
    (fma
     4.0
     (fma a (fma a a a) (* b (* b (fma a -3.0 1.0))))
     (pow (hypot a b) 4.0))
    -1.0)
   (pow a 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)))))) <= ((double) INFINITY)) {
		tmp = fma(4.0, fma(a, fma(a, a, a), (b * (b * fma(a, -3.0, 1.0)))), pow(hypot(a, b), 4.0)) + -1.0;
	} else {
		tmp = pow(a, 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)))))) <= Inf)
		tmp = Float64(fma(4.0, fma(a, fma(a, a, a), Float64(b * Float64(b * fma(a, -3.0, 1.0)))), (hypot(a, b) ^ 4.0)) + -1.0);
	else
		tmp = a ^ 4.0;
	end
	return 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], Infinity], N[(N[(4.0 * N[(a * N[(a * a + a), $MachinePrecision] + N[(b * N[(b * N[(a * -3.0 + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[Power[N[Sqrt[a ^ 2 + b ^ 2], $MachinePrecision], 4.0], $MachinePrecision]), $MachinePrecision] + -1.0), $MachinePrecision], N[Power[a, 4.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.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 99.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 100.0%

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

   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. associate--l+ 0.0%

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

      2. fma-def 0.0%

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

   3. Simplified 4.1%

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

   4. Taylor expanded in a around inf 97.4%

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

4. Final simplification 99.2%

   \[\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:\\ \;\;\;\;\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), {\left(\mathsf{hypot}\left(a, b\right)\right)}^{4}\right) + -1\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \]

Alternative 2: 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}:\\ \;\;\;\;{a}^{4}\\ \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))))

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);
	}
	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);
	}
	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)
	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 = a ^ 4.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;
	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[Power[a, 4.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.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 \]

   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. associate--l+ 0.0%

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

      2. fma-def 0.0%

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

   3. Simplified 4.1%

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

   4. Taylor expanded in a around inf 97.4%

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

4. Final simplification 99.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}:\\ \;\;\;\;{a}^{4}\\ \end{array} \]

Alternative 3: 80.0% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := {a}^{4} + \left(-1 + \left(a + 1\right) \cdot \left(\left(a \cdot a\right) \cdot 4\right)\right)\\ \mathbf{if}\;b \leq -4.2 \cdot 10^{+31}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;b \leq -8.5 \cdot 10^{-267}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{-278}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;b \leq 4.8 \cdot 10^{-130}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{+60}:\\ \;\;\;\;{a}^{3} \cdot \left(a + 4\right)\\ \mathbf{else}:\\ \;\;\;\;{b}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0 (+ (pow a 4.0) (+ -1.0 (* (+ a 1.0) (* (* a a) 4.0))))))
   (if (<= b -4.2e+31)
     (pow b 4.0)
     (if (<= b -8.5e-267)
       t_0
       (if (<= b 3.2e-278)
         (pow a 4.0)
         (if (<= b 4.8e-130)
           t_0
           (if (<= b 2.1e+60) (* (pow a 3.0) (+ a 4.0)) (pow b 4.0))))))))

C

double code(double a, double b) {
	double t_0 = pow(a, 4.0) + (-1.0 + ((a + 1.0) * ((a * a) * 4.0)));
	double tmp;
	if (b <= -4.2e+31) {
		tmp = pow(b, 4.0);
	} else if (b <= -8.5e-267) {
		tmp = t_0;
	} else if (b <= 3.2e-278) {
		tmp = pow(a, 4.0);
	} else if (b <= 4.8e-130) {
		tmp = t_0;
	} else if (b <= 2.1e+60) {
		tmp = pow(a, 3.0) * (a + 4.0);
	} else {
		tmp = 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) :: t_0
    real(8) :: tmp
    t_0 = (a ** 4.0d0) + ((-1.0d0) + ((a + 1.0d0) * ((a * a) * 4.0d0)))
    if (b <= (-4.2d+31)) then
        tmp = b ** 4.0d0
    else if (b <= (-8.5d-267)) then
        tmp = t_0
    else if (b <= 3.2d-278) then
        tmp = a ** 4.0d0
    else if (b <= 4.8d-130) then
        tmp = t_0
    else if (b <= 2.1d+60) then
        tmp = (a ** 3.0d0) * (a + 4.0d0)
    else
        tmp = b ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double t_0 = Math.pow(a, 4.0) + (-1.0 + ((a + 1.0) * ((a * a) * 4.0)));
	double tmp;
	if (b <= -4.2e+31) {
		tmp = Math.pow(b, 4.0);
	} else if (b <= -8.5e-267) {
		tmp = t_0;
	} else if (b <= 3.2e-278) {
		tmp = Math.pow(a, 4.0);
	} else if (b <= 4.8e-130) {
		tmp = t_0;
	} else if (b <= 2.1e+60) {
		tmp = Math.pow(a, 3.0) * (a + 4.0);
	} else {
		tmp = Math.pow(b, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = math.pow(a, 4.0) + (-1.0 + ((a + 1.0) * ((a * a) * 4.0)))
	tmp = 0
	if b <= -4.2e+31:
		tmp = math.pow(b, 4.0)
	elif b <= -8.5e-267:
		tmp = t_0
	elif b <= 3.2e-278:
		tmp = math.pow(a, 4.0)
	elif b <= 4.8e-130:
		tmp = t_0
	elif b <= 2.1e+60:
		tmp = math.pow(a, 3.0) * (a + 4.0)
	else:
		tmp = math.pow(b, 4.0)
	return tmp

Julia

function code(a, b)
	t_0 = Float64((a ^ 4.0) + Float64(-1.0 + Float64(Float64(a + 1.0) * Float64(Float64(a * a) * 4.0))))
	tmp = 0.0
	if (b <= -4.2e+31)
		tmp = b ^ 4.0;
	elseif (b <= -8.5e-267)
		tmp = t_0;
	elseif (b <= 3.2e-278)
		tmp = a ^ 4.0;
	elseif (b <= 4.8e-130)
		tmp = t_0;
	elseif (b <= 2.1e+60)
		tmp = Float64((a ^ 3.0) * Float64(a + 4.0));
	else
		tmp = b ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = (a ^ 4.0) + (-1.0 + ((a + 1.0) * ((a * a) * 4.0)));
	tmp = 0.0;
	if (b <= -4.2e+31)
		tmp = b ^ 4.0;
	elseif (b <= -8.5e-267)
		tmp = t_0;
	elseif (b <= 3.2e-278)
		tmp = a ^ 4.0;
	elseif (b <= 4.8e-130)
		tmp = t_0;
	elseif (b <= 2.1e+60)
		tmp = (a ^ 3.0) * (a + 4.0);
	else
		tmp = b ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(N[Power[a, 4.0], $MachinePrecision] + N[(-1.0 + N[(N[(a + 1.0), $MachinePrecision] * N[(N[(a * a), $MachinePrecision] * 4.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -4.2e+31], N[Power[b, 4.0], $MachinePrecision], If[LessEqual[b, -8.5e-267], t$95$0, If[LessEqual[b, 3.2e-278], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[b, 4.8e-130], t$95$0, If[LessEqual[b, 2.1e+60], N[(N[Power[a, 3.0], $MachinePrecision] * N[(a + 4.0), $MachinePrecision]), $MachinePrecision], N[Power[b, 4.0], $MachinePrecision]]]]]]]

Derivation

1. Split input into 4 regimes

2. if b < -4.19999999999999958e31 or 2.1000000000000001e60 < b

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

      1. associate--l+ 66.2%

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

      2. fma-def 66.2%

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

   3. Simplified 68.9%

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

   4. Taylor expanded in b around inf 97.5%

      \[\leadsto \color{blue}{{b}^{4}} \]

   if -4.19999999999999958e31 < b < -8.49999999999999987e-267 or 3.20000000000000018e-278 < b < 4.79999999999999993e-130

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

      1. associate--l+ 87.4%

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

      2. fma-def 87.4%

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

   3. Simplified 87.4%

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

   4. Taylor expanded in b around 0 86.0%

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

      1. associate--l+ 86.0%

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

      2. associate-*r* 86.0%

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

      3. unpow2 86.0%

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

   6. Simplified 86.0%

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

   if -8.49999999999999987e-267 < b < 3.20000000000000018e-278

   1. Initial program 42.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. associate--l+ 42.9%

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

      2. fma-def 42.9%

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

   3. Simplified 42.9%

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

   4. Taylor expanded in a around inf 72.3%

      \[\leadsto \color{blue}{{a}^{4}} \]

   if 4.79999999999999993e-130 < b < 2.1000000000000001e60

   1. Initial program 64.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. associate--l+ 64.3%

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

      2. fma-def 64.3%

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

   3. Simplified 64.3%

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

   4. Taylor expanded in b around 0 48.2%

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

      1. associate--l+ 48.2%

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

      2. associate-*r* 48.2%

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

      3. unpow2 48.2%

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

   6. Simplified 48.2%

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

   7. Taylor expanded in a around inf 32.5%

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

      1. *-commutative 32.5%

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

      2. metadata-eval 32.5%

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

      3. pow-plus 32.4%

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

      4. distribute-lft-out 63.7%

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

   9. Simplified 63.7%

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

4. Final simplification 86.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \leq -4.2 \cdot 10^{+31}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;b \leq -8.5 \cdot 10^{-267}:\\ \;\;\;\;{a}^{4} + \left(-1 + \left(a + 1\right) \cdot \left(\left(a \cdot a\right) \cdot 4\right)\right)\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{-278}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;b \leq 4.8 \cdot 10^{-130}:\\ \;\;\;\;{a}^{4} + \left(-1 + \left(a + 1\right) \cdot \left(\left(a \cdot a\right) \cdot 4\right)\right)\\ \mathbf{elif}\;b \leq 2.1 \cdot 10^{+60}:\\ \;\;\;\;{a}^{3} \cdot \left(a + 4\right)\\ \mathbf{else}:\\ \;\;\;\;{b}^{4}\\ \end{array} \]

Alternative 4: 69.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -34:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;a \leq 2 \cdot 10^{-153}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;a \leq 1.85 \cdot 10^{-48}:\\ \;\;\;\;-1\\ \mathbf{elif}\;a \leq 4.2 \cdot 10^{+24}:\\ \;\;\;\;{b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -34.0)
   (pow a 4.0)
   (if (<= a 2e-153)
     (pow b 4.0)
     (if (<= a 1.85e-48) -1.0 (if (<= a 4.2e+24) (pow b 4.0) (pow a 4.0))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -34.0) {
		tmp = pow(a, 4.0);
	} else if (a <= 2e-153) {
		tmp = pow(b, 4.0);
	} else if (a <= 1.85e-48) {
		tmp = -1.0;
	} else if (a <= 4.2e+24) {
		tmp = pow(b, 4.0);
	} else {
		tmp = pow(a, 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 <= (-34.0d0)) then
        tmp = a ** 4.0d0
    else if (a <= 2d-153) then
        tmp = b ** 4.0d0
    else if (a <= 1.85d-48) then
        tmp = -1.0d0
    else if (a <= 4.2d+24) then
        tmp = b ** 4.0d0
    else
        tmp = a ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -34.0) {
		tmp = Math.pow(a, 4.0);
	} else if (a <= 2e-153) {
		tmp = Math.pow(b, 4.0);
	} else if (a <= 1.85e-48) {
		tmp = -1.0;
	} else if (a <= 4.2e+24) {
		tmp = Math.pow(b, 4.0);
	} else {
		tmp = Math.pow(a, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -34.0:
		tmp = math.pow(a, 4.0)
	elif a <= 2e-153:
		tmp = math.pow(b, 4.0)
	elif a <= 1.85e-48:
		tmp = -1.0
	elif a <= 4.2e+24:
		tmp = math.pow(b, 4.0)
	else:
		tmp = math.pow(a, 4.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -34.0)
		tmp = a ^ 4.0;
	elseif (a <= 2e-153)
		tmp = b ^ 4.0;
	elseif (a <= 1.85e-48)
		tmp = -1.0;
	elseif (a <= 4.2e+24)
		tmp = b ^ 4.0;
	else
		tmp = a ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -34.0)
		tmp = a ^ 4.0;
	elseif (a <= 2e-153)
		tmp = b ^ 4.0;
	elseif (a <= 1.85e-48)
		tmp = -1.0;
	elseif (a <= 4.2e+24)
		tmp = b ^ 4.0;
	else
		tmp = a ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -34.0], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[a, 2e-153], N[Power[b, 4.0], $MachinePrecision], If[LessEqual[a, 1.85e-48], -1.0, If[LessEqual[a, 4.2e+24], N[Power[b, 4.0], $MachinePrecision], N[Power[a, 4.0], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if a < -34 or 4.2000000000000003e24 < a

   1. Initial program 43.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. associate--l+ 43.1%

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

      2. fma-def 43.1%

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

   3. Simplified 45.5%

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

   4. Taylor expanded in a around inf 92.1%

      \[\leadsto \color{blue}{{a}^{4}} \]

   if -34 < a < 2.00000000000000008e-153 or 1.8499999999999999e-48 < a < 4.2000000000000003e24

   1. Initial program 98.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. associate--l+ 98.8%

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

      2. fma-def 98.8%

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

   3. Simplified 98.8%

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

   4. Taylor expanded in b around inf 66.4%

      \[\leadsto \color{blue}{{b}^{4}} \]

   if 2.00000000000000008e-153 < a < 1.8499999999999999e-48

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

      1. associate--l+ 99.9%

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

      2. fma-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in b around 0 66.8%

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

      1. associate--l+ 66.8%

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

      2. associate-*r* 66.8%

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

      3. unpow2 66.8%

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

   6. Simplified 66.8%

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

   7. Taylor expanded in a around 0 66.8%

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

4. Final simplification 79.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -34:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;a \leq 2 \cdot 10^{-153}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;a \leq 1.85 \cdot 10^{-48}:\\ \;\;\;\;-1\\ \mathbf{elif}\;a \leq 4.2 \cdot 10^{+24}:\\ \;\;\;\;{b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \]

Alternative 5: 69.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -34:\\ \;\;\;\;{a}^{3} \cdot \left(a + 4\right)\\ \mathbf{elif}\;a \leq 2 \cdot 10^{-153}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;a \leq 4.7 \cdot 10^{-49}:\\ \;\;\;\;-1\\ \mathbf{elif}\;a \leq 3.9 \cdot 10^{+25}:\\ \;\;\;\;{b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -34.0)
   (* (pow a 3.0) (+ a 4.0))
   (if (<= a 2e-153)
     (pow b 4.0)
     (if (<= a 4.7e-49) -1.0 (if (<= a 3.9e+25) (pow b 4.0) (pow a 4.0))))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -34.0) {
		tmp = pow(a, 3.0) * (a + 4.0);
	} else if (a <= 2e-153) {
		tmp = pow(b, 4.0);
	} else if (a <= 4.7e-49) {
		tmp = -1.0;
	} else if (a <= 3.9e+25) {
		tmp = pow(b, 4.0);
	} else {
		tmp = pow(a, 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 <= (-34.0d0)) then
        tmp = (a ** 3.0d0) * (a + 4.0d0)
    else if (a <= 2d-153) then
        tmp = b ** 4.0d0
    else if (a <= 4.7d-49) then
        tmp = -1.0d0
    else if (a <= 3.9d+25) then
        tmp = b ** 4.0d0
    else
        tmp = a ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -34.0) {
		tmp = Math.pow(a, 3.0) * (a + 4.0);
	} else if (a <= 2e-153) {
		tmp = Math.pow(b, 4.0);
	} else if (a <= 4.7e-49) {
		tmp = -1.0;
	} else if (a <= 3.9e+25) {
		tmp = Math.pow(b, 4.0);
	} else {
		tmp = Math.pow(a, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -34.0:
		tmp = math.pow(a, 3.0) * (a + 4.0)
	elif a <= 2e-153:
		tmp = math.pow(b, 4.0)
	elif a <= 4.7e-49:
		tmp = -1.0
	elif a <= 3.9e+25:
		tmp = math.pow(b, 4.0)
	else:
		tmp = math.pow(a, 4.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -34.0)
		tmp = Float64((a ^ 3.0) * Float64(a + 4.0));
	elseif (a <= 2e-153)
		tmp = b ^ 4.0;
	elseif (a <= 4.7e-49)
		tmp = -1.0;
	elseif (a <= 3.9e+25)
		tmp = b ^ 4.0;
	else
		tmp = a ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -34.0)
		tmp = (a ^ 3.0) * (a + 4.0);
	elseif (a <= 2e-153)
		tmp = b ^ 4.0;
	elseif (a <= 4.7e-49)
		tmp = -1.0;
	elseif (a <= 3.9e+25)
		tmp = b ^ 4.0;
	else
		tmp = a ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -34.0], N[(N[Power[a, 3.0], $MachinePrecision] * N[(a + 4.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 2e-153], N[Power[b, 4.0], $MachinePrecision], If[LessEqual[a, 4.7e-49], -1.0, If[LessEqual[a, 3.9e+25], N[Power[b, 4.0], $MachinePrecision], N[Power[a, 4.0], $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if a < -34

   1. Initial program 31.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. associate--l+ 31.8%

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

      2. fma-def 31.8%

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

   3. Simplified 35.9%

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

   4. Taylor expanded in b around 0 26.6%

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

      1. associate--l+ 26.6%

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

      2. associate-*r* 26.6%

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

      3. unpow2 26.6%

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

   6. Simplified 26.6%

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

   7. Taylor expanded in a around inf 24.5%

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

      1. *-commutative 24.5%

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

      2. metadata-eval 24.5%

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

      3. pow-plus 24.5%

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

      4. distribute-lft-out 92.5%

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

   9. Simplified 92.5%

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

   if -34 < a < 2.00000000000000008e-153 or 4.70000000000000021e-49 < a < 3.9000000000000002e25

   1. Initial program 98.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. associate--l+ 98.8%

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

      2. fma-def 98.8%

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

   3. Simplified 98.8%

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

   4. Taylor expanded in b around inf 66.4%

      \[\leadsto \color{blue}{{b}^{4}} \]

   if 2.00000000000000008e-153 < a < 4.70000000000000021e-49

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

      1. associate--l+ 99.9%

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

      2. fma-def 99.9%

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

   3. Simplified 99.9%

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

   4. Taylor expanded in b around 0 66.8%

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

      1. associate--l+ 66.8%

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

      2. associate-*r* 66.8%

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

      3. unpow2 66.8%

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

   6. Simplified 66.8%

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

   7. Taylor expanded in a around 0 66.8%

      \[\leadsto \color{blue}{-1} \]

   if 3.9000000000000002e25 < a

   1. Initial program 58.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. associate--l+ 58.0%

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

      2. fma-def 58.0%

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

   3. Simplified 58.0%

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

   4. Taylor expanded in a around inf 93.2%

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

4. Final simplification 79.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -34:\\ \;\;\;\;{a}^{3} \cdot \left(a + 4\right)\\ \mathbf{elif}\;a \leq 2 \cdot 10^{-153}:\\ \;\;\;\;{b}^{4}\\ \mathbf{elif}\;a \leq 4.7 \cdot 10^{-49}:\\ \;\;\;\;-1\\ \mathbf{elif}\;a \leq 3.9 \cdot 10^{+25}:\\ \;\;\;\;{b}^{4}\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \]

Alternative 6: 68.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{-8}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;a \leq 0.0265:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -4.8e-8) (pow a 4.0) (if (<= a 0.0265) -1.0 (pow a 4.0))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -4.8e-8) {
		tmp = pow(a, 4.0);
	} else if (a <= 0.0265) {
		tmp = -1.0;
	} else {
		tmp = pow(a, 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 <= (-4.8d-8)) then
        tmp = a ** 4.0d0
    else if (a <= 0.0265d0) then
        tmp = -1.0d0
    else
        tmp = a ** 4.0d0
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= -4.8e-8) {
		tmp = Math.pow(a, 4.0);
	} else if (a <= 0.0265) {
		tmp = -1.0;
	} else {
		tmp = Math.pow(a, 4.0);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= -4.8e-8:
		tmp = math.pow(a, 4.0)
	elif a <= 0.0265:
		tmp = -1.0
	else:
		tmp = math.pow(a, 4.0)
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -4.8e-8)
		tmp = a ^ 4.0;
	elseif (a <= 0.0265)
		tmp = -1.0;
	else
		tmp = a ^ 4.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= -4.8e-8)
		tmp = a ^ 4.0;
	elseif (a <= 0.0265)
		tmp = -1.0;
	else
		tmp = a ^ 4.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[a, -4.8e-8], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[a, 0.0265], -1.0, N[Power[a, 4.0], $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -4.79999999999999997e-8 or 0.0264999999999999993 < a

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

      1. associate--l+ 46.5%

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

      2. fma-def 46.5%

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

   3. Simplified 48.7%

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

   4. Taylor expanded in a around inf 86.2%

      \[\leadsto \color{blue}{{a}^{4}} \]

   if -4.79999999999999997e-8 < a < 0.0264999999999999993

   1. Initial program 99.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. associate--l+ 99.8%

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

      2. fma-def 99.8%

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

   3. Simplified 99.8%

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

   4. Taylor expanded in b around 0 41.3%

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

      1. associate--l+ 41.3%

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

      2. associate-*r* 41.3%

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

      3. unpow2 41.3%

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

   6. Simplified 41.3%

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

   7. Taylor expanded in a around 0 41.3%

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

4. Final simplification 65.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;a \leq -4.8 \cdot 10^{-8}:\\ \;\;\;\;{a}^{4}\\ \mathbf{elif}\;a \leq 0.0265:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;{a}^{4}\\ \end{array} \]

Alternative 7: 25.2% accurate, 130.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 71.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. associate--l+ 71.3%

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

   2. fma-def 71.3%

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

3. Simplified 72.5%

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

4. Taylor expanded in b around 0 47.6%

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

   1. associate--l+ 47.6%

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

   2. associate-*r* 47.6%

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

   3. unpow2 47.6%

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

6. Simplified 47.6%

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

7. Taylor expanded in a around 0 19.6%

   \[\leadsto \color{blue}{-1} \]

8. Final simplification 19.6%

   \[\leadsto -1 \]

Reproduce

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