Bouland and Aaronson, Equation (25)

Percentage Accurate: 73.1% → 99.1%

Time: 6.3s

Alternatives: 10

Speedup: 5.5×

• 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b)
use fmin_fmax_functions
    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.1% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.1% accurate, 4.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{fma}\left(b, b, a \cdot a\right)\\ \mathsf{fma}\left(t\_0, t\_0, \mathsf{fma}\left(b \cdot b, 4, -1\right)\right) \end{array} \end{array} \]

FPCore

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

C

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

Julia

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

Wolfram

code[a_, b_] := Block[{t$95$0 = N[(b * b + N[(a * a), $MachinePrecision]), $MachinePrecision]}, N[(t$95$0 * t$95$0 + N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision]), $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. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

      \[\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) - 1} \]

   2. lift-+.f64 N/A

      \[\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)} - 1 \]

   3. associate--l+ N/A

      \[\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)} \]

   4. lift-pow.f64 N/A

      \[\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) \]

   5. unpow2 N/A

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

   6. lower-fma.f64 N/A

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

   7. lift-+.f64 N/A

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

   8. +-commutative N/A

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

   9. lift-*.f64 N/A

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

   10. lower-fma.f64 N/A

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

   11. lift-+.f64 N/A

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

   12. +-commutative N/A

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

   13. lift-*.f64 N/A

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

   14. lower-fma.f64 N/A

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

4. Applied rewrites 77.2%

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

5. Taylor expanded in a around 0

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

7. Applied rewrites 98.5%

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

Alternative 2: 79.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_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\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+162} \lor \neg \left(t\_0 \leq 10^{+264} \lor \neg \left(t\_0 \leq \infty\right)\right):\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(b \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\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) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a))))))
          1.0)))
   (if (<= t_0 -0.5)
     -1.0
     (if (or (<= t_0 2e+162)
             (not (or (<= t_0 1e+264) (not (<= t_0 INFINITY)))))
       (* (* b b) (* b b))
       (* (* a a) (* a a))))))

C

double code(double a, double b) {
	double t_0 = (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = -1.0;
	} else if ((t_0 <= 2e+162) || !((t_0 <= 1e+264) || !(t_0 <= ((double) INFINITY)))) {
		tmp = (b * b) * (b * b);
	} else {
		tmp = (a * a) * (a * a);
	}
	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) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = -1.0;
	} else if ((t_0 <= 2e+162) || !((t_0 <= 1e+264) || !(t_0 <= Double.POSITIVE_INFINITY))) {
		tmp = (b * b) * (b * b);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0
	tmp = 0
	if t_0 <= -0.5:
		tmp = -1.0
	elif (t_0 <= 2e+162) or not ((t_0 <= 1e+264) or not (t_0 <= math.inf)):
		tmp = (b * b) * (b * b)
	else:
		tmp = (a * a) * (a * a)
	return tmp

Julia

function code(a, b)
	t_0 = 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)
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = -1.0;
	elseif ((t_0 <= 2e+162) || !((t_0 <= 1e+264) || !(t_0 <= Inf)))
		tmp = Float64(Float64(b * b) * Float64(b * b));
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	tmp = 0.0;
	if (t_0 <= -0.5)
		tmp = -1.0;
	elseif ((t_0 <= 2e+162) || ~(((t_0 <= 1e+264) || ~((t_0 <= Inf)))))
		tmp = (b * b) * (b * b);
	else
		tmp = (a * a) * (a * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -0.5], -1.0, If[Or[LessEqual[t$95$0, 2e+162], N[Not[Or[LessEqual[t$95$0, 1e+264], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]]], $MachinePrecision]], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 (+.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)))))) #s(literal 1 binary64)) < -0.5

   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 inf

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.5%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 97.1%

       \[\leadsto -1 \]

   if -0.5 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < 1.9999999999999999e162 or 1.00000000000000004e264 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < +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

   3. Taylor expanded in b around inf

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

   5. Applied rewrites 73.1%

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

   7. Applied rewrites 73.1%

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

   if 1.9999999999999999e162 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < 1.00000000000000004e264 or +inf.0 < (-.f64 (+.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)))))) #s(literal 1 binary64))

   1. Initial program 24.2%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 93.1%

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

   7. Applied rewrites 92.9%

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

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;\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 \leq 2 \cdot 10^{+162} \lor \neg \left(\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 \leq 10^{+264} \lor \neg \left(\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 \leq \infty\right)\right):\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(b \cdot b\right)\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 79.2% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_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\\ \mathbf{if}\;t\_0 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;t\_0 \leq 2 \cdot 10^{+162}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(b \cdot b\right)\\ \mathbf{elif}\;t\_0 \leq 10^{+264} \lor \neg \left(t\_0 \leq \infty\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(b \cdot b\right) \cdot b\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (let* ((t_0
         (-
          (+
           (pow (+ (* a a) (* b b)) 2.0)
           (* 4.0 (+ (* (* a a) (+ 1.0 a)) (* (* b b) (- 1.0 (* 3.0 a))))))
          1.0)))
   (if (<= t_0 -0.5)
     -1.0
     (if (<= t_0 2e+162)
       (* (* b b) (* b b))
       (if (or (<= t_0 1e+264) (not (<= t_0 INFINITY)))
         (* (* a a) (* a a))
         (* (* (* b b) b) b))))))

C

double code(double a, double b) {
	double t_0 = (pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = -1.0;
	} else if (t_0 <= 2e+162) {
		tmp = (b * b) * (b * b);
	} else if ((t_0 <= 1e+264) || !(t_0 <= ((double) INFINITY))) {
		tmp = (a * a) * (a * a);
	} else {
		tmp = ((b * b) * b) * b;
	}
	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) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	double tmp;
	if (t_0 <= -0.5) {
		tmp = -1.0;
	} else if (t_0 <= 2e+162) {
		tmp = (b * b) * (b * b);
	} else if ((t_0 <= 1e+264) || !(t_0 <= Double.POSITIVE_INFINITY)) {
		tmp = (a * a) * (a * a);
	} else {
		tmp = ((b * b) * b) * b;
	}
	return tmp;
}

Python

def code(a, b):
	t_0 = (math.pow(((a * a) + (b * b)), 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0
	tmp = 0
	if t_0 <= -0.5:
		tmp = -1.0
	elif t_0 <= 2e+162:
		tmp = (b * b) * (b * b)
	elif (t_0 <= 1e+264) or not (t_0 <= math.inf):
		tmp = (a * a) * (a * a)
	else:
		tmp = ((b * b) * b) * b
	return tmp

Julia

function code(a, b)
	t_0 = 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)
	tmp = 0.0
	if (t_0 <= -0.5)
		tmp = -1.0;
	elseif (t_0 <= 2e+162)
		tmp = Float64(Float64(b * b) * Float64(b * b));
	elseif ((t_0 <= 1e+264) || !(t_0 <= Inf))
		tmp = Float64(Float64(a * a) * Float64(a * a));
	else
		tmp = Float64(Float64(Float64(b * b) * b) * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	t_0 = ((((a * a) + (b * b)) ^ 2.0) + (4.0 * (((a * a) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0;
	tmp = 0.0;
	if (t_0 <= -0.5)
		tmp = -1.0;
	elseif (t_0 <= 2e+162)
		tmp = (b * b) * (b * b);
	elseif ((t_0 <= 1e+264) || ~((t_0 <= Inf)))
		tmp = (a * a) * (a * a);
	else
		tmp = ((b * b) * b) * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := Block[{t$95$0 = 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]}, If[LessEqual[t$95$0, -0.5], -1.0, If[LessEqual[t$95$0, 2e+162], N[(N[(b * b), $MachinePrecision] * N[(b * b), $MachinePrecision]), $MachinePrecision], If[Or[LessEqual[t$95$0, 1e+264], N[Not[LessEqual[t$95$0, Infinity]], $MachinePrecision]], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * b), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (-.f64 (+.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)))))) #s(literal 1 binary64)) < -0.5

   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 inf

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.5%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 97.1%

       \[\leadsto -1 \]

   if -0.5 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < 1.9999999999999999e162

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

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

   5. Applied rewrites 61.1%

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

   7. Applied rewrites 60.9%

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

   if 1.9999999999999999e162 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < 1.00000000000000004e264 or +inf.0 < (-.f64 (+.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)))))) #s(literal 1 binary64))

   1. Initial program 24.2%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 93.1%

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

   7. Applied rewrites 92.9%

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

   if 1.00000000000000004e264 < (-.f64 (+.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)))))) #s(literal 1 binary64)) < +inf.0

   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 b around inf

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

   5. Applied rewrites 75.2%

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

   7. Applied rewrites 75.2%

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

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\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 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{elif}\;\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 \leq 2 \cdot 10^{+162}:\\ \;\;\;\;\left(b \cdot b\right) \cdot \left(b \cdot b\right)\\ \mathbf{elif}\;\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 \leq 10^{+264} \lor \neg \left(\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 \leq \infty\right):\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\left(b \cdot b\right) \cdot b\right) \cdot b\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 70.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\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 \leq -0.5:\\ \;\;\;\;-1\\ \mathbf{else}:\\ \;\;\;\;\left(a \cdot a\right) \cdot \left(a \cdot a\right)\\ \end{array} \end{array} \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b)
use fmin_fmax_functions
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((((((a * a) + (b * b)) ** 2.0d0) + (4.0d0 * (((a * a) * (1.0d0 + a)) + ((b * b) * (1.0d0 - (3.0d0 * a)))))) - 1.0d0) <= (-0.5d0)) then
        tmp = -1.0d0
    else
        tmp = (a * a) * (a * a)
    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) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0) <= -0.5) {
		tmp = -1.0;
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Python

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

Julia

function code(a, b)
	tmp = 0.0
	if (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) <= -0.5)
		tmp = -1.0;
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	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) * (1.0 + a)) + ((b * b) * (1.0 - (3.0 * a)))))) - 1.0) <= -0.5)
		tmp = -1.0;
	else
		tmp = (a * a) * (a * a);
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[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], -0.5], -1.0, N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (-.f64 (+.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)))))) #s(literal 1 binary64)) < -0.5

   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 inf

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

   5. Applied rewrites 2.8%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 98.5%

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

   9. Taylor expanded in b around 0

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

   11. Applied rewrites 97.1%

       \[\leadsto -1 \]

   if -0.5 < (-.f64 (+.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)))))) #s(literal 1 binary64))

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

   5. Applied rewrites 57.1%

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

   7. Applied rewrites 57.0%

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

Alternative 5: 97.0% accurate, 3.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.55 \cdot 10^{+25} \lor \neg \left(a \leq 1.5 \cdot 10^{+32}\right):\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, a \cdot a\right), a \cdot a, \mathsf{fma}\left(b \cdot b, 4, -1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(b, b, \mathsf{fma}\left(-12, a, 4\right)\right) \cdot b, b, -1\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -1.55e+25) (not (<= a 1.5e+32)))
   (fma (fma b b (* a a)) (* a a) (fma (* b b) 4.0 -1.0))
   (fma (* (fma b b (fma -12.0 a 4.0)) b) b -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -1.55e+25) || !(a <= 1.5e+32)) {
		tmp = fma(fma(b, b, (a * a)), (a * a), fma((b * b), 4.0, -1.0));
	} else {
		tmp = fma((fma(b, b, fma(-12.0, a, 4.0)) * b), b, -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -1.55e+25) || !(a <= 1.5e+32))
		tmp = fma(fma(b, b, Float64(a * a)), Float64(a * a), fma(Float64(b * b), 4.0, -1.0));
	else
		tmp = fma(Float64(fma(b, b, fma(-12.0, a, 4.0)) * b), b, -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -1.55e+25], N[Not[LessEqual[a, 1.5e+32]], $MachinePrecision]], N[(N[(b * b + N[(a * a), $MachinePrecision]), $MachinePrecision] * N[(a * a), $MachinePrecision] + N[(N[(b * b), $MachinePrecision] * 4.0 + -1.0), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * b + N[(-12.0 * a + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -1.5499999999999999e25 or 1.5e32 < a

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

      1. lift--.f64 N/A

         \[\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) - 1} \]

      2. lift-+.f64 N/A

         \[\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)} - 1 \]

      3. associate--l+ N/A

         \[\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)} \]

      4. lift-pow.f64 N/A

         \[\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) \]

      5. unpow2 N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 47.6%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 99.8%

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

   8. Taylor expanded in a around inf

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

   10. Applied rewrites 97.5%

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

   if -1.5499999999999999e25 < a < 1.5e32

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 3.0%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 97.2%

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

4. Final simplification 97.3%

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

Alternative 6: 94.5% accurate, 4.4× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -2.55e+36)
   (* (* (* a a) a) a)
   (if (<= a 4e+32)
     (fma (* (fma b b (fma -12.0 a 4.0)) b) b -1.0)
     (* (* a a) (* a a)))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -2.55e+36) {
		tmp = ((a * a) * a) * a;
	} else if (a <= 4e+32) {
		tmp = fma((fma(b, b, fma(-12.0, a, 4.0)) * b), b, -1.0);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -2.55e+36)
		tmp = Float64(Float64(Float64(a * a) * a) * a);
	elseif (a <= 4e+32)
		tmp = fma(Float64(fma(b, b, fma(-12.0, a, 4.0)) * b), b, -1.0);
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -2.55e+36], N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[a, 4e+32], N[(N[(N[(b * b + N[(-12.0 * a + 4.0), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -2.54999999999999986e36

   1. Initial program 31.3%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 98.3%

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

   7. Applied rewrites 98.2%

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

   if -2.54999999999999986e36 < a < 4.00000000000000021e32

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 3.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 96.6%

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

   if 4.00000000000000021e32 < a

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

   5. Applied rewrites 89.8%

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

   7. Applied rewrites 89.6%

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

4. Final simplification 95.4%

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

Alternative 7: 94.4% accurate, 5.3× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -2.55e+36) (not (<= a 4e+32)))
   (* (* a a) (* a a))
   (fma (fma b b 4.0) (* b b) -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -2.55e+36) || !(a <= 4e+32)) {
		tmp = (a * a) * (a * a);
	} else {
		tmp = fma(fma(b, b, 4.0), (b * b), -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -2.55e+36) || !(a <= 4e+32))
		tmp = Float64(Float64(a * a) * Float64(a * a));
	else
		tmp = fma(fma(b, b, 4.0), Float64(b * b), -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -2.55e+36], N[Not[LessEqual[a, 4e+32]], $MachinePrecision]], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], N[(N[(b * b + 4.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.54999999999999986e36 or 4.00000000000000021e32 < a

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 93.9%

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

   if -2.54999999999999986e36 < a < 4.00000000000000021e32

   1. Initial program 99.9%

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

      1. lift--.f64 N/A

         \[\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) - 1} \]

      2. lift-+.f64 N/A

         \[\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)} - 1 \]

      3. associate--l+ N/A

         \[\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)} \]

      4. lift-pow.f64 N/A

         \[\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) \]

      5. unpow2 N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 97.5%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 96.5%

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

4. Final simplification 95.4%

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

Alternative 8: 94.4% accurate, 5.3× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -2.55e+36)
   (* (* (* a a) a) a)
   (if (<= a 4e+32) (fma (fma b b 4.0) (* b b) -1.0) (* (* a a) (* a a)))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -2.55e+36) {
		tmp = ((a * a) * a) * a;
	} else if (a <= 4e+32) {
		tmp = fma(fma(b, b, 4.0), (b * b), -1.0);
	} else {
		tmp = (a * a) * (a * a);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -2.55e+36)
		tmp = Float64(Float64(Float64(a * a) * a) * a);
	elseif (a <= 4e+32)
		tmp = fma(fma(b, b, 4.0), Float64(b * b), -1.0);
	else
		tmp = Float64(Float64(a * a) * Float64(a * a));
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -2.55e+36], N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[a, 4e+32], N[(N[(b * b + 4.0), $MachinePrecision] * N[(b * b), $MachinePrecision] + -1.0), $MachinePrecision], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -2.54999999999999986e36

   1. Initial program 31.3%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 98.3%

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

   7. Applied rewrites 98.2%

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

   if -2.54999999999999986e36 < a < 4.00000000000000021e32

   1. Initial program 99.9%

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

      1. lift--.f64 N/A

         \[\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) - 1} \]

      2. lift-+.f64 N/A

         \[\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)} - 1 \]

      3. associate--l+ N/A

         \[\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)} \]

      4. lift-pow.f64 N/A

         \[\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) \]

      5. unpow2 N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-+.f64 N/A

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

      8. +-commutative N/A

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

      9. lift-*.f64 N/A

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

      10. lower-fma.f64 N/A

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

      11. lift-+.f64 N/A

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

      12. +-commutative N/A

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

      13. lift-*.f64 N/A

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

      14. lower-fma.f64 N/A

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 97.5%

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

   8. Taylor expanded in a around 0

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

   10. Applied rewrites 96.5%

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

   if 4.00000000000000021e32 < a

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

   5. Applied rewrites 89.8%

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

   7. Applied rewrites 89.6%

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

4. Final simplification 95.4%

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

Alternative 9: 93.9% accurate, 5.5× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (or (<= a -2.55e+36) (not (<= a 4e+32)))
   (* (* a a) (* a a))
   (fma (* (* b b) b) b -1.0)))

C

double code(double a, double b) {
	double tmp;
	if ((a <= -2.55e+36) || !(a <= 4e+32)) {
		tmp = (a * a) * (a * a);
	} else {
		tmp = fma(((b * b) * b), b, -1.0);
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if ((a <= -2.55e+36) || !(a <= 4e+32))
		tmp = Float64(Float64(a * a) * Float64(a * a));
	else
		tmp = fma(Float64(Float64(b * b) * b), b, -1.0);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[Or[LessEqual[a, -2.55e+36], N[Not[LessEqual[a, 4e+32]], $MachinePrecision]], N[(N[(a * a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision], N[(N[(N[(b * b), $MachinePrecision] * b), $MachinePrecision] * b + -1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -2.54999999999999986e36 or 4.00000000000000021e32 < a

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

   5. Applied rewrites 94.0%

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

   7. Applied rewrites 93.9%

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

   if -2.54999999999999986e36 < a < 4.00000000000000021e32

   1. Initial program 99.9%

      \[\left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \]
   2. Add Preprocessing

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 3.7%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 96.6%

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

   9. Taylor expanded in b around inf

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

   11. Applied rewrites 95.9%

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

4. Final simplification 95.0%

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

Alternative 10: 25.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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(a, b)
use fmin_fmax_functions
    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 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. Add Preprocessing

3. Taylor expanded in a around inf

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

5. Applied rewrites 41.8%

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

6. Taylor expanded in a around 0

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

8. Applied rewrites 72.7%

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

9. Taylor expanded in b around 0

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

11. Applied rewrites 27.8%

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

Reproduce

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