Bouland and Aaronson, Equation (25)

Percentage Accurate: 74.0% → 98.9%

Time: 5.2s

Alternatives: 11

Speedup: 2.6×

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

Specification

Math

\[\begin{array}{l} \\ \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

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

Fortran

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: 74.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left({\left(a \cdot a + b \cdot b\right)}^{2} + 4 \cdot \left(\left(a \cdot a\right) \cdot \left(1 + a\right) + \left(b \cdot b\right) \cdot \left(1 - 3 \cdot a\right)\right)\right) - 1 \end{array} \]

FPCore

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

C

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

Fortran

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: 98.9% accurate, 1.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

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

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

4. Applied rewrites 98.9%

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

6. Applied rewrites 98.9%

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

Alternative 2: 93.4% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -6e-7)
   (- (* (fma (+ 4.0 a) a 4.0) (* a a)) 1.0)
   (if (<= a 2.6e+71)
     (- (fma 4.0 (* b b) (pow b 4.0)) 1.0)
     (* (* (* a a) a) a))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -6e-7) {
		tmp = (fma((4.0 + a), a, 4.0) * (a * a)) - 1.0;
	} else if (a <= 2.6e+71) {
		tmp = fma(4.0, (b * b), pow(b, 4.0)) - 1.0;
	} else {
		tmp = ((a * a) * a) * a;
	}
	return tmp;
}

Julia

function code(a, b)
	tmp = 0.0
	if (a <= -6e-7)
		tmp = Float64(Float64(fma(Float64(4.0 + a), a, 4.0) * Float64(a * a)) - 1.0);
	elseif (a <= 2.6e+71)
		tmp = Float64(fma(4.0, Float64(b * b), (b ^ 4.0)) - 1.0);
	else
		tmp = Float64(Float64(Float64(a * a) * a) * a);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -5.9999999999999997e-7

   1. Initial program 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 69.2%

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

   if -5.9999999999999997e-7 < a < 2.59999999999999991e71

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

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

   4. Applied rewrites 70.6%

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

   if 2.59999999999999991e71 < a

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

      \[\leadsto \left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a \]

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 44.6%

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

Alternative 3: 93.3% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -6e-7)
   (- (* (fma (+ 4.0 a) a 4.0) (* a a)) 1.0)
   (if (<= a 2.6e+71) (- (* (* (fma b b 4.0) b) b) 1.0) (* (* (* a a) a) a))))

C

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -5.9999999999999997e-7

   1. Initial program 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 69.2%

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

   if -5.9999999999999997e-7 < a < 2.59999999999999991e71

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

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

   4. Applied rewrites 98.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in b around 0

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

   10. Applied rewrites 70.5%

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

   12. Applied rewrites 70.5%

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

   if 2.59999999999999991e71 < a

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

      \[\leadsto \left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a \]

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 44.6%

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

Alternative 4: 93.3% accurate, 2.6× speedup

Math

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

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a -3.8e+37)
   (pow a 4.0)
   (if (<= a 2.6e+71) (- (* (* (fma b b 4.0) b) b) 1.0) (* (* (* a a) a) a))))

C

double code(double a, double b) {
	double tmp;
	if (a <= -3.8e+37) {
		tmp = pow(a, 4.0);
	} else if (a <= 2.6e+71) {
		tmp = ((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 <= -3.8e+37)
		tmp = a ^ 4.0;
	elseif (a <= 2.6e+71)
		tmp = Float64(Float64(Float64(fma(b, b, 4.0) * b) * b) - 1.0);
	else
		tmp = Float64(Float64(Float64(a * a) * a) * a);
	end
	return tmp
end

Wolfram

code[a_, b_] := If[LessEqual[a, -3.8e+37], N[Power[a, 4.0], $MachinePrecision], If[LessEqual[a, 2.6e+71], N[(N[(N[(N[(b * b + 4.0), $MachinePrecision] * b), $MachinePrecision] * b), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if a < -3.7999999999999999e37

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 44.6%

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

   if -3.7999999999999999e37 < a < 2.59999999999999991e71

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

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

   4. Applied rewrites 98.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in b around 0

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

   10. Applied rewrites 70.5%

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

   12. Applied rewrites 70.5%

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

   if 2.59999999999999991e71 < a

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

      \[\leadsto \left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a \]

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 44.6%

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

Alternative 5: 93.3% accurate, 2.6× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3.7999999999999999e37 or 2.59999999999999991e71 < a

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

      \[\leadsto \left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a \]

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 44.6%

       \[\leadsto \left(\left(a \cdot a\right) \cdot a\right) \cdot a \]

   if -3.7999999999999999e37 < a < 2.59999999999999991e71

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

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

   4. Applied rewrites 98.9%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 70.6%

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

   8. Taylor expanded in b around 0

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

   10. Applied rewrites 70.5%

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

   12. Applied rewrites 70.5%

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

Alternative 6: 69.1% accurate, 0.8× 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:\\ \;\;\;\;\mathsf{fma}\left(4, a, 4\right) \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a\\ \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)
   (- (* (fma 4.0 a 4.0) (* a a)) 1.0)
   (* (* (+ 4.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 = (fma(4.0, a, 4.0) * (a * a)) - 1.0;
	} else {
		tmp = ((4.0 + 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 = Float64(Float64(fma(4.0, a, 4.0) * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(4.0 + a) * Float64(a * a)) * a);
	end
	return 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], N[(N[(N[(4.0 * a + 4.0), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(4.0 + a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] * a), $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 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 42.4%

      \[\leadsto \mathsf{fma}\left(4, a, 4\right) \cdot \left(a \cdot a\right) - \color{blue}{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 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

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

Alternative 7: 69.0% accurate, 0.8× 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:\\ \;\;\;\;4 \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a\\ \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)
   (- (* 4.0 (* a a)) 1.0)
   (* (* (+ 4.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 = (4.0 * (a * a)) - 1.0;
	} else {
		tmp = ((4.0 + 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 = (4.0d0 * (a * a)) - 1.0d0
    else
        tmp = ((4.0d0 + 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 = (4.0 * (a * a)) - 1.0;
	} else {
		tmp = ((4.0 + 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 = (4.0 * (a * a)) - 1.0
	else:
		tmp = ((4.0 + 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 = Float64(Float64(4.0 * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(4.0 + a) * Float64(a * 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 = (4.0 * (a * a)) - 1.0;
	else
		tmp = ((4.0 + 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], N[(N[(4.0 * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(4.0 + a), $MachinePrecision] * N[(a * a), $MachinePrecision]), $MachinePrecision] * a), $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 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 51.1%

      \[\leadsto 4 \cdot \left(a \cdot a\right) - \color{blue}{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 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

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

Alternative 8: 68.7% accurate, 0.8× 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:\\ \;\;\;\;4 \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(a \cdot a\right) \cdot a\right) \cdot a\\ \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)
   (- (* 4.0 (* a a)) 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 = (4.0 * (a * a)) - 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 = (4.0d0 * (a * a)) - 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 = (4.0 * (a * a)) - 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 = (4.0 * (a * a)) - 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 = Float64(Float64(4.0 * Float64(a * a)) - 1.0);
	else
		tmp = Float64(Float64(Float64(a * a) * 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 = (4.0 * (a * a)) - 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], N[(N[(4.0 * N[(a * a), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision], N[(N[(N[(a * a), $MachinePrecision] * a), $MachinePrecision] * a), $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 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 51.1%

      \[\leadsto 4 \cdot \left(a \cdot a\right) - \color{blue}{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 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 44.9%

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

   9. Applied rewrites 44.9%

      \[\leadsto \left(\left(4 + a\right) \cdot \left(a \cdot a\right)\right) \cdot a \]

   10. Taylor expanded in a around inf

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

   12. Applied rewrites 44.6%

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

Alternative 9: 55.2% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq 0.41:\\ \;\;\;\;4 \cdot \left(a \cdot a\right) - 1\\ \mathbf{else}:\\ \;\;\;\;4 \cdot \left(\left(a \cdot a\right) \cdot a\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= a 0.41) (- (* 4.0 (* a a)) 1.0) (* 4.0 (* (* a a) a))))

C

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

Java

public static double code(double a, double b) {
	double tmp;
	if (a <= 0.41) {
		tmp = (4.0 * (a * a)) - 1.0;
	} else {
		tmp = 4.0 * ((a * a) * a);
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if a <= 0.41:
		tmp = (4.0 * (a * a)) - 1.0
	else:
		tmp = 4.0 * ((a * a) * a)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if (a <= 0.41)
		tmp = (4.0 * (a * a)) - 1.0;
	else
		tmp = 4.0 * ((a * a) * a);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < 0.409999999999999976

   1. Initial program 74.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. Taylor expanded in b around 0

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

   4. Applied rewrites 34.1%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 51.1%

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

   if 0.409999999999999976 < a

   1. Initial program 74.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. Taylor expanded in a around inf

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

   4. Applied rewrites 45.0%

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

   5. Taylor expanded in a around 0

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

   7. Applied rewrites 18.5%

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

Alternative 10: 51.1% accurate, 5.9× speedup

Math

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

FPCore

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

C

double code(double a, double b) {
	return (4.0 * (a * 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 = (4.0d0 * (a * a)) - 1.0d0
end function

Java

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

Python

def code(a, b):
	return (4.0 * (a * a)) - 1.0

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 74.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. Taylor expanded in b around 0

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

4. Applied rewrites 34.1%

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

5. Taylor expanded in a around 0

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

7. Applied rewrites 51.1%

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

Alternative 11: 25.3% accurate, 56.6× 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 74.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. Taylor expanded in b around 0

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

4. Applied rewrites 34.1%

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

5. Taylor expanded in a around 0

   \[\leadsto -1 \]

7. Applied rewrites 25.3%

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

Reproduce

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