Quotient of products

Percentage Accurate: 86.5% → 97.3%

Time: 2.1s

Alternatives: 5

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ \frac{a1 \cdot a2}{b1 \cdot b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (/ (* a1 a2) (* b1 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

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(a1, a2, b1, b2)
use fmin_fmax_functions
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 * a2) / (b1 * b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 * a2) / (b1 * b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 * a2) / Float64(b1 * b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 * a2) / (b1 * b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]

Initial Program: 86.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{a1 \cdot a2}{b1 \cdot b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (/ (* a1 a2) (* b1 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

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(a1, a2, b1, b2)
use fmin_fmax_functions
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 * a2) / (b1 * b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 * a2) / (b1 * b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 * a2) / (b1 * b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 * a2) / Float64(b1 * b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 * a2) / (b1 * b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 * a2), $MachinePrecision] / N[(b1 * b2), $MachinePrecision]), $MachinePrecision]

Alternative 1: 97.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} a1\_m = \left|a1\right| \\ a1\_s = \mathsf{copysign}\left(1, a1\right) \\ a2\_m = \left|a2\right| \\ a2\_s = \mathsf{copysign}\left(1, a2\right) \\ b1\_m = \left|b1\right| \\ b1\_s = \mathsf{copysign}\left(1, b1\right) \\ b2\_m = \left|b2\right| \\ b2\_s = \mathsf{copysign}\left(1, b2\right) \\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\\\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\ \\ b2\_s \cdot \left(b1\_s \cdot \left(a2\_s \cdot \left(a1\_s \cdot \begin{array}{l} \mathbf{if}\;b2\_m \leq 9.8 \cdot 10^{+126}:\\ \;\;\;\;\frac{\frac{-a1\_m}{b1\_m}}{b2\_m} \cdot \left(-a2\_m\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{a2\_m}{b2\_m}}{b1\_m} \cdot a1\_m\\ \end{array}\right)\right)\right) \end{array} \]

FPCore

a1\_m = (fabs.f64 a1)
a1\_s = (copysign.f64 #s(literal 1 binary64) a1)
a2\_m = (fabs.f64 a2)
a2\_s = (copysign.f64 #s(literal 1 binary64) a2)
b1\_m = (fabs.f64 b1)
b1\_s = (copysign.f64 #s(literal 1 binary64) b1)
b2\_m = (fabs.f64 b2)
b2\_s = (copysign.f64 #s(literal 1 binary64) b2)
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
(FPCore (b2_s b1_s a2_s a1_s a1_m a2_m b1_m b2_m)
 :precision binary64
 (*
  b2_s
  (*
   b1_s
   (*
    a2_s
    (*
     a1_s
     (if (<= b2_m 9.8e+126)
       (* (/ (/ (- a1_m) b1_m) b2_m) (- a2_m))
       (* (/ (/ a2_m b2_m) b1_m) a1_m)))))))

C

a1\_m = fabs(a1);
a1\_s = copysign(1.0, a1);
a2\_m = fabs(a2);
a2\_s = copysign(1.0, a2);
b1\_m = fabs(b1);
b1\_s = copysign(1.0, b1);
b2\_m = fabs(b2);
b2\_s = copysign(1.0, b2);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double tmp;
	if (b2_m <= 9.8e+126) {
		tmp = ((-a1_m / b1_m) / b2_m) * -a2_m;
	} else {
		tmp = ((a2_m / b2_m) / b1_m) * a1_m;
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Fortran

a1\_m =     private
a1\_s =     private
a2\_m =     private
a2\_s =     private
b1\_m =     private
b1\_s =     private
b2\_m =     private
b2\_s =     private
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
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(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
use fmin_fmax_functions
    real(8), intent (in) :: b2_s
    real(8), intent (in) :: b1_s
    real(8), intent (in) :: a2_s
    real(8), intent (in) :: a1_s
    real(8), intent (in) :: a1_m
    real(8), intent (in) :: a2_m
    real(8), intent (in) :: b1_m
    real(8), intent (in) :: b2_m
    real(8) :: tmp
    if (b2_m <= 9.8d+126) then
        tmp = ((-a1_m / b1_m) / b2_m) * -a2_m
    else
        tmp = ((a2_m / b2_m) / b1_m) * a1_m
    end if
    code = b2_s * (b1_s * (a2_s * (a1_s * tmp)))
end function

Java

a1\_m = Math.abs(a1);
a1\_s = Math.copySign(1.0, a1);
a2\_m = Math.abs(a2);
a2\_s = Math.copySign(1.0, a2);
b1\_m = Math.abs(b1);
b1\_s = Math.copySign(1.0, b1);
b2\_m = Math.abs(b2);
b2\_s = Math.copySign(1.0, b2);
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
public static double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double tmp;
	if (b2_m <= 9.8e+126) {
		tmp = ((-a1_m / b1_m) / b2_m) * -a2_m;
	} else {
		tmp = ((a2_m / b2_m) / b1_m) * a1_m;
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Python

a1\_m = math.fabs(a1)
a1\_s = math.copysign(1.0, a1)
a2\_m = math.fabs(a2)
a2\_s = math.copysign(1.0, a2)
b1\_m = math.fabs(b1)
b1\_s = math.copysign(1.0, b1)
b2\_m = math.fabs(b2)
b2\_s = math.copysign(1.0, b2)
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
def code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m):
	tmp = 0
	if b2_m <= 9.8e+126:
		tmp = ((-a1_m / b1_m) / b2_m) * -a2_m
	else:
		tmp = ((a2_m / b2_m) / b1_m) * a1_m
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)))

Julia

a1\_m = abs(a1)
a1\_s = copysign(1.0, a1)
a2\_m = abs(a2)
a2\_s = copysign(1.0, a2)
b1\_m = abs(b1)
b1\_s = copysign(1.0, b1)
b2\_m = abs(b2)
b2\_s = copysign(1.0, b2)
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
function code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = 0.0
	if (b2_m <= 9.8e+126)
		tmp = Float64(Float64(Float64(Float64(-a1_m) / b1_m) / b2_m) * Float64(-a2_m));
	else
		tmp = Float64(Float64(Float64(a2_m / b2_m) / b1_m) * a1_m);
	end
	return Float64(b2_s * Float64(b1_s * Float64(a2_s * Float64(a1_s * tmp))))
end

MATLAB

a1\_m = abs(a1);
a1\_s = sign(a1) * abs(1.0);
a2\_m = abs(a2);
a2\_s = sign(a2) * abs(1.0);
b1\_m = abs(b1);
b1\_s = sign(b1) * abs(1.0);
b2\_m = abs(b2);
b2\_s = sign(b2) * abs(1.0);
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
function tmp_2 = code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = 0.0;
	if (b2_m <= 9.8e+126)
		tmp = ((-a1_m / b1_m) / b2_m) * -a2_m;
	else
		tmp = ((a2_m / b2_m) / b1_m) * a1_m;
	end
	tmp_2 = b2_s * (b1_s * (a2_s * (a1_s * tmp)));
end

Wolfram

a1\_m = N[Abs[a1], $MachinePrecision]
a1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
a2\_m = N[Abs[a2], $MachinePrecision]
a2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b1\_m = N[Abs[b1], $MachinePrecision]
b1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b2\_m = N[Abs[b2], $MachinePrecision]
b2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
code[b2$95$s_, b1$95$s_, a2$95$s_, a1$95$s_, a1$95$m_, a2$95$m_, b1$95$m_, b2$95$m_] := N[(b2$95$s * N[(b1$95$s * N[(a2$95$s * N[(a1$95$s * If[LessEqual[b2$95$m, 9.8e+126], N[(N[(N[((-a1$95$m) / b1$95$m), $MachinePrecision] / b2$95$m), $MachinePrecision] * (-a2$95$m)), $MachinePrecision], N[(N[(N[(a2$95$m / b2$95$m), $MachinePrecision] / b1$95$m), $MachinePrecision] * a1$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if b2 < 9.80000000000000002e126

   1. Initial program 87.4%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a1 \cdot a2\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \]

      5. distribute-rgt-neg-in N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot \left(\mathsf{neg}\left(a2\right)\right)}}{\mathsf{neg}\left(b1 \cdot b2\right)} \]

      6. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(b1 \cdot b2\right)} \cdot \left(\mathsf{neg}\left(a2\right)\right)} \]

      7. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(b1 \cdot b2\right)} \cdot \left(\mathsf{neg}\left(a2\right)\right)} \]

      8. frac-2neg-rev N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a1\right)}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      9. remove-double-neg N/A

         \[\leadsto \frac{\mathsf{neg}\left(a1\right)}{\color{blue}{b1 \cdot b2}} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      10. associate-/r* N/A

          \[\leadsto \color{blue}{\frac{\frac{\mathsf{neg}\left(a1\right)}{b1}}{b2}} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      11. lower-/.f64 N/A

          \[\leadsto \color{blue}{\frac{\frac{\mathsf{neg}\left(a1\right)}{b1}}{b2}} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      12. lower-/.f64 N/A

          \[\leadsto \frac{\color{blue}{\frac{\mathsf{neg}\left(a1\right)}{b1}}}{b2} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      13. lower-neg.f64 N/A

          \[\leadsto \frac{\frac{\color{blue}{-a1}}{b1}}{b2} \cdot \left(\mathsf{neg}\left(a2\right)\right) \]

      14. lower-neg.f64 97.5

          \[\leadsto \frac{\frac{-a1}{b1}}{b2} \cdot \color{blue}{\left(-a2\right)} \]

   3. Applied rewrites 97.5%

      \[\leadsto \color{blue}{\frac{\frac{-a1}{b1}}{b2} \cdot \left(-a2\right)} \]

   if 9.80000000000000002e126 < b2

   1. Initial program 85.6%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{a1 \cdot \frac{a2}{b1 \cdot b2}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      7. *-commutative N/A

         \[\leadsto \frac{a2}{\color{blue}{b2 \cdot b1}} \cdot a1 \]

      8. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      10. lower-/.f64 97.0

          \[\leadsto \frac{\color{blue}{\frac{a2}{b2}}}{b1} \cdot a1 \]

   3. Applied rewrites 97.0%

      \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1} \cdot a1} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 94.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} a1\_m = \left|a1\right| \\ a1\_s = \mathsf{copysign}\left(1, a1\right) \\ a2\_m = \left|a2\right| \\ a2\_s = \mathsf{copysign}\left(1, a2\right) \\ b1\_m = \left|b1\right| \\ b1\_s = \mathsf{copysign}\left(1, b1\right) \\ b2\_m = \left|b2\right| \\ b2\_s = \mathsf{copysign}\left(1, b2\right) \\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\\\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\ \\ \begin{array}{l} t_0 := \frac{a1\_m \cdot a2\_m}{b1\_m \cdot b2\_m}\\ b2\_s \cdot \left(b1\_s \cdot \left(a2\_s \cdot \left(a1\_s \cdot \begin{array}{l} \mathbf{if}\;t\_0 \leq 5 \cdot 10^{-29}:\\ \;\;\;\;\frac{a2\_m}{b1\_m \cdot b2\_m} \cdot a1\_m\\ \mathbf{elif}\;t\_0 \leq \infty:\\ \;\;\;\;\frac{a1\_m}{b1\_m \cdot b2\_m} \cdot a2\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{a2\_m}{b1\_m} \cdot \frac{a1\_m}{b2\_m}\\ \end{array}\right)\right)\right) \end{array} \end{array} \]

FPCore

a1\_m = (fabs.f64 a1)
a1\_s = (copysign.f64 #s(literal 1 binary64) a1)
a2\_m = (fabs.f64 a2)
a2\_s = (copysign.f64 #s(literal 1 binary64) a2)
b1\_m = (fabs.f64 b1)
b1\_s = (copysign.f64 #s(literal 1 binary64) b1)
b2\_m = (fabs.f64 b2)
b2\_s = (copysign.f64 #s(literal 1 binary64) b2)
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
(FPCore (b2_s b1_s a2_s a1_s a1_m a2_m b1_m b2_m)
 :precision binary64
 (let* ((t_0 (/ (* a1_m a2_m) (* b1_m b2_m))))
   (*
    b2_s
    (*
     b1_s
     (*
      a2_s
      (*
       a1_s
       (if (<= t_0 5e-29)
         (* (/ a2_m (* b1_m b2_m)) a1_m)
         (if (<= t_0 INFINITY)
           (* (/ a1_m (* b1_m b2_m)) a2_m)
           (* (/ a2_m b1_m) (/ a1_m b2_m))))))))))

C

a1\_m = fabs(a1);
a1\_s = copysign(1.0, a1);
a2\_m = fabs(a2);
a2\_s = copysign(1.0, a2);
b1\_m = fabs(b1);
b1\_s = copysign(1.0, b1);
b2\_m = fabs(b2);
b2\_s = copysign(1.0, b2);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double t_0 = (a1_m * a2_m) / (b1_m * b2_m);
	double tmp;
	if (t_0 <= 5e-29) {
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	} else if (t_0 <= ((double) INFINITY)) {
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	} else {
		tmp = (a2_m / b1_m) * (a1_m / b2_m);
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Java

a1\_m = Math.abs(a1);
a1\_s = Math.copySign(1.0, a1);
a2\_m = Math.abs(a2);
a2\_s = Math.copySign(1.0, a2);
b1\_m = Math.abs(b1);
b1\_s = Math.copySign(1.0, b1);
b2\_m = Math.abs(b2);
b2\_s = Math.copySign(1.0, b2);
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
public static double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double t_0 = (a1_m * a2_m) / (b1_m * b2_m);
	double tmp;
	if (t_0 <= 5e-29) {
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	} else if (t_0 <= Double.POSITIVE_INFINITY) {
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	} else {
		tmp = (a2_m / b1_m) * (a1_m / b2_m);
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Python

a1\_m = math.fabs(a1)
a1\_s = math.copysign(1.0, a1)
a2\_m = math.fabs(a2)
a2\_s = math.copysign(1.0, a2)
b1\_m = math.fabs(b1)
b1\_s = math.copysign(1.0, b1)
b2\_m = math.fabs(b2)
b2\_s = math.copysign(1.0, b2)
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
def code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m):
	t_0 = (a1_m * a2_m) / (b1_m * b2_m)
	tmp = 0
	if t_0 <= 5e-29:
		tmp = (a2_m / (b1_m * b2_m)) * a1_m
	elif t_0 <= math.inf:
		tmp = (a1_m / (b1_m * b2_m)) * a2_m
	else:
		tmp = (a2_m / b1_m) * (a1_m / b2_m)
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)))

Julia

a1\_m = abs(a1)
a1\_s = copysign(1.0, a1)
a2\_m = abs(a2)
a2\_s = copysign(1.0, a2)
b1\_m = abs(b1)
b1\_s = copysign(1.0, b1)
b2\_m = abs(b2)
b2\_s = copysign(1.0, b2)
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
function code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	t_0 = Float64(Float64(a1_m * a2_m) / Float64(b1_m * b2_m))
	tmp = 0.0
	if (t_0 <= 5e-29)
		tmp = Float64(Float64(a2_m / Float64(b1_m * b2_m)) * a1_m);
	elseif (t_0 <= Inf)
		tmp = Float64(Float64(a1_m / Float64(b1_m * b2_m)) * a2_m);
	else
		tmp = Float64(Float64(a2_m / b1_m) * Float64(a1_m / b2_m));
	end
	return Float64(b2_s * Float64(b1_s * Float64(a2_s * Float64(a1_s * tmp))))
end

MATLAB

a1\_m = abs(a1);
a1\_s = sign(a1) * abs(1.0);
a2\_m = abs(a2);
a2\_s = sign(a2) * abs(1.0);
b1\_m = abs(b1);
b1\_s = sign(b1) * abs(1.0);
b2\_m = abs(b2);
b2\_s = sign(b2) * abs(1.0);
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
function tmp_2 = code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	t_0 = (a1_m * a2_m) / (b1_m * b2_m);
	tmp = 0.0;
	if (t_0 <= 5e-29)
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	elseif (t_0 <= Inf)
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	else
		tmp = (a2_m / b1_m) * (a1_m / b2_m);
	end
	tmp_2 = b2_s * (b1_s * (a2_s * (a1_s * tmp)));
end

Wolfram

a1\_m = N[Abs[a1], $MachinePrecision]
a1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
a2\_m = N[Abs[a2], $MachinePrecision]
a2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b1\_m = N[Abs[b1], $MachinePrecision]
b1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b2\_m = N[Abs[b2], $MachinePrecision]
b2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
code[b2$95$s_, b1$95$s_, a2$95$s_, a1$95$s_, a1$95$m_, a2$95$m_, b1$95$m_, b2$95$m_] := Block[{t$95$0 = N[(N[(a1$95$m * a2$95$m), $MachinePrecision] / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision]}, N[(b2$95$s * N[(b1$95$s * N[(a2$95$s * N[(a1$95$s * If[LessEqual[t$95$0, 5e-29], N[(N[(a2$95$m / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision] * a1$95$m), $MachinePrecision], If[LessEqual[t$95$0, Infinity], N[(N[(a1$95$m / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision], N[(N[(a2$95$m / b1$95$m), $MachinePrecision] * N[(a1$95$m / b2$95$m), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < 4.99999999999999986e-29

   1. Initial program 87.8%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{a1 \cdot \frac{a2}{b1 \cdot b2}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      7. *-commutative N/A

         \[\leadsto \frac{a2}{\color{blue}{b2 \cdot b1}} \cdot a1 \]

      8. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      10. lower-/.f64 98.6

          \[\leadsto \frac{\color{blue}{\frac{a2}{b2}}}{b1} \cdot a1 \]

   3. Applied rewrites 98.6%

      \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1} \cdot a1} \]
   4. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{a2}{b2}}}{b1} \cdot a1 \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      3. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{a2}{b2 \cdot b1}} \cdot a1 \]

      4. *-commutative N/A

         \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

      5. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a2\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \cdot a1 \]

      6. distribute-frac-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a2}{\mathsf{neg}\left(b1 \cdot b2\right)}\right)\right)} \cdot a1 \]

      7. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{a2}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a1 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a1 \]

      9. remove-double-neg N/A

         \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

      10. lower-*.f64 93.4

          \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

   5. Applied rewrites 93.4%

      \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2}} \cdot a1 \]

   if 4.99999999999999986e-29 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2)) < +inf.0

   1. Initial program 89.9%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      6. *-commutative N/A

         \[\leadsto \frac{a1}{\color{blue}{b2 \cdot b1}} \cdot a2 \]

      7. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      9. lower-/.f64 92.8

         \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

   3. Applied rewrites 92.8%

      \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1} \cdot a2} \]
   4. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      3. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{a1}{b2 \cdot b1}} \cdot a2 \]

      4. *-commutative N/A

         \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

      5. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a1\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \cdot a2 \]

      6. distribute-frac-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a1}{\mathsf{neg}\left(b1 \cdot b2\right)}\right)\right)} \cdot a2 \]

      7. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

      9. remove-double-neg N/A

         \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

      10. lower-*.f64 95.1

          \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

   5. Applied rewrites 95.1%

      \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2}} \cdot a2 \]

   if +inf.0 < (/.f64 (*.f64 a1 a2) (*.f64 b1 b2))

   1. Initial program 0.0%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. *-commutative N/A

         \[\leadsto \frac{\color{blue}{a2 \cdot a1}}{b1 \cdot b2} \]

      5. times-frac N/A

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]

      7. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{b1}} \cdot \frac{a1}{b2} \]

      8. lower-/.f64 99.5

         \[\leadsto \frac{a2}{b1} \cdot \color{blue}{\frac{a1}{b2}} \]

   3. Applied rewrites 99.5%

      \[\leadsto \color{blue}{\frac{a2}{b1} \cdot \frac{a1}{b2}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 90.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} a1\_m = \left|a1\right| \\ a1\_s = \mathsf{copysign}\left(1, a1\right) \\ a2\_m = \left|a2\right| \\ a2\_s = \mathsf{copysign}\left(1, a2\right) \\ b1\_m = \left|b1\right| \\ b1\_s = \mathsf{copysign}\left(1, b1\right) \\ b2\_m = \left|b2\right| \\ b2\_s = \mathsf{copysign}\left(1, b2\right) \\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\\\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\ \\ b2\_s \cdot \left(b1\_s \cdot \left(a2\_s \cdot \left(a1\_s \cdot \begin{array}{l} \mathbf{if}\;b2\_m \leq 3 \cdot 10^{+127}:\\ \;\;\;\;\frac{a1\_m}{b1\_m \cdot b2\_m} \cdot a2\_m\\ \mathbf{else}:\\ \;\;\;\;\frac{a2\_m}{b1\_m \cdot b2\_m} \cdot a1\_m\\ \end{array}\right)\right)\right) \end{array} \]

FPCore

a1\_m = (fabs.f64 a1)
a1\_s = (copysign.f64 #s(literal 1 binary64) a1)
a2\_m = (fabs.f64 a2)
a2\_s = (copysign.f64 #s(literal 1 binary64) a2)
b1\_m = (fabs.f64 b1)
b1\_s = (copysign.f64 #s(literal 1 binary64) b1)
b2\_m = (fabs.f64 b2)
b2\_s = (copysign.f64 #s(literal 1 binary64) b2)
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
(FPCore (b2_s b1_s a2_s a1_s a1_m a2_m b1_m b2_m)
 :precision binary64
 (*
  b2_s
  (*
   b1_s
   (*
    a2_s
    (*
     a1_s
     (if (<= b2_m 3e+127)
       (* (/ a1_m (* b1_m b2_m)) a2_m)
       (* (/ a2_m (* b1_m b2_m)) a1_m)))))))

C

a1\_m = fabs(a1);
a1\_s = copysign(1.0, a1);
a2\_m = fabs(a2);
a2\_s = copysign(1.0, a2);
b1\_m = fabs(b1);
b1\_s = copysign(1.0, b1);
b2\_m = fabs(b2);
b2\_s = copysign(1.0, b2);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double tmp;
	if (b2_m <= 3e+127) {
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	} else {
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Fortran

a1\_m =     private
a1\_s =     private
a2\_m =     private
a2\_s =     private
b1\_m =     private
b1\_s =     private
b2\_m =     private
b2\_s =     private
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
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(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
use fmin_fmax_functions
    real(8), intent (in) :: b2_s
    real(8), intent (in) :: b1_s
    real(8), intent (in) :: a2_s
    real(8), intent (in) :: a1_s
    real(8), intent (in) :: a1_m
    real(8), intent (in) :: a2_m
    real(8), intent (in) :: b1_m
    real(8), intent (in) :: b2_m
    real(8) :: tmp
    if (b2_m <= 3d+127) then
        tmp = (a1_m / (b1_m * b2_m)) * a2_m
    else
        tmp = (a2_m / (b1_m * b2_m)) * a1_m
    end if
    code = b2_s * (b1_s * (a2_s * (a1_s * tmp)))
end function

Java

a1\_m = Math.abs(a1);
a1\_s = Math.copySign(1.0, a1);
a2\_m = Math.abs(a2);
a2\_s = Math.copySign(1.0, a2);
b1\_m = Math.abs(b1);
b1\_s = Math.copySign(1.0, b1);
b2\_m = Math.abs(b2);
b2\_s = Math.copySign(1.0, b2);
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
public static double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	double tmp;
	if (b2_m <= 3e+127) {
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	} else {
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	}
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)));
}

Python

a1\_m = math.fabs(a1)
a1\_s = math.copysign(1.0, a1)
a2\_m = math.fabs(a2)
a2\_s = math.copysign(1.0, a2)
b1\_m = math.fabs(b1)
b1\_s = math.copysign(1.0, b1)
b2\_m = math.fabs(b2)
b2\_s = math.copysign(1.0, b2)
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
def code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m):
	tmp = 0
	if b2_m <= 3e+127:
		tmp = (a1_m / (b1_m * b2_m)) * a2_m
	else:
		tmp = (a2_m / (b1_m * b2_m)) * a1_m
	return b2_s * (b1_s * (a2_s * (a1_s * tmp)))

Julia

a1\_m = abs(a1)
a1\_s = copysign(1.0, a1)
a2\_m = abs(a2)
a2\_s = copysign(1.0, a2)
b1\_m = abs(b1)
b1\_s = copysign(1.0, b1)
b2\_m = abs(b2)
b2\_s = copysign(1.0, b2)
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
function code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = 0.0
	if (b2_m <= 3e+127)
		tmp = Float64(Float64(a1_m / Float64(b1_m * b2_m)) * a2_m);
	else
		tmp = Float64(Float64(a2_m / Float64(b1_m * b2_m)) * a1_m);
	end
	return Float64(b2_s * Float64(b1_s * Float64(a2_s * Float64(a1_s * tmp))))
end

MATLAB

a1\_m = abs(a1);
a1\_s = sign(a1) * abs(1.0);
a2\_m = abs(a2);
a2\_s = sign(a2) * abs(1.0);
b1\_m = abs(b1);
b1\_s = sign(b1) * abs(1.0);
b2\_m = abs(b2);
b2\_s = sign(b2) * abs(1.0);
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
function tmp_2 = code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = 0.0;
	if (b2_m <= 3e+127)
		tmp = (a1_m / (b1_m * b2_m)) * a2_m;
	else
		tmp = (a2_m / (b1_m * b2_m)) * a1_m;
	end
	tmp_2 = b2_s * (b1_s * (a2_s * (a1_s * tmp)));
end

Wolfram

a1\_m = N[Abs[a1], $MachinePrecision]
a1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
a2\_m = N[Abs[a2], $MachinePrecision]
a2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b1\_m = N[Abs[b1], $MachinePrecision]
b1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b2\_m = N[Abs[b2], $MachinePrecision]
b2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
code[b2$95$s_, b1$95$s_, a2$95$s_, a1$95$s_, a1$95$m_, a2$95$m_, b1$95$m_, b2$95$m_] := N[(b2$95$s * N[(b1$95$s * N[(a2$95$s * N[(a1$95$s * If[LessEqual[b2$95$m, 3e+127], N[(N[(a1$95$m / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision], N[(N[(a2$95$m / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision] * a1$95$m), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if b2 < 3.0000000000000002e127

   1. Initial program 87.4%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

      6. *-commutative N/A

         \[\leadsto \frac{a1}{\color{blue}{b2 \cdot b1}} \cdot a2 \]

      7. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      9. lower-/.f64 93.1

         \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

   3. Applied rewrites 93.1%

      \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1} \cdot a2} \]
   4. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

      3. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{a1}{b2 \cdot b1}} \cdot a2 \]

      4. *-commutative N/A

         \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

      5. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a1\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \cdot a2 \]

      6. distribute-frac-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a1}{\mathsf{neg}\left(b1 \cdot b2\right)}\right)\right)} \cdot a2 \]

      7. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

      9. remove-double-neg N/A

         \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

      10. lower-*.f64 91.4

          \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

   5. Applied rewrites 91.4%

      \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2}} \cdot a2 \]

   if 3.0000000000000002e127 < b2

   1. Initial program 85.6%

      \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

      3. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

      4. associate-/l* N/A

         \[\leadsto \color{blue}{a1 \cdot \frac{a2}{b1 \cdot b2}} \]

      5. *-commutative N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      6. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2} \cdot a1} \]

      7. *-commutative N/A

         \[\leadsto \frac{a2}{\color{blue}{b2 \cdot b1}} \cdot a1 \]

      8. associate-/r* N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      9. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      10. lower-/.f64 97.0

          \[\leadsto \frac{\color{blue}{\frac{a2}{b2}}}{b1} \cdot a1 \]

   3. Applied rewrites 97.0%

      \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1} \cdot a1} \]
   4. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \frac{\color{blue}{\frac{a2}{b2}}}{b1} \cdot a1 \]

      2. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\frac{a2}{b2}}{b1}} \cdot a1 \]

      3. associate-/l/ N/A

         \[\leadsto \color{blue}{\frac{a2}{b2 \cdot b1}} \cdot a1 \]

      4. *-commutative N/A

         \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

      5. frac-2neg N/A

         \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a2\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \cdot a1 \]

      6. distribute-frac-neg N/A

         \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a2}{\mathsf{neg}\left(b1 \cdot b2\right)}\right)\right)} \cdot a1 \]

      7. distribute-neg-frac2 N/A

         \[\leadsto \color{blue}{\frac{a2}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a1 \]

      8. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{a2}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a1 \]

      9. remove-double-neg N/A

         \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

      10. lower-*.f64 89.0

          \[\leadsto \frac{a2}{\color{blue}{b1 \cdot b2}} \cdot a1 \]

   5. Applied rewrites 89.0%

      \[\leadsto \color{blue}{\frac{a2}{b1 \cdot b2}} \cdot a1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 98.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} a1\_m = \left|a1\right| \\ a1\_s = \mathsf{copysign}\left(1, a1\right) \\ a2\_m = \left|a2\right| \\ a2\_s = \mathsf{copysign}\left(1, a2\right) \\ b1\_m = \left|b1\right| \\ b1\_s = \mathsf{copysign}\left(1, b1\right) \\ b2\_m = \left|b2\right| \\ b2\_s = \mathsf{copysign}\left(1, b2\right) \\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\\\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\ \\ b2\_s \cdot \left(b1\_s \cdot \left(a2\_s \cdot \left(a1\_s \cdot \left(\frac{a2\_m}{b2\_m} \cdot \frac{a1\_m}{b1\_m}\right)\right)\right)\right) \end{array} \]

FPCore

a1\_m = (fabs.f64 a1)
a1\_s = (copysign.f64 #s(literal 1 binary64) a1)
a2\_m = (fabs.f64 a2)
a2\_s = (copysign.f64 #s(literal 1 binary64) a2)
b1\_m = (fabs.f64 b1)
b1\_s = (copysign.f64 #s(literal 1 binary64) b1)
b2\_m = (fabs.f64 b2)
b2\_s = (copysign.f64 #s(literal 1 binary64) b2)
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
(FPCore (b2_s b1_s a2_s a1_s a1_m a2_m b1_m b2_m)
 :precision binary64
 (* b2_s (* b1_s (* a2_s (* a1_s (* (/ a2_m b2_m) (/ a1_m b1_m)))))))

C

a1\_m = fabs(a1);
a1\_s = copysign(1.0, a1);
a2\_m = fabs(a2);
a2\_s = copysign(1.0, a2);
b1\_m = fabs(b1);
b1\_s = copysign(1.0, b1);
b2\_m = fabs(b2);
b2\_s = copysign(1.0, b2);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	return b2_s * (b1_s * (a2_s * (a1_s * ((a2_m / b2_m) * (a1_m / b1_m)))));
}

Fortran

a1\_m =     private
a1\_s =     private
a2\_m =     private
a2\_s =     private
b1\_m =     private
b1\_s =     private
b2\_m =     private
b2\_s =     private
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
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(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
use fmin_fmax_functions
    real(8), intent (in) :: b2_s
    real(8), intent (in) :: b1_s
    real(8), intent (in) :: a2_s
    real(8), intent (in) :: a1_s
    real(8), intent (in) :: a1_m
    real(8), intent (in) :: a2_m
    real(8), intent (in) :: b1_m
    real(8), intent (in) :: b2_m
    code = b2_s * (b1_s * (a2_s * (a1_s * ((a2_m / b2_m) * (a1_m / b1_m)))))
end function

Java

a1\_m = Math.abs(a1);
a1\_s = Math.copySign(1.0, a1);
a2\_m = Math.abs(a2);
a2\_s = Math.copySign(1.0, a2);
b1\_m = Math.abs(b1);
b1\_s = Math.copySign(1.0, b1);
b2\_m = Math.abs(b2);
b2\_s = Math.copySign(1.0, b2);
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
public static double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	return b2_s * (b1_s * (a2_s * (a1_s * ((a2_m / b2_m) * (a1_m / b1_m)))));
}

Python

a1\_m = math.fabs(a1)
a1\_s = math.copysign(1.0, a1)
a2\_m = math.fabs(a2)
a2\_s = math.copysign(1.0, a2)
b1\_m = math.fabs(b1)
b1\_s = math.copysign(1.0, b1)
b2\_m = math.fabs(b2)
b2\_s = math.copysign(1.0, b2)
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
def code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m):
	return b2_s * (b1_s * (a2_s * (a1_s * ((a2_m / b2_m) * (a1_m / b1_m)))))

Julia

a1\_m = abs(a1)
a1\_s = copysign(1.0, a1)
a2\_m = abs(a2)
a2\_s = copysign(1.0, a2)
b1\_m = abs(b1)
b1\_s = copysign(1.0, b1)
b2\_m = abs(b2)
b2\_s = copysign(1.0, b2)
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
function code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	return Float64(b2_s * Float64(b1_s * Float64(a2_s * Float64(a1_s * Float64(Float64(a2_m / b2_m) * Float64(a1_m / b1_m))))))
end

MATLAB

a1\_m = abs(a1);
a1\_s = sign(a1) * abs(1.0);
a2\_m = abs(a2);
a2\_s = sign(a2) * abs(1.0);
b1\_m = abs(b1);
b1\_s = sign(b1) * abs(1.0);
b2\_m = abs(b2);
b2\_s = sign(b2) * abs(1.0);
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
function tmp = code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = b2_s * (b1_s * (a2_s * (a1_s * ((a2_m / b2_m) * (a1_m / b1_m)))));
end

Wolfram

a1\_m = N[Abs[a1], $MachinePrecision]
a1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
a2\_m = N[Abs[a2], $MachinePrecision]
a2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b1\_m = N[Abs[b1], $MachinePrecision]
b1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b2\_m = N[Abs[b2], $MachinePrecision]
b2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
code[b2$95$s_, b1$95$s_, a2$95$s_, a1$95$s_, a1$95$m_, a2$95$m_, b1$95$m_, b2$95$m_] := N[(b2$95$s * N[(b1$95$s * N[(a2$95$s * N[(a1$95$s * N[(N[(a2$95$m / b2$95$m), $MachinePrecision] * N[(a1$95$m / b1$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.5%

   \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

   3. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

   4. times-frac N/A

      \[\leadsto \color{blue}{\frac{a1}{b1} \cdot \frac{a2}{b2}} \]

   5. *-commutative N/A

      \[\leadsto \color{blue}{\frac{a2}{b2} \cdot \frac{a1}{b1}} \]

   6. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{a2}{b2} \cdot \frac{a1}{b1}} \]

   7. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{a2}{b2}} \cdot \frac{a1}{b1} \]

   8. lower-/.f64 98.0

      \[\leadsto \frac{a2}{b2} \cdot \color{blue}{\frac{a1}{b1}} \]

3. Applied rewrites 98.0%

   \[\leadsto \color{blue}{\frac{a2}{b2} \cdot \frac{a1}{b1}} \]
4. Add Preprocessing

Alternative 5: 86.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} a1\_m = \left|a1\right| \\ a1\_s = \mathsf{copysign}\left(1, a1\right) \\ a2\_m = \left|a2\right| \\ a2\_s = \mathsf{copysign}\left(1, a2\right) \\ b1\_m = \left|b1\right| \\ b1\_s = \mathsf{copysign}\left(1, b1\right) \\ b2\_m = \left|b2\right| \\ b2\_s = \mathsf{copysign}\left(1, b2\right) \\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\\\ [a1_m, a2_m, b1_m, b2_m] = \mathsf{sort}([a1_m, a2_m, b1_m, b2_m])\\ \\ b2\_s \cdot \left(b1\_s \cdot \left(a2\_s \cdot \left(a1\_s \cdot \left(\frac{a1\_m}{b1\_m \cdot b2\_m} \cdot a2\_m\right)\right)\right)\right) \end{array} \]

FPCore

a1\_m = (fabs.f64 a1)
a1\_s = (copysign.f64 #s(literal 1 binary64) a1)
a2\_m = (fabs.f64 a2)
a2\_s = (copysign.f64 #s(literal 1 binary64) a2)
b1\_m = (fabs.f64 b1)
b1\_s = (copysign.f64 #s(literal 1 binary64) b1)
b2\_m = (fabs.f64 b2)
b2\_s = (copysign.f64 #s(literal 1 binary64) b2)
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
(FPCore (b2_s b1_s a2_s a1_s a1_m a2_m b1_m b2_m)
 :precision binary64
 (* b2_s (* b1_s (* a2_s (* a1_s (* (/ a1_m (* b1_m b2_m)) a2_m))))))

C

a1\_m = fabs(a1);
a1\_s = copysign(1.0, a1);
a2\_m = fabs(a2);
a2\_s = copysign(1.0, a2);
b1\_m = fabs(b1);
b1\_s = copysign(1.0, b1);
b2\_m = fabs(b2);
b2\_s = copysign(1.0, b2);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
assert(a1_m < a2_m && a2_m < b1_m && b1_m < b2_m);
double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	return b2_s * (b1_s * (a2_s * (a1_s * ((a1_m / (b1_m * b2_m)) * a2_m))));
}

Fortran

a1\_m =     private
a1\_s =     private
a2\_m =     private
a2\_s =     private
b1\_m =     private
b1\_s =     private
b2\_m =     private
b2\_s =     private
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
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(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
use fmin_fmax_functions
    real(8), intent (in) :: b2_s
    real(8), intent (in) :: b1_s
    real(8), intent (in) :: a2_s
    real(8), intent (in) :: a1_s
    real(8), intent (in) :: a1_m
    real(8), intent (in) :: a2_m
    real(8), intent (in) :: b1_m
    real(8), intent (in) :: b2_m
    code = b2_s * (b1_s * (a2_s * (a1_s * ((a1_m / (b1_m * b2_m)) * a2_m))))
end function

Java

a1\_m = Math.abs(a1);
a1\_s = Math.copySign(1.0, a1);
a2\_m = Math.abs(a2);
a2\_s = Math.copySign(1.0, a2);
b1\_m = Math.abs(b1);
b1\_s = Math.copySign(1.0, b1);
b2\_m = Math.abs(b2);
b2\_s = Math.copySign(1.0, b2);
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
assert a1_m < a2_m && a2_m < b1_m && b1_m < b2_m;
public static double code(double b2_s, double b1_s, double a2_s, double a1_s, double a1_m, double a2_m, double b1_m, double b2_m) {
	return b2_s * (b1_s * (a2_s * (a1_s * ((a1_m / (b1_m * b2_m)) * a2_m))));
}

Python

a1\_m = math.fabs(a1)
a1\_s = math.copysign(1.0, a1)
a2\_m = math.fabs(a2)
a2\_s = math.copysign(1.0, a2)
b1\_m = math.fabs(b1)
b1\_s = math.copysign(1.0, b1)
b2\_m = math.fabs(b2)
b2\_s = math.copysign(1.0, b2)
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
[a1_m, a2_m, b1_m, b2_m] = sort([a1_m, a2_m, b1_m, b2_m])
def code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m):
	return b2_s * (b1_s * (a2_s * (a1_s * ((a1_m / (b1_m * b2_m)) * a2_m))))

Julia

a1\_m = abs(a1)
a1\_s = copysign(1.0, a1)
a2\_m = abs(a2)
a2\_s = copysign(1.0, a2)
b1\_m = abs(b1)
b1\_s = copysign(1.0, b1)
b2\_m = abs(b2)
b2\_s = copysign(1.0, b2)
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
a1_m, a2_m, b1_m, b2_m = sort([a1_m, a2_m, b1_m, b2_m])
function code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	return Float64(b2_s * Float64(b1_s * Float64(a2_s * Float64(a1_s * Float64(Float64(a1_m / Float64(b1_m * b2_m)) * a2_m)))))
end

MATLAB

a1\_m = abs(a1);
a1\_s = sign(a1) * abs(1.0);
a2\_m = abs(a2);
a2\_s = sign(a2) * abs(1.0);
b1\_m = abs(b1);
b1\_s = sign(b1) * abs(1.0);
b2\_m = abs(b2);
b2\_s = sign(b2) * abs(1.0);
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
a1_m, a2_m, b1_m, b2_m = num2cell(sort([a1_m, a2_m, b1_m, b2_m])){:}
function tmp = code(b2_s, b1_s, a2_s, a1_s, a1_m, a2_m, b1_m, b2_m)
	tmp = b2_s * (b1_s * (a2_s * (a1_s * ((a1_m / (b1_m * b2_m)) * a2_m))));
end

Wolfram

a1\_m = N[Abs[a1], $MachinePrecision]
a1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
a2\_m = N[Abs[a2], $MachinePrecision]
a2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b1\_m = N[Abs[b1], $MachinePrecision]
b1\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b1]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
b2\_m = N[Abs[b2], $MachinePrecision]
b2\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[b2]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
NOTE: a1_m, a2_m, b1_m, and b2_m should be sorted in increasing order before calling this function.
code[b2$95$s_, b1$95$s_, a2$95$s_, a1$95$s_, a1$95$m_, a2$95$m_, b1$95$m_, b2$95$m_] := N[(b2$95$s * N[(b1$95$s * N[(a2$95$s * N[(a1$95$s * N[(N[(a1$95$m / N[(b1$95$m * b2$95$m), $MachinePrecision]), $MachinePrecision] * a2$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 86.5%

   \[\frac{a1 \cdot a2}{b1 \cdot b2} \]
2. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \frac{\color{blue}{a1 \cdot a2}}{b1 \cdot b2} \]

   2. lift-*.f64 N/A

      \[\leadsto \frac{a1 \cdot a2}{\color{blue}{b1 \cdot b2}} \]

   3. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{a1 \cdot a2}{b1 \cdot b2}} \]

   4. associate-*l/ N/A

      \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

   5. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2} \cdot a2} \]

   6. *-commutative N/A

      \[\leadsto \frac{a1}{\color{blue}{b2 \cdot b1}} \cdot a2 \]

   7. associate-/r* N/A

      \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

   8. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

   9. lower-/.f64 82.0

      \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

3. Applied rewrites 82.0%

   \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1} \cdot a2} \]
4. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \frac{\color{blue}{\frac{a1}{b2}}}{b1} \cdot a2 \]

   2. lift-/.f64 N/A

      \[\leadsto \color{blue}{\frac{\frac{a1}{b2}}{b1}} \cdot a2 \]

   3. associate-/l/ N/A

      \[\leadsto \color{blue}{\frac{a1}{b2 \cdot b1}} \cdot a2 \]

   4. *-commutative N/A

      \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

   5. frac-2neg N/A

      \[\leadsto \color{blue}{\frac{\mathsf{neg}\left(a1\right)}{\mathsf{neg}\left(b1 \cdot b2\right)}} \cdot a2 \]

   6. distribute-frac-neg N/A

      \[\leadsto \color{blue}{\left(\mathsf{neg}\left(\frac{a1}{\mathsf{neg}\left(b1 \cdot b2\right)}\right)\right)} \cdot a2 \]

   7. distribute-neg-frac2 N/A

      \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

   8. lower-/.f64 N/A

      \[\leadsto \color{blue}{\frac{a1}{\mathsf{neg}\left(\left(\mathsf{neg}\left(b1 \cdot b2\right)\right)\right)}} \cdot a2 \]

   9. remove-double-neg N/A

      \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

   10. lower-*.f64 86.8

       \[\leadsto \frac{a1}{\color{blue}{b1 \cdot b2}} \cdot a2 \]

5. Applied rewrites 86.8%

   \[\leadsto \color{blue}{\frac{a1}{b1 \cdot b2}} \cdot a2 \]
6. Add Preprocessing

Developer Target 1: 98.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \frac{a1}{b1} \cdot \frac{a2}{b2} \end{array} \]

FPCore

(FPCore (a1 a2 b1 b2) :precision binary64 (* (/ a1 b1) (/ a2 b2)))

C

double code(double a1, double a2, double b1, double b2) {
	return (a1 / b1) * (a2 / b2);
}

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(a1, a2, b1, b2)
use fmin_fmax_functions
    real(8), intent (in) :: a1
    real(8), intent (in) :: a2
    real(8), intent (in) :: b1
    real(8), intent (in) :: b2
    code = (a1 / b1) * (a2 / b2)
end function

Java

public static double code(double a1, double a2, double b1, double b2) {
	return (a1 / b1) * (a2 / b2);
}

Python

def code(a1, a2, b1, b2):
	return (a1 / b1) * (a2 / b2)

Julia

function code(a1, a2, b1, b2)
	return Float64(Float64(a1 / b1) * Float64(a2 / b2))
end

MATLAB

function tmp = code(a1, a2, b1, b2)
	tmp = (a1 / b1) * (a2 / b2);
end

Wolfram

code[a1_, a2_, b1_, b2_] := N[(N[(a1 / b1), $MachinePrecision] * N[(a2 / b2), $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025096 
(FPCore (a1 a2 b1 b2)
  :name "Quotient of products"
  :precision binary64

  :alt
  (! :herbie-platform default (* (/ a1 b1) (/ a2 b2)))

  (/ (* a1 a2) (* b1 b2)))