Data.Colour.Matrix:inverse from colour-2.3.3, B

Percentage Accurate: 91.1% → 95.2%

Time: 2.8s

Alternatives: 6

Speedup: 0.7×

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

Specification

Math

\[\begin{array}{l} \\ \frac{x \cdot y - z \cdot t}{a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* z t)) a))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) - (z * t)) / a;
}

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(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) - (z * t)) / a
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - (z * t)) / a;
}

Python

def code(x, y, z, t, a):
	return ((x * y) - (z * t)) / a

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) - Float64(z * t)) / a)
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) - (z * t)) / a;
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Initial Program: 91.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x \cdot y - z \cdot t}{a} \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 (/ (- (* x y) (* z t)) a))

C

double code(double x, double y, double z, double t, double a) {
	return ((x * y) - (z * t)) / a;
}

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(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = ((x * y) - (z * t)) / a
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	return ((x * y) - (z * t)) / a;
}

Python

def code(x, y, z, t, a):
	return ((x * y) - (z * t)) / a

Julia

function code(x, y, z, t, a)
	return Float64(Float64(Float64(x * y) - Float64(z * t)) / a)
end

MATLAB

function tmp = code(x, y, z, t, a)
	tmp = ((x * y) - (z * t)) / a;
end

Wolfram

code[x_, y_, z_, t_, a_] := N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a), $MachinePrecision]

Alternative 1: 95.2% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \begin{array}{l} \mathbf{if}\;a\_m \leq 3.5 \cdot 10^{-27}:\\ \;\;\;\;\frac{x \cdot y - z \cdot t}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{x}{a\_m}, y, \left(-z\right) \cdot \frac{t}{a\_m}\right)\\ \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (*
  a_s
  (if (<= a_m 3.5e-27)
    (/ (- (* x y) (* z t)) a_m)
    (fma (/ x a_m) y (* (- z) (/ t a_m))))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if (a_m <= 3.5e-27) {
		tmp = ((x * y) - (z * t)) / a_m;
	} else {
		tmp = fma((x / a_m), y, (-z * (t / a_m)));
	}
	return a_s * tmp;
}

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if (a_m <= 3.5e-27)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * t)) / a_m);
	else
		tmp = fma(Float64(x / a_m), y, Float64(Float64(-z) * Float64(t / a_m)));
	end
	return Float64(a_s * tmp)
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[a$95$m, 3.5e-27], N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision], N[(N[(x / a$95$m), $MachinePrecision] * y + N[((-z) * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if a < 3.5000000000000001e-27

   1. Initial program 97.8%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   if 3.5000000000000001e-27 < a

   1. Initial program 85.2%

      \[\frac{x \cdot y - z \cdot t}{a} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y - z \cdot t}{a}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} - z \cdot t}{a} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y - \color{blue}{z \cdot t}}{a} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y - z \cdot t}}{a} \]

      5. div-sub N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{a} - \frac{z \cdot t}{a}} \]

      6. *-commutative N/A

         \[\leadsto \frac{x \cdot y}{a} - \frac{\color{blue}{t \cdot z}}{a} \]

      7. negate-sub N/A

         \[\leadsto \color{blue}{\frac{x \cdot y}{a} + \left(\mathsf{neg}\left(\frac{t \cdot z}{a}\right)\right)} \]

      8. mul-1-neg N/A

         \[\leadsto \frac{x \cdot y}{a} + \color{blue}{-1 \cdot \frac{t \cdot z}{a}} \]

      9. associate-*l/ N/A

         \[\leadsto \color{blue}{\frac{x}{a} \cdot y} + -1 \cdot \frac{t \cdot z}{a} \]

      10. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{a}, y, -1 \cdot \frac{t \cdot z}{a}\right)} \]

      11. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{\frac{x}{a}}, y, -1 \cdot \frac{t \cdot z}{a}\right) \]

      12. associate-*l/ N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, -1 \cdot \color{blue}{\left(\frac{t}{a} \cdot z\right)}\right) \]

      13. associate-*l* N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(-1 \cdot \frac{t}{a}\right) \cdot z}\right) \]

      14. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{z \cdot \left(-1 \cdot \frac{t}{a}\right)}\right) \]

      15. associate-*r* N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(z \cdot -1\right) \cdot \frac{t}{a}}\right) \]

      16. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(-1 \cdot z\right)} \cdot \frac{t}{a}\right) \]

      17. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(-1 \cdot z\right) \cdot \frac{t}{a}}\right) \]

      18. mul-1-neg N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(\mathsf{neg}\left(z\right)\right)} \cdot \frac{t}{a}\right) \]

      19. lower-neg.f64 N/A

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \color{blue}{\left(-z\right)} \cdot \frac{t}{a}\right) \]

      20. lower-/.f64 93.0

          \[\leadsto \mathsf{fma}\left(\frac{x}{a}, y, \left(-z\right) \cdot \color{blue}{\frac{t}{a}}\right) \]

   3. Applied rewrites 93.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\frac{x}{a}, y, \left(-z\right) \cdot \frac{t}{a}\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 92.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \begin{array}{l} \mathbf{if}\;x \cdot y \leq 5 \cdot 10^{+276}:\\ \;\;\;\;\frac{x \cdot y - z \cdot t}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a\_m} \cdot x\\ \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (* a_s (if (<= (* x y) 5e+276) (/ (- (* x y) (* z t)) a_m) (* (/ y a_m) x))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if ((x * y) <= 5e+276) {
		tmp = ((x * y) - (z * t)) / a_m;
	} else {
		tmp = (y / a_m) * x;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: tmp
    if ((x * y) <= 5d+276) then
        tmp = ((x * y) - (z * t)) / a_m
    else
        tmp = (y / a_m) * x
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if ((x * y) <= 5e+276) {
		tmp = ((x * y) - (z * t)) / a_m;
	} else {
		tmp = (y / a_m) * x;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	tmp = 0
	if (x * y) <= 5e+276:
		tmp = ((x * y) - (z * t)) / a_m
	else:
		tmp = (y / a_m) * x
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if (Float64(x * y) <= 5e+276)
		tmp = Float64(Float64(Float64(x * y) - Float64(z * t)) / a_m);
	else
		tmp = Float64(Float64(y / a_m) * x);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	tmp = 0.0;
	if ((x * y) <= 5e+276)
		tmp = ((x * y) - (z * t)) / a_m;
	else
		tmp = (y / a_m) * x;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(x * y), $MachinePrecision], 5e+276], N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision], N[(N[(y / a$95$m), $MachinePrecision] * x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (*.f64 x y) < 5.00000000000000001e276

   1. Initial program 92.6%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   if 5.00000000000000001e276 < (*.f64 x y)

   1. Initial program 73.0%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{t \cdot \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

      3. +-commutative N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + -1 \cdot \frac{z}{a}\right) \cdot t \]

      4. mul-1-neg N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right) \cdot t \]

      5. negate-sub-reverse N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      6. lower--.f64 N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      7. associate-/l* N/A

         \[\leadsto \left(x \cdot \frac{y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      8. *-commutative N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      10. lower-/.f64 N/A

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      12. lower-/.f64 74.1

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   4. Applied rewrites 74.1%

      \[\leadsto \color{blue}{\left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t} \]

   5. Taylor expanded in x around inf

      \[\leadsto \frac{x \cdot y}{a \cdot t} \cdot t \]
   6. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto \left(x \cdot \frac{y}{a \cdot t}\right) \cdot t \]

      2. *-commutative N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      5. lift-*.f64 74.9

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   7. Applied rewrites 74.9%

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   8. Taylor expanded in x around inf

      \[\leadsto \frac{x \cdot y}{\color{blue}{a}} \]
   9. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto x \cdot \frac{y}{\color{blue}{a}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y}{a} \cdot x \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{y}{a} \cdot x \]

      4. lift-*.f64 95.1

         \[\leadsto \frac{y}{a} \cdot x \]

   10. Applied rewrites 95.1%

       \[\leadsto \frac{y}{a} \cdot \color{blue}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 73.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(-z\right) \cdot \frac{t}{a\_m}\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;z \cdot t \leq -1 \cdot 10^{+76}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \cdot t \leq 5 \cdot 10^{-21}:\\ \;\;\;\;\frac{y \cdot x}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (- z) (/ t a_m))))
   (*
    a_s
    (if (<= (* z t) -1e+76) t_1 (if (<= (* z t) 5e-21) (/ (* y x) a_m) t_1)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = -z * (t / a_m);
	double tmp;
	if ((z * t) <= -1e+76) {
		tmp = t_1;
	} else if ((z * t) <= 5e-21) {
		tmp = (y * x) / a_m;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -z * (t / a_m)
    if ((z * t) <= (-1d+76)) then
        tmp = t_1
    else if ((z * t) <= 5d-21) then
        tmp = (y * x) / a_m
    else
        tmp = t_1
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = -z * (t / a_m);
	double tmp;
	if ((z * t) <= -1e+76) {
		tmp = t_1;
	} else if ((z * t) <= 5e-21) {
		tmp = (y * x) / a_m;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = -z * (t / a_m)
	tmp = 0
	if (z * t) <= -1e+76:
		tmp = t_1
	elif (z * t) <= 5e-21:
		tmp = (y * x) / a_m
	else:
		tmp = t_1
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(-z) * Float64(t / a_m))
	tmp = 0.0
	if (Float64(z * t) <= -1e+76)
		tmp = t_1;
	elseif (Float64(z * t) <= 5e-21)
		tmp = Float64(Float64(y * x) / a_m);
	else
		tmp = t_1;
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = -z * (t / a_m);
	tmp = 0.0;
	if ((z * t) <= -1e+76)
		tmp = t_1;
	elseif ((z * t) <= 5e-21)
		tmp = (y * x) / a_m;
	else
		tmp = t_1;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[((-z) * N[(t / a$95$m), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(z * t), $MachinePrecision], -1e+76], t$95$1, If[LessEqual[N[(z * t), $MachinePrecision], 5e-21], N[(N[(y * x), $MachinePrecision] / a$95$m), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -1e76 or 4.99999999999999973e-21 < (*.f64 z t)

   1. Initial program 87.8%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot z}{a}} \]
   3. Step-by-step derivation

      1. associate-*l/ N/A

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

      2. associate-*l* N/A

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

      3. *-commutative N/A

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

      4. associate-*r* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(z\right)\right) \cdot \frac{\color{blue}{t}}{a} \]

      8. lower-neg.f64 N/A

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

      9. lower-/.f64 76.0

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

   4. Applied rewrites 76.0%

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

   if -1e76 < (*.f64 z t) < 4.99999999999999973e-21

   1. Initial program 93.9%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x \cdot y}}{a} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

      2. lower-*.f64 72.0

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

   4. Applied rewrites 72.0%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 72.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ \begin{array}{l} t_1 := \left(-t\right) \cdot \frac{z}{a\_m}\\ a\_s \cdot \begin{array}{l} \mathbf{if}\;z \cdot t \leq -4 \cdot 10^{+126}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \cdot t \leq 2 \cdot 10^{-20}:\\ \;\;\;\;\frac{y \cdot x}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (let* ((t_1 (* (- t) (/ z a_m))))
   (*
    a_s
    (if (<= (* z t) -4e+126)
      t_1
      (if (<= (* z t) 2e-20) (/ (* y x) a_m) t_1)))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = -t * (z / a_m);
	double tmp;
	if ((z * t) <= -4e+126) {
		tmp = t_1;
	} else if ((z * t) <= 2e-20) {
		tmp = (y * x) / a_m;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -t * (z / a_m)
    if ((z * t) <= (-4d+126)) then
        tmp = t_1
    else if ((z * t) <= 2d-20) then
        tmp = (y * x) / a_m
    else
        tmp = t_1
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double t_1 = -t * (z / a_m);
	double tmp;
	if ((z * t) <= -4e+126) {
		tmp = t_1;
	} else if ((z * t) <= 2e-20) {
		tmp = (y * x) / a_m;
	} else {
		tmp = t_1;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	t_1 = -t * (z / a_m)
	tmp = 0
	if (z * t) <= -4e+126:
		tmp = t_1
	elif (z * t) <= 2e-20:
		tmp = (y * x) / a_m
	else:
		tmp = t_1
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	t_1 = Float64(Float64(-t) * Float64(z / a_m))
	tmp = 0.0
	if (Float64(z * t) <= -4e+126)
		tmp = t_1;
	elseif (Float64(z * t) <= 2e-20)
		tmp = Float64(Float64(y * x) / a_m);
	else
		tmp = t_1;
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	t_1 = -t * (z / a_m);
	tmp = 0.0;
	if ((z * t) <= -4e+126)
		tmp = t_1;
	elseif ((z * t) <= 2e-20)
		tmp = (y * x) / a_m;
	else
		tmp = t_1;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := Block[{t$95$1 = N[((-t) * N[(z / a$95$m), $MachinePrecision]), $MachinePrecision]}, N[(a$95$s * If[LessEqual[N[(z * t), $MachinePrecision], -4e+126], t$95$1, If[LessEqual[N[(z * t), $MachinePrecision], 2e-20], N[(N[(y * x), $MachinePrecision] / a$95$m), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 z t) < -3.9999999999999997e126 or 1.99999999999999989e-20 < (*.f64 z t)

   1. Initial program 87.1%

      \[\frac{x \cdot y - z \cdot t}{a} \]
   2. Step-by-step derivation

      1. lift-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x \cdot y - z \cdot t}{a}} \]

      2. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y} - z \cdot t}{a} \]

      3. lift-*.f64 N/A

         \[\leadsto \frac{x \cdot y - \color{blue}{z \cdot t}}{a} \]

      4. lift--.f64 N/A

         \[\leadsto \frac{\color{blue}{x \cdot y - z \cdot t}}{a} \]

      5. negate-sub N/A

         \[\leadsto \frac{\color{blue}{x \cdot y + \left(\mathsf{neg}\left(z \cdot t\right)\right)}}{a} \]

      6. *-commutative N/A

         \[\leadsto \frac{x \cdot y + \left(\mathsf{neg}\left(\color{blue}{t \cdot z}\right)\right)}{a} \]

      7. mul-1-neg N/A

         \[\leadsto \frac{x \cdot y + \color{blue}{-1 \cdot \left(t \cdot z\right)}}{a} \]

      8. +-commutative N/A

         \[\leadsto \frac{\color{blue}{-1 \cdot \left(t \cdot z\right) + x \cdot y}}{a} \]

      9. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{-1 \cdot \left(t \cdot z\right)}{a} + \frac{x \cdot y}{a}} \]

      10. *-commutative N/A

          \[\leadsto \frac{\color{blue}{\left(t \cdot z\right) \cdot -1}}{a} + \frac{x \cdot y}{a} \]

      11. associate-/l* N/A

          \[\leadsto \color{blue}{\left(t \cdot z\right) \cdot \frac{-1}{a}} + \frac{x \cdot y}{a} \]

      12. lower-fma.f64 N/A

          \[\leadsto \color{blue}{\mathsf{fma}\left(t \cdot z, \frac{-1}{a}, \frac{x \cdot y}{a}\right)} \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\color{blue}{t \cdot z}, \frac{-1}{a}, \frac{x \cdot y}{a}\right) \]

      14. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(t \cdot z, \color{blue}{\frac{-1}{a}}, \frac{x \cdot y}{a}\right) \]

      15. lower-/.f64 N/A

          \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{-1}{a}, \color{blue}{\frac{x \cdot y}{a}}\right) \]

      16. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{-1}{a}, \frac{\color{blue}{y \cdot x}}{a}\right) \]

      17. lower-*.f64 84.7

          \[\leadsto \mathsf{fma}\left(t \cdot z, \frac{-1}{a}, \frac{\color{blue}{y \cdot x}}{a}\right) \]

   3. Applied rewrites 84.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(t \cdot z, \frac{-1}{a}, \frac{y \cdot x}{a}\right)} \]

   4. Taylor expanded in x around 0

      \[\leadsto \color{blue}{-1 \cdot \frac{t \cdot z}{a}} \]
   5. Step-by-step derivation

      1. associate-/l* N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(t\right)\right) \cdot \frac{\color{blue}{z}}{a} \]

      5. lower-neg.f64 N/A

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

      6. lower-/.f64 77.3

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

   6. Applied rewrites 77.3%

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

   if -3.9999999999999997e126 < (*.f64 z t) < 1.99999999999999989e-20

   1. Initial program 94.1%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x \cdot y}}{a} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

      2. lower-*.f64 69.6

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

   4. Applied rewrites 69.6%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 51.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \begin{array}{l} \mathbf{if}\;\frac{x \cdot y - z \cdot t}{a\_m} \leq 10^{+303}:\\ \;\;\;\;\frac{y \cdot x}{a\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{a\_m} \cdot x\\ \end{array} \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m)
 :precision binary64
 (*
  a_s
  (if (<= (/ (- (* x y) (* z t)) a_m) 1e+303)
    (/ (* y x) a_m)
    (* (/ y a_m) x))))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if ((((x * y) - (z * t)) / a_m) <= 1e+303) {
		tmp = (y * x) / a_m;
	} else {
		tmp = (y / a_m) * x;
	}
	return a_s * tmp;
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    real(8) :: tmp
    if ((((x * y) - (z * t)) / a_m) <= 1d+303) then
        tmp = (y * x) / a_m
    else
        tmp = (y / a_m) * x
    end if
    code = a_s * tmp
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	double tmp;
	if ((((x * y) - (z * t)) / a_m) <= 1e+303) {
		tmp = (y * x) / a_m;
	} else {
		tmp = (y / a_m) * x;
	}
	return a_s * tmp;
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	tmp = 0
	if (((x * y) - (z * t)) / a_m) <= 1e+303:
		tmp = (y * x) / a_m
	else:
		tmp = (y / a_m) * x
	return a_s * tmp

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	tmp = 0.0
	if (Float64(Float64(Float64(x * y) - Float64(z * t)) / a_m) <= 1e+303)
		tmp = Float64(Float64(y * x) / a_m);
	else
		tmp = Float64(Float64(y / a_m) * x);
	end
	return Float64(a_s * tmp)
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp_2 = code(a_s, x, y, z, t, a_m)
	tmp = 0.0;
	if ((((x * y) - (z * t)) / a_m) <= 1e+303)
		tmp = (y * x) / a_m;
	else
		tmp = (y / a_m) * x;
	end
	tmp_2 = a_s * tmp;
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * If[LessEqual[N[(N[(N[(x * y), $MachinePrecision] - N[(z * t), $MachinePrecision]), $MachinePrecision] / a$95$m), $MachinePrecision], 1e+303], N[(N[(y * x), $MachinePrecision] / a$95$m), $MachinePrecision], N[(N[(y / a$95$m), $MachinePrecision] * x), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (*.f64 x y) (*.f64 z t)) a) < 1e303

   1. Initial program 94.6%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in x around inf

      \[\leadsto \frac{\color{blue}{x \cdot y}}{a} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

      2. lower-*.f64 51.0

         \[\leadsto \frac{y \cdot \color{blue}{x}}{a} \]

   4. Applied rewrites 51.0%

      \[\leadsto \frac{\color{blue}{y \cdot x}}{a} \]

   if 1e303 < (/.f64 (-.f64 (*.f64 x y) (*.f64 z t)) a)

   1. Initial program 76.2%

      \[\frac{x \cdot y - z \cdot t}{a} \]

   2. Taylor expanded in t around inf

      \[\leadsto \color{blue}{t \cdot \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

      3. +-commutative N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + -1 \cdot \frac{z}{a}\right) \cdot t \]

      4. mul-1-neg N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right) \cdot t \]

      5. negate-sub-reverse N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      6. lower--.f64 N/A

         \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      7. associate-/l* N/A

         \[\leadsto \left(x \cdot \frac{y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

      8. *-commutative N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      9. lower-*.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      10. lower-/.f64 N/A

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      11. lower-*.f64 N/A

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

      12. lower-/.f64 86.0

          \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   4. Applied rewrites 86.0%

      \[\leadsto \color{blue}{\left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t} \]

   5. Taylor expanded in x around inf

      \[\leadsto \frac{x \cdot y}{a \cdot t} \cdot t \]
   6. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto \left(x \cdot \frac{y}{a \cdot t}\right) \cdot t \]

      2. *-commutative N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      3. lift-/.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      4. lift-*.f64 N/A

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

      5. lift-*.f64 46.9

         \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   7. Applied rewrites 46.9%

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   8. Taylor expanded in x around inf

      \[\leadsto \frac{x \cdot y}{\color{blue}{a}} \]
   9. Step-by-step derivation

      1. associate-/l* N/A

         \[\leadsto x \cdot \frac{y}{\color{blue}{a}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y}{a} \cdot x \]

      3. lift-/.f64 N/A

         \[\leadsto \frac{y}{a} \cdot x \]

      4. lift-*.f64 55.2

         \[\leadsto \frac{y}{a} \cdot x \]

   10. Applied rewrites 55.2%

       \[\leadsto \frac{y}{a} \cdot \color{blue}{x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 50.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} a\_m = \left|a\right| \\ a\_s = \mathsf{copysign}\left(1, a\right) \\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\\\ [x, y, z, t, a_m] = \mathsf{sort}([x, y, z, t, a_m])\\ \\ a\_s \cdot \left(\frac{y}{a\_m} \cdot x\right) \end{array} \]

FPCore

a\_m = (fabs.f64 a)
a\_s = (copysign.f64 #s(literal 1 binary64) a)
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
(FPCore (a_s x y z t a_m) :precision binary64 (* a_s (* (/ y a_m) x)))

C

a\_m = fabs(a);
a\_s = copysign(1.0, a);
assert(x < y && y < z && z < t && t < a_m);
assert(x < y && y < z && z < t && t < a_m);
double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * ((y / a_m) * x);
}

Fortran

a\_m =     private
a\_s =     private
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_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(a_s, x, y, z, t, a_m)
use fmin_fmax_functions
    real(8), intent (in) :: a_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a_m
    code = a_s * ((y / a_m) * x)
end function

Java

a\_m = Math.abs(a);
a\_s = Math.copySign(1.0, a);
assert x < y && y < z && z < t && t < a_m;
assert x < y && y < z && z < t && t < a_m;
public static double code(double a_s, double x, double y, double z, double t, double a_m) {
	return a_s * ((y / a_m) * x);
}

Python

a\_m = math.fabs(a)
a\_s = math.copysign(1.0, a)
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
[x, y, z, t, a_m] = sort([x, y, z, t, a_m])
def code(a_s, x, y, z, t, a_m):
	return a_s * ((y / a_m) * x)

Julia

a\_m = abs(a)
a\_s = copysign(1.0, a)
x, y, z, t, a_m = sort([x, y, z, t, a_m])
x, y, z, t, a_m = sort([x, y, z, t, a_m])
function code(a_s, x, y, z, t, a_m)
	return Float64(a_s * Float64(Float64(y / a_m) * x))
end

MATLAB

a\_m = abs(a);
a\_s = sign(a) * abs(1.0);
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
x, y, z, t, a_m = num2cell(sort([x, y, z, t, a_m])){:}
function tmp = code(a_s, x, y, z, t, a_m)
	tmp = a_s * ((y / a_m) * x);
end

Wolfram

a\_m = N[Abs[a], $MachinePrecision]
a\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[a]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
NOTE: x, y, z, t, and a_m should be sorted in increasing order before calling this function.
code[a$95$s_, x_, y_, z_, t_, a$95$m_] := N[(a$95$s * N[(N[(y / a$95$m), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 91.1%

   \[\frac{x \cdot y - z \cdot t}{a} \]

2. Taylor expanded in t around inf

   \[\leadsto \color{blue}{t \cdot \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right)} \]
3. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

   2. lower-*.f64 N/A

      \[\leadsto \left(-1 \cdot \frac{z}{a} + \frac{x \cdot y}{a \cdot t}\right) \cdot \color{blue}{t} \]

   3. +-commutative N/A

      \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + -1 \cdot \frac{z}{a}\right) \cdot t \]

   4. mul-1-neg N/A

      \[\leadsto \left(\frac{x \cdot y}{a \cdot t} + \left(\mathsf{neg}\left(\frac{z}{a}\right)\right)\right) \cdot t \]

   5. negate-sub-reverse N/A

      \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

   6. lower--.f64 N/A

      \[\leadsto \left(\frac{x \cdot y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

   7. associate-/l* N/A

      \[\leadsto \left(x \cdot \frac{y}{a \cdot t} - \frac{z}{a}\right) \cdot t \]

   8. *-commutative N/A

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   9. lower-*.f64 N/A

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   10. lower-/.f64 N/A

       \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   11. lower-*.f64 N/A

       \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

   12. lower-/.f64 78.6

       \[\leadsto \left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t \]

4. Applied rewrites 78.6%

   \[\leadsto \color{blue}{\left(\frac{y}{a \cdot t} \cdot x - \frac{z}{a}\right) \cdot t} \]

5. Taylor expanded in x around inf

   \[\leadsto \frac{x \cdot y}{a \cdot t} \cdot t \]
6. Step-by-step derivation

   1. associate-/l* N/A

      \[\leadsto \left(x \cdot \frac{y}{a \cdot t}\right) \cdot t \]

   2. *-commutative N/A

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   3. lift-/.f64 N/A

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   4. lift-*.f64 N/A

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

   5. lift-*.f64 40.7

      \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

7. Applied rewrites 40.7%

   \[\leadsto \left(\frac{y}{a \cdot t} \cdot x\right) \cdot t \]

8. Taylor expanded in x around inf

   \[\leadsto \frac{x \cdot y}{\color{blue}{a}} \]
9. Step-by-step derivation

   1. associate-/l* N/A

      \[\leadsto x \cdot \frac{y}{\color{blue}{a}} \]

   2. *-commutative N/A

      \[\leadsto \frac{y}{a} \cdot x \]

   3. lift-/.f64 N/A

      \[\leadsto \frac{y}{a} \cdot x \]

   4. lift-*.f64 50.8

      \[\leadsto \frac{y}{a} \cdot x \]

10. Applied rewrites 50.8%

    \[\leadsto \frac{y}{a} \cdot \color{blue}{x} \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2025119 
(FPCore (x y z t a)
  :name "Data.Colour.Matrix:inverse from colour-2.3.3, B"
  :precision binary64
  (/ (- (* x y) (* z t)) a))