Data.Colour.Matrix:determinant from colour-2.3.3, A

Percentage Accurate: 73.9% → 82.1%

Time: 7.0s

Alternatives: 21

Speedup: 0.5×

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

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (+
  (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i))))
  (* j (- (* c a) (* y i)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}

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, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    code = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}

Python

def code(x, y, z, t, a, b, c, i, j):
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))

Julia

function code(x, y, z, t, a, b, c, i, j)
	return Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + Float64(j * Float64(Float64(c * a) - Float64(y * i))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i, j)
	tmp = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 73.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (+
  (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i))))
  (* j (- (* c a) (* y i)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}

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, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    code = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
}

Python

def code(x, y, z, t, a, b, c, i, j):
	return ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))

Julia

function code(x, y, z, t, a, b, c, i, j)
	return Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + Float64(j * Float64(Float64(c * a) - Float64(y * i))))
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i, j)
	tmp = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 82.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := j \cdot \left(c \cdot a - y \cdot i\right)\\ \mathbf{if}\;\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + t\_1 \leq \infty:\\ \;\;\;\;\left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(c \cdot b\right) \cdot z\right) + t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* j (- (* c a) (* y i)))))
   (if (<=
        (+ (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i)))) t_1)
        INFINITY)
     (+ (- (fma (- (* z y) (* a t)) x (* (* i t) b)) (* (* c b) z)) t_1)
     (* (* z (- (/ (* i t) z) c)) b))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = j * ((c * a) - (y * i));
	double tmp;
	if ((((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + t_1) <= ((double) INFINITY)) {
		tmp = (fma(((z * y) - (a * t)), x, ((i * t) * b)) - ((c * b) * z)) + t_1;
	} else {
		tmp = (z * (((i * t) / z) - c)) * b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(j * Float64(Float64(c * a) - Float64(y * i)))
	tmp = 0.0
	if (Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + t_1) <= Inf)
		tmp = Float64(Float64(fma(Float64(Float64(z * y) - Float64(a * t)), x, Float64(Float64(i * t) * b)) - Float64(Float64(c * b) * z)) + t_1);
	else
		tmp = Float64(Float64(z * Float64(Float64(Float64(i * t) / z) - c)) * b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], Infinity], N[(N[(N[(N[(N[(z * y), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision] * x + N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision]), $MachinePrecision] - N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision] + t$95$1), $MachinePrecision], N[(N[(z * N[(N[(N[(i * t), $MachinePrecision] / z), $MachinePrecision] - c), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) < +inf.0

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. lower--.f64 N/A

         \[\leadsto \left(\left(b \cdot \left(i \cdot t\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - \color{blue}{b \cdot \left(c \cdot z\right)}\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      2. +-commutative N/A

         \[\leadsto \left(\left(x \cdot \left(y \cdot z - a \cdot t\right) + b \cdot \left(i \cdot t\right)\right) - \color{blue}{b} \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      3. *-commutative N/A

         \[\leadsto \left(\left(\left(y \cdot z - a \cdot t\right) \cdot x + b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      4. *-commutative N/A

         \[\leadsto \left(\left(\left(y \cdot z - t \cdot a\right) \cdot x + b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(y \cdot z - t \cdot a, x, b \cdot \left(i \cdot t\right)\right) - \color{blue}{b} \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      6. lift--.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(y \cdot z - t \cdot a, x, b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      7. *-commutative N/A

         \[\leadsto \left(\mathsf{fma}\left(z \cdot y - t \cdot a, x, b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \left(\mathsf{fma}\left(z \cdot y - t \cdot a, x, b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      9. *-commutative N/A

         \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, b \cdot \left(i \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      11. *-commutative N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      14. associate-*r* N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(b \cdot c\right) \cdot \color{blue}{z}\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      15. lower-*.f64 N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(b \cdot c\right) \cdot \color{blue}{z}\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      16. *-commutative N/A

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(c \cdot b\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      17. lower-*.f64 72.7

          \[\leadsto \left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(c \cdot b\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   4. Applied rewrites 72.7%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(i \cdot t\right) \cdot b\right) - \left(c \cdot b\right) \cdot z\right)} + j \cdot \left(c \cdot a - y \cdot i\right) \]

   if +inf.0 < (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i))))

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      2. lower--.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      3. lower-/.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      4. lift-*.f64 39.7

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   7. Applied rewrites 39.7%

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 79.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right)\\ \mathbf{if}\;t\_1 \leq \infty:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;\left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1
         (+
          (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i))))
          (* j (- (* c a) (* y i))))))
   (if (<= t_1 INFINITY) t_1 (* (* z (- (/ (* i t) z) c)) b))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
	double tmp;
	if (t_1 <= ((double) INFINITY)) {
		tmp = t_1;
	} else {
		tmp = (z * (((i * t) / z) - c)) * b;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
	double tmp;
	if (t_1 <= Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else {
		tmp = (z * (((i * t) / z) - c)) * b;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)))
	tmp = 0
	if t_1 <= math.inf:
		tmp = t_1
	else:
		tmp = (z * (((i * t) / z) - c)) * b
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(c * z) - Float64(t * i)))) + Float64(j * Float64(Float64(c * a) - Float64(y * i))))
	tmp = 0.0
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = Float64(Float64(z * Float64(Float64(Float64(i * t) / z) - c)) * b);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = ((x * ((y * z) - (t * a))) - (b * ((c * z) - (t * i)))) + (j * ((c * a) - (y * i)));
	tmp = 0.0;
	if (t_1 <= Inf)
		tmp = t_1;
	else
		tmp = (z * (((i * t) / z) - c)) * b;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[(N[(c * z), $MachinePrecision] - N[(t * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, Infinity], t$95$1, N[(N[(z * N[(N[(N[(i * t), $MachinePrecision] / z), $MachinePrecision] - c), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i)))) < +inf.0

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   if +inf.0 < (+.f64 (-.f64 (*.f64 x (-.f64 (*.f64 y z) (*.f64 t a))) (*.f64 b (-.f64 (*.f64 c z) (*.f64 t i)))) (*.f64 j (-.f64 (*.f64 c a) (*.f64 y i))))

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      2. lower--.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      3. lower-/.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      4. lift-*.f64 39.7

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   7. Applied rewrites 39.7%

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 71.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(\left(-z\right) \cdot \mathsf{fma}\left(i, \frac{t}{z}, -c\right)\right)\right) + j \cdot \left(a \cdot c\right)\\ \mathbf{if}\;b \leq -6 \cdot 10^{-77}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 2.4 \cdot 10^{+131}:\\ \;\;\;\;\mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1
         (+
          (- (* x (- (* y z) (* t a))) (* b (* (- z) (fma i (/ t z) (- c)))))
          (* j (* a c)))))
   (if (<= b -6e-77)
     t_1
     (if (<= b 2.4e+131)
       (fma
        (* j c)
        a
        (- (fma t (* -1.0 (* a x)) (* y (- (* x z) (* i j)))) (* (* c b) z)))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((x * ((y * z) - (t * a))) - (b * (-z * fma(i, (t / z), -c)))) + (j * (a * c));
	double tmp;
	if (b <= -6e-77) {
		tmp = t_1;
	} else if (b <= 2.4e+131) {
		tmp = fma((j * c), a, (fma(t, (-1.0 * (a * x)), (y * ((x * z) - (i * j)))) - ((c * b) * z)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(Float64(x * Float64(Float64(y * z) - Float64(t * a))) - Float64(b * Float64(Float64(-z) * fma(i, Float64(t / z), Float64(-c))))) + Float64(j * Float64(a * c)))
	tmp = 0.0
	if (b <= -6e-77)
		tmp = t_1;
	elseif (b <= 2.4e+131)
		tmp = fma(Float64(j * c), a, Float64(fma(t, Float64(-1.0 * Float64(a * x)), Float64(y * Float64(Float64(x * z) - Float64(i * j)))) - Float64(Float64(c * b) * z)));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(N[(x * N[(N[(y * z), $MachinePrecision] - N[(t * a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(b * N[((-z) * N[(i * N[(t / z), $MachinePrecision] + (-c)), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] + N[(j * N[(a * c), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[b, -6e-77], t$95$1, If[LessEqual[b, 2.4e+131], N[(N[(j * c), $MachinePrecision] * a + N[(N[(t * N[(-1.0 * N[(a * x), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if b < -6.00000000000000033e-77 or 2.3999999999999999e131 < b

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in z around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(\left(\mathsf{neg}\left(z\right)\right) \cdot \left(\color{blue}{-1 \cdot c} + \frac{i \cdot t}{z}\right)\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      4. lower-neg.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. mul-1-neg N/A

         \[\leadsto \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(\left(-z\right) \cdot \mathsf{fma}\left(i, \frac{t}{z}, \mathsf{neg}\left(c\right)\right)\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      10. lower-neg.f64 68.0

          \[\leadsto \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(\left(-z\right) \cdot \mathsf{fma}\left(i, \frac{t}{z}, -c\right)\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   4. Applied rewrites 68.0%

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

   5. Taylor expanded in y around 0

      \[\leadsto \left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(\left(-z\right) \cdot \mathsf{fma}\left(i, \frac{t}{z}, -c\right)\right)\right) + j \cdot \color{blue}{\left(a \cdot c\right)} \]
   6. Step-by-step derivation

      1. lower-*.f64 61.9

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

   7. Applied rewrites 61.9%

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

   if -6.00000000000000033e-77 < b < 2.3999999999999999e131

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(\mathsf{neg}\left(i \cdot \left(j \cdot y\right)\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      3. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      5. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      6. add-flip N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) - \left(\mathsf{neg}\left(b \cdot i\right)\right)\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      7. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) - -1 \cdot \left(b \cdot i\right)\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right) - -1 \cdot \left(b \cdot i\right), x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   7. Applied rewrites 73.0%

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \mathsf{fma}\left(t, \left(-a \cdot x\right) + b \cdot i, x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   8. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(t \cdot \left(b \cdot i - a \cdot x\right) + y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      2. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      3. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      8. lower-*.f64 75.0

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   10. Applied rewrites 75.0%

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   11. Taylor expanded in x around inf

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   12. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

       2. lift-*.f64 68.0

          \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   13. Applied rewrites 68.0%

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 71.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -2 \cdot 10^{+178}:\\ \;\;\;\;\left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b\\ \mathbf{elif}\;b \leq 8.5 \cdot 10^{+161}:\\ \;\;\;\;\mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right)\\ \mathbf{else}:\\ \;\;\;\;\left(i \cdot t - c \cdot z\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= b -2e+178)
   (* (* z (- (/ (* i t) z) c)) b)
   (if (<= b 8.5e+161)
     (fma
      (* j c)
      a
      (- (fma t (* -1.0 (* a x)) (* y (- (* x z) (* i j)))) (* (* c b) z)))
     (* (- (* i t) (* c z)) b))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (b <= -2e+178) {
		tmp = (z * (((i * t) / z) - c)) * b;
	} else if (b <= 8.5e+161) {
		tmp = fma((j * c), a, (fma(t, (-1.0 * (a * x)), (y * ((x * z) - (i * j)))) - ((c * b) * z)));
	} else {
		tmp = ((i * t) - (c * z)) * b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (b <= -2e+178)
		tmp = Float64(Float64(z * Float64(Float64(Float64(i * t) / z) - c)) * b);
	elseif (b <= 8.5e+161)
		tmp = fma(Float64(j * c), a, Float64(fma(t, Float64(-1.0 * Float64(a * x)), Float64(y * Float64(Float64(x * z) - Float64(i * j)))) - Float64(Float64(c * b) * z)));
	else
		tmp = Float64(Float64(Float64(i * t) - Float64(c * z)) * b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[b, -2e+178], N[(N[(z * N[(N[(N[(i * t), $MachinePrecision] / z), $MachinePrecision] - c), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[b, 8.5e+161], N[(N[(j * c), $MachinePrecision] * a + N[(N[(t * N[(-1.0 * N[(a * x), $MachinePrecision]), $MachinePrecision] + N[(y * N[(N[(x * z), $MachinePrecision] - N[(i * j), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i * t), $MachinePrecision] - N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -2.0000000000000001e178

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      2. lower--.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      3. lower-/.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      4. lift-*.f64 39.7

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   7. Applied rewrites 39.7%

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   if -2.0000000000000001e178 < b < 8.50000000000000007e161

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in t around 0

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(\mathsf{neg}\left(i \cdot \left(j \cdot y\right)\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      3. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      5. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) + b \cdot i\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      6. add-flip N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) - \left(\mathsf{neg}\left(b \cdot i\right)\right)\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      7. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \left(t \cdot \left(-1 \cdot \left(a \cdot x\right) - -1 \cdot \left(b \cdot i\right)\right) + x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      8. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right) - -1 \cdot \left(b \cdot i\right), x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   7. Applied rewrites 73.0%

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\left(-i \cdot \left(j \cdot y\right)\right) + \mathsf{fma}\left(t, \left(-a \cdot x\right) + b \cdot i, x \cdot \left(y \cdot z\right)\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   8. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(t \cdot \left(b \cdot i - a \cdot x\right) + y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   9. Step-by-step derivation

      1. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      2. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      3. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      7. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

      8. lower-*.f64 75.0

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   10. Applied rewrites 75.0%

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, b \cdot i - a \cdot x, y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   11. Taylor expanded in x around inf

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]
   12. Step-by-step derivation

       1. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

       2. lift-*.f64 68.0

          \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   13. Applied rewrites 68.0%

       \[\leadsto \mathsf{fma}\left(j \cdot c, a, \mathsf{fma}\left(t, -1 \cdot \left(a \cdot x\right), y \cdot \left(x \cdot z - i \cdot j\right)\right) - \left(c \cdot b\right) \cdot z\right) \]

   if 8.50000000000000007e161 < b

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 67.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{if}\;i \leq -5.4 \cdot 10^{+88}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;i \leq 3.8 \cdot 10^{+30}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z\\ \mathbf{elif}\;i \leq 4.2 \cdot 10^{+142}:\\ \;\;\;\;\mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* i (- (* b t) (* j y)))))
   (if (<= i -5.4e+88)
     t_1
     (if (<= i 3.8e+30)
       (- (fma (- (* z y) (* a t)) x (* (* j c) a)) (* (* c b) z))
       (if (<= i 4.2e+142)
         (fma (* j c) a (+ (- (* i (* j y))) (* x (- (* y z) (* a t)))))
         t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -5.4e+88) {
		tmp = t_1;
	} else if (i <= 3.8e+30) {
		tmp = fma(((z * y) - (a * t)), x, ((j * c) * a)) - ((c * b) * z);
	} else if (i <= 4.2e+142) {
		tmp = fma((j * c), a, (-(i * (j * y)) + (x * ((y * z) - (a * t)))));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(i * Float64(Float64(b * t) - Float64(j * y)))
	tmp = 0.0
	if (i <= -5.4e+88)
		tmp = t_1;
	elseif (i <= 3.8e+30)
		tmp = Float64(fma(Float64(Float64(z * y) - Float64(a * t)), x, Float64(Float64(j * c) * a)) - Float64(Float64(c * b) * z));
	elseif (i <= 4.2e+142)
		tmp = fma(Float64(j * c), a, Float64(Float64(-Float64(i * Float64(j * y))) + Float64(x * Float64(Float64(y * z) - Float64(a * t)))));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -5.4e+88], t$95$1, If[LessEqual[i, 3.8e+30], N[(N[(N[(N[(z * y), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision] * x + N[(N[(j * c), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] - N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], If[LessEqual[i, 4.2e+142], N[(N[(j * c), $MachinePrecision] * a + N[((-N[(i * N[(j * y), $MachinePrecision]), $MachinePrecision]) + N[(x * N[(N[(y * z), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if i < -5.40000000000000031e88 or 4.2e142 < i

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if -5.40000000000000031e88 < i < 3.8000000000000001e30

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z - a \cdot t\right) \cdot x + a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      4. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z - t \cdot a\right) \cdot x + a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      5. lower-fma.f64 N/A

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

      6. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(y \cdot z - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(c \cdot j\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(c \cdot j\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      13. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      15. associate-*r* N/A

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

      16. lower-*.f64 N/A

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

      17. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z \]

      18. lower-*.f64 58.4

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z \]

   4. Applied rewrites 58.4%

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

   if 3.8000000000000001e30 < i < 4.2e142

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in b around 0

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, -1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]
   6. Step-by-step derivation

      1. lower-+.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, -1 \cdot \left(i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(\mathsf{neg}\left(i \cdot \left(j \cdot y\right)\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      3. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      5. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      7. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      9. lift-*.f64 58.6

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

   7. Applied rewrites 58.6%

      \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(-i \cdot \left(j \cdot y\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 66.6% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{if}\;i \leq -5.4 \cdot 10^{+88}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;i \leq 1.8 \cdot 10^{+144}:\\ \;\;\;\;\mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* i (- (* b t) (* j y)))))
   (if (<= i -5.4e+88)
     t_1
     (if (<= i 1.8e+144)
       (- (fma (- (* z y) (* a t)) x (* (* j c) a)) (* (* c b) z))
       t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -5.4e+88) {
		tmp = t_1;
	} else if (i <= 1.8e+144) {
		tmp = fma(((z * y) - (a * t)), x, ((j * c) * a)) - ((c * b) * z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(i * Float64(Float64(b * t) - Float64(j * y)))
	tmp = 0.0
	if (i <= -5.4e+88)
		tmp = t_1;
	elseif (i <= 1.8e+144)
		tmp = Float64(fma(Float64(Float64(z * y) - Float64(a * t)), x, Float64(Float64(j * c) * a)) - Float64(Float64(c * b) * z));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -5.4e+88], t$95$1, If[LessEqual[i, 1.8e+144], N[(N[(N[(N[(z * y), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision] * x + N[(N[(j * c), $MachinePrecision] * a), $MachinePrecision]), $MachinePrecision] - N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if i < -5.40000000000000031e88 or 1.7999999999999999e144 < i

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if -5.40000000000000031e88 < i < 1.7999999999999999e144

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. lower--.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z - a \cdot t\right) \cdot x + a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      4. *-commutative N/A

         \[\leadsto \left(\left(y \cdot z - t \cdot a\right) \cdot x + a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      5. lower-fma.f64 N/A

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

      6. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(y \cdot z - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - t \cdot a, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      10. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, a \cdot \left(c \cdot j\right)\right) - b \cdot \left(c \cdot z\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(c \cdot j\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      12. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(c \cdot j\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      13. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - b \cdot \left(c \cdot z\right) \]

      15. associate-*r* N/A

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

      16. lower-*.f64 N/A

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

      17. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z \]

      18. lower-*.f64 58.4

          \[\leadsto \mathsf{fma}\left(z \cdot y - a \cdot t, x, \left(j \cdot c\right) \cdot a\right) - \left(c \cdot b\right) \cdot z \]

   4. Applied rewrites 58.4%

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

Alternative 7: 66.2% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \leq -3.7 \cdot 10^{+105}:\\ \;\;\;\;\left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b\\ \mathbf{elif}\;b \leq 3.2 \cdot 10^{-6}:\\ \;\;\;\;\mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(z \cdot y - a \cdot t\right) \cdot x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(i \cdot t - c \cdot z\right) \cdot b\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= b -3.7e+105)
   (* (* z (- (/ (* i t) z) c)) b)
   (if (<= b 3.2e-6)
     (fma (- (* c a) (* i y)) j (* (- (* z y) (* a t)) x))
     (* (- (* i t) (* c z)) b))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (b <= -3.7e+105) {
		tmp = (z * (((i * t) / z) - c)) * b;
	} else if (b <= 3.2e-6) {
		tmp = fma(((c * a) - (i * y)), j, (((z * y) - (a * t)) * x));
	} else {
		tmp = ((i * t) - (c * z)) * b;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (b <= -3.7e+105)
		tmp = Float64(Float64(z * Float64(Float64(Float64(i * t) / z) - c)) * b);
	elseif (b <= 3.2e-6)
		tmp = fma(Float64(Float64(c * a) - Float64(i * y)), j, Float64(Float64(Float64(z * y) - Float64(a * t)) * x));
	else
		tmp = Float64(Float64(Float64(i * t) - Float64(c * z)) * b);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[b, -3.7e+105], N[(N[(z * N[(N[(N[(i * t), $MachinePrecision] / z), $MachinePrecision] - c), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[b, 3.2e-6], N[(N[(N[(c * a), $MachinePrecision] - N[(i * y), $MachinePrecision]), $MachinePrecision] * j + N[(N[(N[(z * y), $MachinePrecision] - N[(a * t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision], N[(N[(N[(i * t), $MachinePrecision] - N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if b < -3.69999999999999985e105

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      2. lower--.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      3. lower-/.f64 N/A

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

      4. lift-*.f64 39.7

         \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   7. Applied rewrites 39.7%

      \[\leadsto \left(z \cdot \left(\frac{i \cdot t}{z} - c\right)\right) \cdot b \]

   if -3.69999999999999985e105 < b < 3.1999999999999999e-6

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around 0

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

      1. *-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(c \cdot a - i \cdot y\right) \cdot j + x \cdot \left(y \cdot z - a \cdot t\right) \]

      3. *-commutative N/A

         \[\leadsto \left(c \cdot a - y \cdot i\right) \cdot j + x \cdot \left(y \cdot z - a \cdot t\right) \]

      4. lower-fma.f64 N/A

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

      5. lift-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot a - y \cdot i, j, x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      6. lift--.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot a - y \cdot i, j, x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, x \cdot \left(y \cdot z - a \cdot t\right)\right) \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(y \cdot z - a \cdot t\right) \cdot x\right) \]

      10. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(y \cdot z - t \cdot a\right) \cdot x\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(y \cdot z - t \cdot a\right) \cdot x\right) \]

      12. lift--.f64 N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(y \cdot z - t \cdot a\right) \cdot x\right) \]

      13. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(z \cdot y - t \cdot a\right) \cdot x\right) \]

      14. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(z \cdot y - t \cdot a\right) \cdot x\right) \]

      15. *-commutative N/A

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(z \cdot y - a \cdot t\right) \cdot x\right) \]

      16. lower-*.f64 60.9

          \[\leadsto \mathsf{fma}\left(c \cdot a - i \cdot y, j, \left(z \cdot y - a \cdot t\right) \cdot x\right) \]

   4. Applied rewrites 60.9%

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

   if 3.1999999999999999e-6 < b

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 8: 59.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-t\right) \cdot \left(a \cdot x - i \cdot b\right)\\ t_2 := j \cdot \left(c \cdot a - y \cdot i\right)\\ \mathbf{if}\;t \leq -2.2 \cdot 10^{-10}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 1.4 \cdot 10^{-297}:\\ \;\;\;\;\left(z \cdot y\right) \cdot x + t\_2\\ \mathbf{elif}\;t \leq 1.32 \cdot 10^{+36}:\\ \;\;\;\;\left(-\left(c \cdot b\right) \cdot z\right) + t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (- t) (- (* a x) (* i b)))) (t_2 (* j (- (* c a) (* y i)))))
   (if (<= t -2.2e-10)
     t_1
     (if (<= t 1.4e-297)
       (+ (* (* z y) x) t_2)
       (if (<= t 1.32e+36) (+ (- (* (* c b) z)) t_2) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = -t * ((a * x) - (i * b));
	double t_2 = j * ((c * a) - (y * i));
	double tmp;
	if (t <= -2.2e-10) {
		tmp = t_1;
	} else if (t <= 1.4e-297) {
		tmp = ((z * y) * x) + t_2;
	} else if (t <= 1.32e+36) {
		tmp = -((c * b) * z) + t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = -t * ((a * x) - (i * b))
    t_2 = j * ((c * a) - (y * i))
    if (t <= (-2.2d-10)) then
        tmp = t_1
    else if (t <= 1.4d-297) then
        tmp = ((z * y) * x) + t_2
    else if (t <= 1.32d+36) then
        tmp = -((c * b) * z) + t_2
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = -t * ((a * x) - (i * b));
	double t_2 = j * ((c * a) - (y * i));
	double tmp;
	if (t <= -2.2e-10) {
		tmp = t_1;
	} else if (t <= 1.4e-297) {
		tmp = ((z * y) * x) + t_2;
	} else if (t <= 1.32e+36) {
		tmp = -((c * b) * z) + t_2;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = -t * ((a * x) - (i * b))
	t_2 = j * ((c * a) - (y * i))
	tmp = 0
	if t <= -2.2e-10:
		tmp = t_1
	elif t <= 1.4e-297:
		tmp = ((z * y) * x) + t_2
	elif t <= 1.32e+36:
		tmp = -((c * b) * z) + t_2
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(-t) * Float64(Float64(a * x) - Float64(i * b)))
	t_2 = Float64(j * Float64(Float64(c * a) - Float64(y * i)))
	tmp = 0.0
	if (t <= -2.2e-10)
		tmp = t_1;
	elseif (t <= 1.4e-297)
		tmp = Float64(Float64(Float64(z * y) * x) + t_2);
	elseif (t <= 1.32e+36)
		tmp = Float64(Float64(-Float64(Float64(c * b) * z)) + t_2);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = -t * ((a * x) - (i * b));
	t_2 = j * ((c * a) - (y * i));
	tmp = 0.0;
	if (t <= -2.2e-10)
		tmp = t_1;
	elseif (t <= 1.4e-297)
		tmp = ((z * y) * x) + t_2;
	elseif (t <= 1.32e+36)
		tmp = -((c * b) * z) + t_2;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[((-t) * N[(N[(a * x), $MachinePrecision] - N[(i * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.2e-10], t$95$1, If[LessEqual[t, 1.4e-297], N[(N[(N[(z * y), $MachinePrecision] * x), $MachinePrecision] + t$95$2), $MachinePrecision], If[LessEqual[t, 1.32e+36], N[((-N[(N[(c * b), $MachinePrecision] * z), $MachinePrecision]) + t$95$2), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.1999999999999999e-10 or 1.3200000000000001e36 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in t around -inf

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot t\right) \cdot \color{blue}{\left(a \cdot x - b \cdot i\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot t\right) \cdot \color{blue}{\left(a \cdot x - b \cdot i\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(t\right)\right) \cdot \left(\color{blue}{a \cdot x} - b \cdot i\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(\color{blue}{a \cdot x} - b \cdot i\right) \]

      5. lower--.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - \color{blue}{b \cdot i}\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - \color{blue}{b} \cdot i\right) \]

      7. *-commutative N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - i \cdot \color{blue}{b}\right) \]

      8. lower-*.f64 38.6

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - i \cdot \color{blue}{b}\right) \]

   4. Applied rewrites 38.6%

      \[\leadsto \color{blue}{\left(-t\right) \cdot \left(a \cdot x - i \cdot b\right)} \]

   if -2.1999999999999999e-10 < t < 1.39999999999999992e-297

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot x + j \cdot \left(c \cdot a - y \cdot i\right) \]

      4. lower-*.f64 50.2

         \[\leadsto \left(z \cdot y\right) \cdot x + j \cdot \left(c \cdot a - y \cdot i\right) \]

   4. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

   if 1.39999999999999992e-297 < t < 1.3200000000000001e36

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{-1 \cdot \left(b \cdot \left(c \cdot z\right)\right)} + j \cdot \left(c \cdot a - y \cdot i\right) \]
   3. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(b \cdot \left(c \cdot z\right)\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      2. lower-neg.f64 N/A

         \[\leadsto \left(-b \cdot \left(c \cdot z\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      3. associate-*r* N/A

         \[\leadsto \left(-\left(b \cdot c\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-\left(b \cdot c\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      5. *-commutative N/A

         \[\leadsto \left(-\left(c \cdot b\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

      6. lower-*.f64 51.8

         \[\leadsto \left(-\left(c \cdot b\right) \cdot z\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   4. Applied rewrites 51.8%

      \[\leadsto \color{blue}{\left(-\left(c \cdot b\right) \cdot z\right)} + j \cdot \left(c \cdot a - y \cdot i\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 56.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(-t\right) \cdot \left(a \cdot x - i \cdot b\right)\\ \mathbf{if}\;t \leq -2.2 \cdot 10^{-10}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{-171}:\\ \;\;\;\;\left(z \cdot y\right) \cdot x + j \cdot \left(c \cdot a - y \cdot i\right)\\ \mathbf{elif}\;t \leq 2.75 \cdot 10^{+34}:\\ \;\;\;\;\left(y \cdot x - c \cdot b\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (- t) (- (* a x) (* i b)))))
   (if (<= t -2.2e-10)
     t_1
     (if (<= t 2.7e-171)
       (+ (* (* z y) x) (* j (- (* c a) (* y i))))
       (if (<= t 2.75e+34) (* (- (* y x) (* c b)) z) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = -t * ((a * x) - (i * b));
	double tmp;
	if (t <= -2.2e-10) {
		tmp = t_1;
	} else if (t <= 2.7e-171) {
		tmp = ((z * y) * x) + (j * ((c * a) - (y * i)));
	} else if (t <= 2.75e+34) {
		tmp = ((y * x) - (c * b)) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: tmp
    t_1 = -t * ((a * x) - (i * b))
    if (t <= (-2.2d-10)) then
        tmp = t_1
    else if (t <= 2.7d-171) then
        tmp = ((z * y) * x) + (j * ((c * a) - (y * i)))
    else if (t <= 2.75d+34) then
        tmp = ((y * x) - (c * b)) * z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = -t * ((a * x) - (i * b));
	double tmp;
	if (t <= -2.2e-10) {
		tmp = t_1;
	} else if (t <= 2.7e-171) {
		tmp = ((z * y) * x) + (j * ((c * a) - (y * i)));
	} else if (t <= 2.75e+34) {
		tmp = ((y * x) - (c * b)) * z;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = -t * ((a * x) - (i * b))
	tmp = 0
	if t <= -2.2e-10:
		tmp = t_1
	elif t <= 2.7e-171:
		tmp = ((z * y) * x) + (j * ((c * a) - (y * i)))
	elif t <= 2.75e+34:
		tmp = ((y * x) - (c * b)) * z
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(-t) * Float64(Float64(a * x) - Float64(i * b)))
	tmp = 0.0
	if (t <= -2.2e-10)
		tmp = t_1;
	elseif (t <= 2.7e-171)
		tmp = Float64(Float64(Float64(z * y) * x) + Float64(j * Float64(Float64(c * a) - Float64(y * i))));
	elseif (t <= 2.75e+34)
		tmp = Float64(Float64(Float64(y * x) - Float64(c * b)) * z);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = -t * ((a * x) - (i * b));
	tmp = 0.0;
	if (t <= -2.2e-10)
		tmp = t_1;
	elseif (t <= 2.7e-171)
		tmp = ((z * y) * x) + (j * ((c * a) - (y * i)));
	elseif (t <= 2.75e+34)
		tmp = ((y * x) - (c * b)) * z;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[((-t) * N[(N[(a * x), $MachinePrecision] - N[(i * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -2.2e-10], t$95$1, If[LessEqual[t, 2.7e-171], N[(N[(N[(z * y), $MachinePrecision] * x), $MachinePrecision] + N[(j * N[(N[(c * a), $MachinePrecision] - N[(y * i), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t, 2.75e+34], N[(N[(N[(y * x), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if t < -2.1999999999999999e-10 or 2.7499999999999998e34 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in t around -inf

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

      1. associate-*r* N/A

         \[\leadsto \left(-1 \cdot t\right) \cdot \color{blue}{\left(a \cdot x - b \cdot i\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot t\right) \cdot \color{blue}{\left(a \cdot x - b \cdot i\right)} \]

      3. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(t\right)\right) \cdot \left(\color{blue}{a \cdot x} - b \cdot i\right) \]

      4. lower-neg.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(\color{blue}{a \cdot x} - b \cdot i\right) \]

      5. lower--.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - \color{blue}{b \cdot i}\right) \]

      6. lower-*.f64 N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - \color{blue}{b} \cdot i\right) \]

      7. *-commutative N/A

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - i \cdot \color{blue}{b}\right) \]

      8. lower-*.f64 38.6

         \[\leadsto \left(-t\right) \cdot \left(a \cdot x - i \cdot \color{blue}{b}\right) \]

   4. Applied rewrites 38.6%

      \[\leadsto \color{blue}{\left(-t\right) \cdot \left(a \cdot x - i \cdot b\right)} \]

   if -2.1999999999999999e-10 < t < 2.70000000000000014e-171

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

      2. lower-*.f64 N/A

         \[\leadsto \left(y \cdot z\right) \cdot \color{blue}{x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

      3. *-commutative N/A

         \[\leadsto \left(z \cdot y\right) \cdot x + j \cdot \left(c \cdot a - y \cdot i\right) \]

      4. lower-*.f64 50.2

         \[\leadsto \left(z \cdot y\right) \cdot x + j \cdot \left(c \cdot a - y \cdot i\right) \]

   4. Applied rewrites 50.2%

      \[\leadsto \color{blue}{\left(z \cdot y\right) \cdot x} + j \cdot \left(c \cdot a - y \cdot i\right) \]

   if 2.70000000000000014e-171 < t < 2.7499999999999998e34

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(x \cdot y - b \cdot c\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot z \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      6. *-commutative N/A

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

      7. lower-*.f64 39.6

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

   4. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(y \cdot x - c \cdot b\right) \cdot z} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 10: 53.9% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -0.0074:\\ \;\;\;\;x \cdot \left(a \cdot \left(\frac{c \cdot j}{x} - t\right)\right)\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-301}:\\ \;\;\;\;\left(i \cdot t - c \cdot z\right) \cdot b\\ \mathbf{elif}\;a \leq 1.62 \cdot 10^{-152}:\\ \;\;\;\;\left(y \cdot x - c \cdot b\right) \cdot z\\ \mathbf{elif}\;a \leq 2.3 \cdot 10^{-108}:\\ \;\;\;\;i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{elif}\;a \leq 1.6 \cdot 10^{+97}:\\ \;\;\;\;\left(j \cdot a - b \cdot z\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= a -0.0074)
   (* x (* a (- (/ (* c j) x) t)))
   (if (<= a -8e-301)
     (* (- (* i t) (* c z)) b)
     (if (<= a 1.62e-152)
       (* (- (* y x) (* c b)) z)
       (if (<= a 2.3e-108)
         (* i (- (* b t) (* j y)))
         (if (<= a 1.6e+97)
           (* (- (* j a) (* b z)) c)
           (* (fma (- t) x (* j c)) a)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (a <= -0.0074) {
		tmp = x * (a * (((c * j) / x) - t));
	} else if (a <= -8e-301) {
		tmp = ((i * t) - (c * z)) * b;
	} else if (a <= 1.62e-152) {
		tmp = ((y * x) - (c * b)) * z;
	} else if (a <= 2.3e-108) {
		tmp = i * ((b * t) - (j * y));
	} else if (a <= 1.6e+97) {
		tmp = ((j * a) - (b * z)) * c;
	} else {
		tmp = fma(-t, x, (j * c)) * a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (a <= -0.0074)
		tmp = Float64(x * Float64(a * Float64(Float64(Float64(c * j) / x) - t)));
	elseif (a <= -8e-301)
		tmp = Float64(Float64(Float64(i * t) - Float64(c * z)) * b);
	elseif (a <= 1.62e-152)
		tmp = Float64(Float64(Float64(y * x) - Float64(c * b)) * z);
	elseif (a <= 2.3e-108)
		tmp = Float64(i * Float64(Float64(b * t) - Float64(j * y)));
	elseif (a <= 1.6e+97)
		tmp = Float64(Float64(Float64(j * a) - Float64(b * z)) * c);
	else
		tmp = Float64(fma(Float64(-t), x, Float64(j * c)) * a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[a, -0.0074], N[(x * N[(a * N[(N[(N[(c * j), $MachinePrecision] / x), $MachinePrecision] - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, -8e-301], N[(N[(N[(i * t), $MachinePrecision] - N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[a, 1.62e-152], N[(N[(N[(y * x), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[a, 2.3e-108], N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.6e+97], N[(N[(N[(j * a), $MachinePrecision] - N[(b * z), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], N[(N[((-t) * x + N[(j * c), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]]]]]]

Derivation

1. Split input into 6 regimes

2. if a < -0.0074000000000000003

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      8. lower-*.f64 36.0

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

   7. Applied rewrites 36.0%

      \[\leadsto x \cdot \color{blue}{\left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right)} \]

   8. Taylor expanded in a around 0

      \[\leadsto x \cdot \left(a \cdot \left(\frac{c \cdot j}{x} - \color{blue}{t}\right)\right) \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 38.7

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

   10. Applied rewrites 38.7%

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

   if -0.0074000000000000003 < a < -8.00000000000000053e-301

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   if -8.00000000000000053e-301 < a < 1.61999999999999995e-152

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(x \cdot y - b \cdot c\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot z \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      6. *-commutative N/A

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

      7. lower-*.f64 39.6

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

   4. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(y \cdot x - c \cdot b\right) \cdot z} \]

   if 1.61999999999999995e-152 < a < 2.29999999999999996e-108

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if 2.29999999999999996e-108 < a < 1.60000000000000008e97

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{c \cdot \left(a \cdot j - b \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      3. lower--.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot c \]

      4. *-commutative N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      5. lower-*.f64 N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      6. lower-*.f64 39.4

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

   4. Applied rewrites 39.4%

      \[\leadsto \color{blue}{\left(j \cdot a - b \cdot z\right) \cdot c} \]

   if 1.60000000000000008e97 < a

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

Alternative 11: 51.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a\\ \mathbf{if}\;a \leq -0.0074:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq -8 \cdot 10^{-301}:\\ \;\;\;\;\left(i \cdot t - c \cdot z\right) \cdot b\\ \mathbf{elif}\;a \leq 1.62 \cdot 10^{-152}:\\ \;\;\;\;\left(y \cdot x - c \cdot b\right) \cdot z\\ \mathbf{elif}\;a \leq 2.3 \cdot 10^{-108}:\\ \;\;\;\;i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{elif}\;a \leq 1.6 \cdot 10^{+97}:\\ \;\;\;\;\left(j \cdot a - b \cdot z\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (fma (- t) x (* j c)) a)))
   (if (<= a -0.0074)
     t_1
     (if (<= a -8e-301)
       (* (- (* i t) (* c z)) b)
       (if (<= a 1.62e-152)
         (* (- (* y x) (* c b)) z)
         (if (<= a 2.3e-108)
           (* i (- (* b t) (* j y)))
           (if (<= a 1.6e+97) (* (- (* j a) (* b z)) c) t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = fma(-t, x, (j * c)) * a;
	double tmp;
	if (a <= -0.0074) {
		tmp = t_1;
	} else if (a <= -8e-301) {
		tmp = ((i * t) - (c * z)) * b;
	} else if (a <= 1.62e-152) {
		tmp = ((y * x) - (c * b)) * z;
	} else if (a <= 2.3e-108) {
		tmp = i * ((b * t) - (j * y));
	} else if (a <= 1.6e+97) {
		tmp = ((j * a) - (b * z)) * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(fma(Float64(-t), x, Float64(j * c)) * a)
	tmp = 0.0
	if (a <= -0.0074)
		tmp = t_1;
	elseif (a <= -8e-301)
		tmp = Float64(Float64(Float64(i * t) - Float64(c * z)) * b);
	elseif (a <= 1.62e-152)
		tmp = Float64(Float64(Float64(y * x) - Float64(c * b)) * z);
	elseif (a <= 2.3e-108)
		tmp = Float64(i * Float64(Float64(b * t) - Float64(j * y)));
	elseif (a <= 1.6e+97)
		tmp = Float64(Float64(Float64(j * a) - Float64(b * z)) * c);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[((-t) * x + N[(j * c), $MachinePrecision]), $MachinePrecision] * a), $MachinePrecision]}, If[LessEqual[a, -0.0074], t$95$1, If[LessEqual[a, -8e-301], N[(N[(N[(i * t), $MachinePrecision] - N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[a, 1.62e-152], N[(N[(N[(y * x), $MachinePrecision] - N[(c * b), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[a, 2.3e-108], N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.6e+97], N[(N[(N[(j * a), $MachinePrecision] - N[(b * z), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 5 regimes

2. if a < -0.0074000000000000003 or 1.60000000000000008e97 < a

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   if -0.0074000000000000003 < a < -8.00000000000000053e-301

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   if -8.00000000000000053e-301 < a < 1.61999999999999995e-152

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(x \cdot y - b \cdot c\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot z \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      6. *-commutative N/A

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

      7. lower-*.f64 39.6

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

   4. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(y \cdot x - c \cdot b\right) \cdot z} \]

   if 1.61999999999999995e-152 < a < 2.29999999999999996e-108

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if 2.29999999999999996e-108 < a < 1.60000000000000008e97

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{c \cdot \left(a \cdot j - b \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      3. lower--.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot c \]

      4. *-commutative N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      5. lower-*.f64 N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      6. lower-*.f64 39.4

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

   4. Applied rewrites 39.4%

      \[\leadsto \color{blue}{\left(j \cdot a - b \cdot z\right) \cdot c} \]
3. Recombined 5 regimes into one program.
4. Add Preprocessing

Alternative 12: 51.2% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(j \cdot a - b \cdot z\right) \cdot c\\ \mathbf{if}\;c \leq -3 \cdot 10^{-112}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;c \leq -4 \cdot 10^{-308}:\\ \;\;\;\;i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{elif}\;c \leq 4.2 \cdot 10^{-70}:\\ \;\;\;\;\mathsf{fma}\left(-i, j, z \cdot x\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (- (* j a) (* b z)) c)))
   (if (<= c -3e-112)
     t_1
     (if (<= c -4e-308)
       (* i (- (* b t) (* j y)))
       (if (<= c 4.2e-70) (* (fma (- i) j (* z x)) y) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((j * a) - (b * z)) * c;
	double tmp;
	if (c <= -3e-112) {
		tmp = t_1;
	} else if (c <= -4e-308) {
		tmp = i * ((b * t) - (j * y));
	} else if (c <= 4.2e-70) {
		tmp = fma(-i, j, (z * x)) * y;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(Float64(j * a) - Float64(b * z)) * c)
	tmp = 0.0
	if (c <= -3e-112)
		tmp = t_1;
	elseif (c <= -4e-308)
		tmp = Float64(i * Float64(Float64(b * t) - Float64(j * y)));
	elseif (c <= 4.2e-70)
		tmp = Float64(fma(Float64(-i), j, Float64(z * x)) * y);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(N[(j * a), $MachinePrecision] - N[(b * z), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision]}, If[LessEqual[c, -3e-112], t$95$1, If[LessEqual[c, -4e-308], N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[c, 4.2e-70], N[(N[((-i) * j + N[(z * x), $MachinePrecision]), $MachinePrecision] * y), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if c < -3.0000000000000001e-112 or 4.2000000000000002e-70 < c

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{c \cdot \left(a \cdot j - b \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      3. lower--.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot c \]

      4. *-commutative N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      5. lower-*.f64 N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      6. lower-*.f64 39.4

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

   4. Applied rewrites 39.4%

      \[\leadsto \color{blue}{\left(j \cdot a - b \cdot z\right) \cdot c} \]

   if -3.0000000000000001e-112 < c < -4.00000000000000013e-308

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if -4.00000000000000013e-308 < c < 4.2000000000000002e-70

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in y around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(i \cdot j\right) + x \cdot z\right) \cdot \color{blue}{y} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(i \cdot j\right) + x \cdot z\right) \cdot \color{blue}{y} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot i\right) \cdot j + x \cdot z\right) \cdot y \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot i, j, x \cdot z\right) \cdot y \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(i\right), j, x \cdot z\right) \cdot y \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-i, j, x \cdot z\right) \cdot y \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-i, j, z \cdot x\right) \cdot y \]

      8. lower-*.f64 40.1

         \[\leadsto \mathsf{fma}\left(-i, j, z \cdot x\right) \cdot y \]

   4. Applied rewrites 40.1%

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

Alternative 13: 50.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{if}\;i \leq -2 \cdot 10^{+37}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;i \leq 2.7 \cdot 10^{+35}:\\ \;\;\;\;\left(j \cdot a - b \cdot z\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* i (- (* b t) (* j y)))))
   (if (<= i -2e+37) t_1 (if (<= i 2.7e+35) (* (- (* j a) (* b z)) c) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -2e+37) {
		tmp = t_1;
	} else if (i <= 2.7e+35) {
		tmp = ((j * a) - (b * z)) * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: tmp
    t_1 = i * ((b * t) - (j * y))
    if (i <= (-2d+37)) then
        tmp = t_1
    else if (i <= 2.7d+35) then
        tmp = ((j * a) - (b * z)) * c
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -2e+37) {
		tmp = t_1;
	} else if (i <= 2.7e+35) {
		tmp = ((j * a) - (b * z)) * c;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = i * ((b * t) - (j * y))
	tmp = 0
	if i <= -2e+37:
		tmp = t_1
	elif i <= 2.7e+35:
		tmp = ((j * a) - (b * z)) * c
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(i * Float64(Float64(b * t) - Float64(j * y)))
	tmp = 0.0
	if (i <= -2e+37)
		tmp = t_1;
	elseif (i <= 2.7e+35)
		tmp = Float64(Float64(Float64(j * a) - Float64(b * z)) * c);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = i * ((b * t) - (j * y));
	tmp = 0.0;
	if (i <= -2e+37)
		tmp = t_1;
	elseif (i <= 2.7e+35)
		tmp = ((j * a) - (b * z)) * c;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -2e+37], t$95$1, If[LessEqual[i, 2.7e+35], N[(N[(N[(j * a), $MachinePrecision] - N[(b * z), $MachinePrecision]), $MachinePrecision] * c), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if i < -1.99999999999999991e37 or 2.70000000000000003e35 < i

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if -1.99999999999999991e37 < i < 2.70000000000000003e35

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in c around inf

      \[\leadsto \color{blue}{c \cdot \left(a \cdot j - b \cdot z\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot \color{blue}{c} \]

      3. lower--.f64 N/A

         \[\leadsto \left(a \cdot j - b \cdot z\right) \cdot c \]

      4. *-commutative N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      5. lower-*.f64 N/A

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

      6. lower-*.f64 39.4

         \[\leadsto \left(j \cdot a - b \cdot z\right) \cdot c \]

   4. Applied rewrites 39.4%

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

Alternative 14: 42.8% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(i \cdot t - c \cdot z\right) \cdot b\\ \mathbf{if}\;b \leq -5.6 \cdot 10^{-143}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;b \leq 9.2 \cdot 10^{-7}:\\ \;\;\;\;x \cdot \left(-1 \cdot \left(a \cdot t\right)\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (- (* i t) (* c z)) b)))
   (if (<= b -5.6e-143) t_1 (if (<= b 9.2e-7) (* x (* -1.0 (* a t))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((i * t) - (c * z)) * b;
	double tmp;
	if (b <= -5.6e-143) {
		tmp = t_1;
	} else if (b <= 9.2e-7) {
		tmp = x * (-1.0 * (a * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((i * t) - (c * z)) * b
    if (b <= (-5.6d-143)) then
        tmp = t_1
    else if (b <= 9.2d-7) then
        tmp = x * ((-1.0d0) * (a * t))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = ((i * t) - (c * z)) * b;
	double tmp;
	if (b <= -5.6e-143) {
		tmp = t_1;
	} else if (b <= 9.2e-7) {
		tmp = x * (-1.0 * (a * t));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = ((i * t) - (c * z)) * b
	tmp = 0
	if b <= -5.6e-143:
		tmp = t_1
	elif b <= 9.2e-7:
		tmp = x * (-1.0 * (a * t))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(Float64(i * t) - Float64(c * z)) * b)
	tmp = 0.0
	if (b <= -5.6e-143)
		tmp = t_1;
	elseif (b <= 9.2e-7)
		tmp = Float64(x * Float64(-1.0 * Float64(a * t)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = ((i * t) - (c * z)) * b;
	tmp = 0.0;
	if (b <= -5.6e-143)
		tmp = t_1;
	elseif (b <= 9.2e-7)
		tmp = x * (-1.0 * (a * t));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(N[(i * t), $MachinePrecision] - N[(c * z), $MachinePrecision]), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[b, -5.6e-143], t$95$1, If[LessEqual[b, 9.2e-7], N[(x * N[(-1.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if b < -5.5999999999999997e-143 or 9.1999999999999998e-7 < b

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   if -5.5999999999999997e-143 < b < 9.1999999999999998e-7

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      8. lower-*.f64 36.0

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

   7. Applied rewrites 36.0%

      \[\leadsto x \cdot \color{blue}{\left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right)} \]

   8. Taylor expanded in x around inf

      \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot \color{blue}{t}\right)\right) \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

      2. lift-*.f64 22.1

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

   10. Applied rewrites 22.1%

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

Alternative 15: 42.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := i \cdot \left(b \cdot t - j \cdot y\right)\\ \mathbf{if}\;i \leq -1.7 \cdot 10^{+22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;i \leq 1.55 \cdot 10^{+36}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* i (- (* b t) (* j y)))))
   (if (<= i -1.7e+22) t_1 (if (<= i 1.55e+36) (* (* c j) a) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -1.7e+22) {
		tmp = t_1;
	} else if (i <= 1.55e+36) {
		tmp = (c * j) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: tmp
    t_1 = i * ((b * t) - (j * y))
    if (i <= (-1.7d+22)) then
        tmp = t_1
    else if (i <= 1.55d+36) then
        tmp = (c * j) * a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = i * ((b * t) - (j * y));
	double tmp;
	if (i <= -1.7e+22) {
		tmp = t_1;
	} else if (i <= 1.55e+36) {
		tmp = (c * j) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = i * ((b * t) - (j * y))
	tmp = 0
	if i <= -1.7e+22:
		tmp = t_1
	elif i <= 1.55e+36:
		tmp = (c * j) * a
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(i * Float64(Float64(b * t) - Float64(j * y)))
	tmp = 0.0
	if (i <= -1.7e+22)
		tmp = t_1;
	elseif (i <= 1.55e+36)
		tmp = Float64(Float64(c * j) * a);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = i * ((b * t) - (j * y));
	tmp = 0.0;
	if (i <= -1.7e+22)
		tmp = t_1;
	elseif (i <= 1.55e+36)
		tmp = (c * j) * a;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(i * N[(N[(b * t), $MachinePrecision] - N[(j * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[i, -1.7e+22], t$95$1, If[LessEqual[i, 1.55e+36], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if i < -1.7e22 or 1.55e36 < i

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in i around 0

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

      1. associate--l+ N/A

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

      2. *-commutative N/A

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

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot j, \color{blue}{a}, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      5. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

      6. lower--.f64 N/A

         \[\leadsto \mathsf{fma}\left(j \cdot c, a, \left(i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right) + x \cdot \left(y \cdot z - a \cdot t\right)\right) - b \cdot \left(c \cdot z\right)\right) \]

   4. Applied rewrites 74.5%

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

   5. Taylor expanded in i around inf

      \[\leadsto \color{blue}{i \cdot \left(-1 \cdot \left(j \cdot y\right) - -1 \cdot \left(b \cdot t\right)\right)} \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto i \cdot \left(-1 \cdot \left(j \cdot y\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto i \cdot \left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(\color{blue}{b \cdot t}\right)\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto i \cdot \color{blue}{\left(\left(\mathsf{neg}\left(j \cdot y\right)\right) - \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)} \]

      4. add-negate-rev N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y + \left(\mathsf{neg}\left(b \cdot t\right)\right)\right)\right)\right) \]

      5. sub-flip N/A

         \[\leadsto i \cdot \left(\mathsf{neg}\left(\left(j \cdot y - b \cdot t\right)\right)\right) \]

      6. sub-negate-rev N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      7. lower--.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j \cdot y}\right) \]

      8. lift-*.f64 N/A

         \[\leadsto i \cdot \left(b \cdot t - \color{blue}{j} \cdot y\right) \]

      9. lift-*.f64 39.8

         \[\leadsto i \cdot \left(b \cdot t - j \cdot \color{blue}{y}\right) \]

   7. Applied rewrites 39.8%

      \[\leadsto \color{blue}{i \cdot \left(b \cdot t - j \cdot y\right)} \]

   if -1.7e22 < i < 1.55e36

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

Alternative 16: 30.1% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.95 \cdot 10^{-109}:\\ \;\;\;\;\left(i \cdot t\right) \cdot b\\ \mathbf{elif}\;t \leq 5.8 \cdot 10^{-177}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{elif}\;t \leq 4.4 \cdot 10^{+42}:\\ \;\;\;\;\left(-1 \cdot \left(b \cdot c\right)\right) \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-1 \cdot \left(a \cdot t\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= t -1.95e-109)
   (* (* i t) b)
   (if (<= t 5.8e-177)
     (* (* c j) a)
     (if (<= t 4.4e+42) (* (* -1.0 (* b c)) z) (* x (* -1.0 (* a t)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 4.4e+42) {
		tmp = (-1.0 * (b * c)) * z;
	} else {
		tmp = x * (-1.0 * (a * t));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: tmp
    if (t <= (-1.95d-109)) then
        tmp = (i * t) * b
    else if (t <= 5.8d-177) then
        tmp = (c * j) * a
    else if (t <= 4.4d+42) then
        tmp = ((-1.0d0) * (b * c)) * z
    else
        tmp = x * ((-1.0d0) * (a * t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 4.4e+42) {
		tmp = (-1.0 * (b * c)) * z;
	} else {
		tmp = x * (-1.0 * (a * t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	tmp = 0
	if t <= -1.95e-109:
		tmp = (i * t) * b
	elif t <= 5.8e-177:
		tmp = (c * j) * a
	elif t <= 4.4e+42:
		tmp = (-1.0 * (b * c)) * z
	else:
		tmp = x * (-1.0 * (a * t))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (t <= -1.95e-109)
		tmp = Float64(Float64(i * t) * b);
	elseif (t <= 5.8e-177)
		tmp = Float64(Float64(c * j) * a);
	elseif (t <= 4.4e+42)
		tmp = Float64(Float64(-1.0 * Float64(b * c)) * z);
	else
		tmp = Float64(x * Float64(-1.0 * Float64(a * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0;
	if (t <= -1.95e-109)
		tmp = (i * t) * b;
	elseif (t <= 5.8e-177)
		tmp = (c * j) * a;
	elseif (t <= 4.4e+42)
		tmp = (-1.0 * (b * c)) * z;
	else
		tmp = x * (-1.0 * (a * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[t, -1.95e-109], N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t, 5.8e-177], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 4.4e+42], N[(N[(-1.0 * N[(b * c), $MachinePrecision]), $MachinePrecision] * z), $MachinePrecision], N[(x * N[(-1.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if t < -1.95000000000000011e-109

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around 0

      \[\leadsto \left(i \cdot t\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 21.9

         \[\leadsto \left(i \cdot t\right) \cdot b \]

   7. Applied rewrites 21.9%

      \[\leadsto \left(i \cdot t\right) \cdot b \]

   if -1.95000000000000011e-109 < t < 5.79999999999999994e-177

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

   if 5.79999999999999994e-177 < t < 4.4000000000000003e42

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{z \cdot \left(x \cdot y - b \cdot c\right)} \]
   3. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot \color{blue}{z} \]

      3. lower--.f64 N/A

         \[\leadsto \left(x \cdot y - b \cdot c\right) \cdot z \]

      4. *-commutative N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \left(y \cdot x - b \cdot c\right) \cdot z \]

      6. *-commutative N/A

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

      7. lower-*.f64 39.6

         \[\leadsto \left(y \cdot x - c \cdot b\right) \cdot z \]

   4. Applied rewrites 39.6%

      \[\leadsto \color{blue}{\left(y \cdot x - c \cdot b\right) \cdot z} \]

   5. Taylor expanded in x around 0

      \[\leadsto \left(-1 \cdot \left(b \cdot c\right)\right) \cdot z \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(b \cdot c\right)\right) \cdot z \]

      2. lower-*.f64 23.0

         \[\leadsto \left(-1 \cdot \left(b \cdot c\right)\right) \cdot z \]

   7. Applied rewrites 23.0%

      \[\leadsto \left(-1 \cdot \left(b \cdot c\right)\right) \cdot z \]

   if 4.4000000000000003e42 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      8. lower-*.f64 36.0

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

   7. Applied rewrites 36.0%

      \[\leadsto x \cdot \color{blue}{\left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right)} \]

   8. Taylor expanded in x around inf

      \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot \color{blue}{t}\right)\right) \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

      2. lift-*.f64 22.1

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

   10. Applied rewrites 22.1%

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

Alternative 17: 29.4% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.95 \cdot 10^{-109}:\\ \;\;\;\;\left(i \cdot t\right) \cdot b\\ \mathbf{elif}\;t \leq 5.8 \cdot 10^{-177}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{+42}:\\ \;\;\;\;\left(-c \cdot z\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(-1 \cdot \left(a \cdot t\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= t -1.95e-109)
   (* (* i t) b)
   (if (<= t 5.8e-177)
     (* (* c j) a)
     (if (<= t 2.7e+42) (* (- (* c z)) b) (* x (* -1.0 (* a t)))))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 2.7e+42) {
		tmp = -(c * z) * b;
	} else {
		tmp = x * (-1.0 * (a * t));
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: tmp
    if (t <= (-1.95d-109)) then
        tmp = (i * t) * b
    else if (t <= 5.8d-177) then
        tmp = (c * j) * a
    else if (t <= 2.7d+42) then
        tmp = -(c * z) * b
    else
        tmp = x * ((-1.0d0) * (a * t))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 2.7e+42) {
		tmp = -(c * z) * b;
	} else {
		tmp = x * (-1.0 * (a * t));
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	tmp = 0
	if t <= -1.95e-109:
		tmp = (i * t) * b
	elif t <= 5.8e-177:
		tmp = (c * j) * a
	elif t <= 2.7e+42:
		tmp = -(c * z) * b
	else:
		tmp = x * (-1.0 * (a * t))
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (t <= -1.95e-109)
		tmp = Float64(Float64(i * t) * b);
	elseif (t <= 5.8e-177)
		tmp = Float64(Float64(c * j) * a);
	elseif (t <= 2.7e+42)
		tmp = Float64(Float64(-Float64(c * z)) * b);
	else
		tmp = Float64(x * Float64(-1.0 * Float64(a * t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0;
	if (t <= -1.95e-109)
		tmp = (i * t) * b;
	elseif (t <= 5.8e-177)
		tmp = (c * j) * a;
	elseif (t <= 2.7e+42)
		tmp = -(c * z) * b;
	else
		tmp = x * (-1.0 * (a * t));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[t, -1.95e-109], N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t, 5.8e-177], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 2.7e+42], N[((-N[(c * z), $MachinePrecision]) * b), $MachinePrecision], N[(x * N[(-1.0 * N[(a * t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if t < -1.95000000000000011e-109

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around 0

      \[\leadsto \left(i \cdot t\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 21.9

         \[\leadsto \left(i \cdot t\right) \cdot b \]

   7. Applied rewrites 21.9%

      \[\leadsto \left(i \cdot t\right) \cdot b \]

   if -1.95000000000000011e-109 < t < 5.79999999999999994e-177

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

   if 5.79999999999999994e-177 < t < 2.7000000000000001e42

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(-1 \cdot \left(c \cdot z\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(c \cdot z\right)\right) \cdot b \]

      2. lower-neg.f64 N/A

         \[\leadsto \left(-c \cdot z\right) \cdot b \]

      3. lift-*.f64 22.8

         \[\leadsto \left(-c \cdot z\right) \cdot b \]

   7. Applied rewrites 22.8%

      \[\leadsto \left(-c \cdot z\right) \cdot b \]

   if 2.7000000000000001e42 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      6. lower-/.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      7. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

      8. lower-*.f64 36.0

         \[\leadsto x \cdot \left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right) \]

   7. Applied rewrites 36.0%

      \[\leadsto x \cdot \color{blue}{\left(\left(-a \cdot t\right) + \frac{a \cdot \left(c \cdot j\right)}{x}\right)} \]

   8. Taylor expanded in x around inf

      \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot \color{blue}{t}\right)\right) \]
   9. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

      2. lift-*.f64 22.1

         \[\leadsto x \cdot \left(-1 \cdot \left(a \cdot t\right)\right) \]

   10. Applied rewrites 22.1%

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

Alternative 18: 29.0% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.95 \cdot 10^{-109}:\\ \;\;\;\;\left(i \cdot t\right) \cdot b\\ \mathbf{elif}\;t \leq 5.8 \cdot 10^{-177}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{elif}\;t \leq 2.7 \cdot 10^{+42}:\\ \;\;\;\;\left(-c \cdot z\right) \cdot b\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-t\right) \cdot x\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= t -1.95e-109)
   (* (* i t) b)
   (if (<= t 5.8e-177)
     (* (* c j) a)
     (if (<= t 2.7e+42) (* (- (* c z)) b) (* (* (- t) x) a)))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 2.7e+42) {
		tmp = -(c * z) * b;
	} else {
		tmp = (-t * x) * a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: tmp
    if (t <= (-1.95d-109)) then
        tmp = (i * t) * b
    else if (t <= 5.8d-177) then
        tmp = (c * j) * a
    else if (t <= 2.7d+42) then
        tmp = -(c * z) * b
    else
        tmp = (-t * x) * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 5.8e-177) {
		tmp = (c * j) * a;
	} else if (t <= 2.7e+42) {
		tmp = -(c * z) * b;
	} else {
		tmp = (-t * x) * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	tmp = 0
	if t <= -1.95e-109:
		tmp = (i * t) * b
	elif t <= 5.8e-177:
		tmp = (c * j) * a
	elif t <= 2.7e+42:
		tmp = -(c * z) * b
	else:
		tmp = (-t * x) * a
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (t <= -1.95e-109)
		tmp = Float64(Float64(i * t) * b);
	elseif (t <= 5.8e-177)
		tmp = Float64(Float64(c * j) * a);
	elseif (t <= 2.7e+42)
		tmp = Float64(Float64(-Float64(c * z)) * b);
	else
		tmp = Float64(Float64(Float64(-t) * x) * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0;
	if (t <= -1.95e-109)
		tmp = (i * t) * b;
	elseif (t <= 5.8e-177)
		tmp = (c * j) * a;
	elseif (t <= 2.7e+42)
		tmp = -(c * z) * b;
	else
		tmp = (-t * x) * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[t, -1.95e-109], N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t, 5.8e-177], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], If[LessEqual[t, 2.7e+42], N[((-N[(c * z), $MachinePrecision]) * b), $MachinePrecision], N[(N[((-t) * x), $MachinePrecision] * a), $MachinePrecision]]]]

Derivation

1. Split input into 4 regimes

2. if t < -1.95000000000000011e-109

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around 0

      \[\leadsto \left(i \cdot t\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 21.9

         \[\leadsto \left(i \cdot t\right) \cdot b \]

   7. Applied rewrites 21.9%

      \[\leadsto \left(i \cdot t\right) \cdot b \]

   if -1.95000000000000011e-109 < t < 5.79999999999999994e-177

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

   if 5.79999999999999994e-177 < t < 2.7000000000000001e42

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around inf

      \[\leadsto \left(-1 \cdot \left(c \cdot z\right)\right) \cdot b \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(c \cdot z\right)\right) \cdot b \]

      2. lower-neg.f64 N/A

         \[\leadsto \left(-c \cdot z\right) \cdot b \]

      3. lift-*.f64 22.8

         \[\leadsto \left(-c \cdot z\right) \cdot b \]

   7. Applied rewrites 22.8%

      \[\leadsto \left(-c \cdot z\right) \cdot b \]

   if 2.7000000000000001e42 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot \left(t \cdot x\right)\right) \cdot a \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-out N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x\right) \cdot a \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x\right) \cdot a \]

      5. mul-1-neg N/A

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

      6. lift-neg.f64 21.7

         \[\leadsto \left(\left(-t\right) \cdot x\right) \cdot a \]

   7. Applied rewrites 21.7%

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

Alternative 19: 29.0% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.95 \cdot 10^{-109}:\\ \;\;\;\;\left(i \cdot t\right) \cdot b\\ \mathbf{elif}\;t \leq 4.8 \cdot 10^{+34}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;\left(\left(-t\right) \cdot x\right) \cdot a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (if (<= t -1.95e-109)
   (* (* i t) b)
   (if (<= t 4.8e+34) (* (* c j) a) (* (* (- t) x) a))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 4.8e+34) {
		tmp = (c * j) * a;
	} else {
		tmp = (-t * x) * a;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: tmp
    if (t <= (-1.95d-109)) then
        tmp = (i * t) * b
    else if (t <= 4.8d+34) then
        tmp = (c * j) * a
    else
        tmp = (-t * x) * a
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double tmp;
	if (t <= -1.95e-109) {
		tmp = (i * t) * b;
	} else if (t <= 4.8e+34) {
		tmp = (c * j) * a;
	} else {
		tmp = (-t * x) * a;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	tmp = 0
	if t <= -1.95e-109:
		tmp = (i * t) * b
	elif t <= 4.8e+34:
		tmp = (c * j) * a
	else:
		tmp = (-t * x) * a
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0
	if (t <= -1.95e-109)
		tmp = Float64(Float64(i * t) * b);
	elseif (t <= 4.8e+34)
		tmp = Float64(Float64(c * j) * a);
	else
		tmp = Float64(Float64(Float64(-t) * x) * a);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	tmp = 0.0;
	if (t <= -1.95e-109)
		tmp = (i * t) * b;
	elseif (t <= 4.8e+34)
		tmp = (c * j) * a;
	else
		tmp = (-t * x) * a;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := If[LessEqual[t, -1.95e-109], N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision], If[LessEqual[t, 4.8e+34], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], N[(N[((-t) * x), $MachinePrecision] * a), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.95000000000000011e-109

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around 0

      \[\leadsto \left(i \cdot t\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 21.9

         \[\leadsto \left(i \cdot t\right) \cdot b \]

   7. Applied rewrites 21.9%

      \[\leadsto \left(i \cdot t\right) \cdot b \]

   if -1.95000000000000011e-109 < t < 4.79999999999999974e34

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

   if 4.79999999999999974e34 < t

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around inf

      \[\leadsto \left(-1 \cdot \left(t \cdot x\right)\right) \cdot a \]
   6. Step-by-step derivation

      1. mul-1-neg N/A

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

      2. distribute-lft-neg-out N/A

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

      3. mul-1-neg N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x\right) \cdot a \]

      4. lower-*.f64 N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x\right) \cdot a \]

      5. mul-1-neg N/A

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

      6. lift-neg.f64 21.7

         \[\leadsto \left(\left(-t\right) \cdot x\right) \cdot a \]

   7. Applied rewrites 21.7%

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

Alternative 20: 28.9% accurate, 2.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(i \cdot t\right) \cdot b\\ \mathbf{if}\;i \leq -5.1 \cdot 10^{+22}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;i \leq 9.3 \cdot 10^{+145}:\\ \;\;\;\;\left(c \cdot j\right) \cdot a\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b c i j)
 :precision binary64
 (let* ((t_1 (* (* i t) b)))
   (if (<= i -5.1e+22) t_1 (if (<= i 9.3e+145) (* (* c j) a) t_1))))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = (i * t) * b;
	double tmp;
	if (i <= -5.1e+22) {
		tmp = t_1;
	} else if (i <= 9.3e+145) {
		tmp = (c * j) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (i * t) * b
    if (i <= (-5.1d+22)) then
        tmp = t_1
    else if (i <= 9.3d+145) then
        tmp = (c * j) * a
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	double t_1 = (i * t) * b;
	double tmp;
	if (i <= -5.1e+22) {
		tmp = t_1;
	} else if (i <= 9.3e+145) {
		tmp = (c * j) * a;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	t_1 = (i * t) * b
	tmp = 0
	if i <= -5.1e+22:
		tmp = t_1
	elif i <= 9.3e+145:
		tmp = (c * j) * a
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b, c, i, j)
	t_1 = Float64(Float64(i * t) * b)
	tmp = 0.0
	if (i <= -5.1e+22)
		tmp = t_1;
	elseif (i <= 9.3e+145)
		tmp = Float64(Float64(c * j) * a);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b, c, i, j)
	t_1 = (i * t) * b;
	tmp = 0.0;
	if (i <= -5.1e+22)
		tmp = t_1;
	elseif (i <= 9.3e+145)
		tmp = (c * j) * a;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := Block[{t$95$1 = N[(N[(i * t), $MachinePrecision] * b), $MachinePrecision]}, If[LessEqual[i, -5.1e+22], t$95$1, If[LessEqual[i, 9.3e+145], N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if i < -5.1000000000000002e22 or 9.3000000000000002e145 < i

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in b around inf

      \[\leadsto \color{blue}{b \cdot \left(i \cdot t - c \cdot z\right)} \]
   3. Step-by-step derivation

      1. sub-negate-rev N/A

         \[\leadsto b \cdot \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \]

      2. mul-1-neg N/A

         \[\leadsto b \cdot \left(-1 \cdot \color{blue}{\left(c \cdot z - i \cdot t\right)}\right) \]

      3. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(c \cdot z - i \cdot t\right)\right) \cdot \color{blue}{b} \]

      5. mul-1-neg N/A

         \[\leadsto \left(\mathsf{neg}\left(\left(c \cdot z - i \cdot t\right)\right)\right) \cdot b \]

      6. sub-negate-rev N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      7. lower--.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      8. lower-*.f64 N/A

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

      9. lift-*.f64 38.9

         \[\leadsto \left(i \cdot t - c \cdot z\right) \cdot b \]

   4. Applied rewrites 38.9%

      \[\leadsto \color{blue}{\left(i \cdot t - c \cdot z\right) \cdot b} \]

   5. Taylor expanded in z around 0

      \[\leadsto \left(i \cdot t\right) \cdot b \]
   6. Step-by-step derivation

      1. lift-*.f64 21.9

         \[\leadsto \left(i \cdot t\right) \cdot b \]

   7. Applied rewrites 21.9%

      \[\leadsto \left(i \cdot t\right) \cdot b \]

   if -5.1000000000000002e22 < i < 9.3000000000000002e145

   1. Initial program 73.9%

      \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

   2. Taylor expanded in a around inf

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

      1. *-commutative N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

      3. associate-*r* N/A

         \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

      5. mul-1-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

      6. lower-neg.f64 N/A

         \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

      8. lower-*.f64 39.6

         \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   4. Applied rewrites 39.6%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(c \cdot j\right) \cdot a \]
   6. Step-by-step derivation

      1. lower-*.f64 23.1

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

   7. Applied rewrites 23.1%

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

Alternative 21: 23.1% accurate, 5.9× speedup

Math

\[\begin{array}{l} \\ \left(c \cdot j\right) \cdot a \end{array} \]

FPCore

(FPCore (x y z t a b c i j) :precision binary64 (* (* c j) a))

C

double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return (c * j) * 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, b, c, i, j)
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
    real(8), intent (in) :: b
    real(8), intent (in) :: c
    real(8), intent (in) :: i
    real(8), intent (in) :: j
    code = (c * j) * a
end function

Java

public static double code(double x, double y, double z, double t, double a, double b, double c, double i, double j) {
	return (c * j) * a;
}

Python

def code(x, y, z, t, a, b, c, i, j):
	return (c * j) * a

Julia

function code(x, y, z, t, a, b, c, i, j)
	return Float64(Float64(c * j) * a)
end

MATLAB

function tmp = code(x, y, z, t, a, b, c, i, j)
	tmp = (c * j) * a;
end

Wolfram

code[x_, y_, z_, t_, a_, b_, c_, i_, j_] := N[(N[(c * j), $MachinePrecision] * a), $MachinePrecision]

Derivation

1. Initial program 73.9%

   \[\left(x \cdot \left(y \cdot z - t \cdot a\right) - b \cdot \left(c \cdot z - t \cdot i\right)\right) + j \cdot \left(c \cdot a - y \cdot i\right) \]

2. Taylor expanded in a around inf

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

   1. *-commutative N/A

      \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

   2. lower-*.f64 N/A

      \[\leadsto \left(-1 \cdot \left(t \cdot x\right) + c \cdot j\right) \cdot \color{blue}{a} \]

   3. associate-*r* N/A

      \[\leadsto \left(\left(-1 \cdot t\right) \cdot x + c \cdot j\right) \cdot a \]

   4. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(-1 \cdot t, x, c \cdot j\right) \cdot a \]

   5. mul-1-neg N/A

      \[\leadsto \mathsf{fma}\left(\mathsf{neg}\left(t\right), x, c \cdot j\right) \cdot a \]

   6. lower-neg.f64 N/A

      \[\leadsto \mathsf{fma}\left(-t, x, c \cdot j\right) \cdot a \]

   7. *-commutative N/A

      \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

   8. lower-*.f64 39.6

      \[\leadsto \mathsf{fma}\left(-t, x, j \cdot c\right) \cdot a \]

4. Applied rewrites 39.6%

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

5. Taylor expanded in x around 0

   \[\leadsto \left(c \cdot j\right) \cdot a \]
6. Step-by-step derivation

   1. lower-*.f64 23.1

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

7. Applied rewrites 23.1%

   \[\leadsto \left(c \cdot j\right) \cdot a \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025136 
(FPCore (x y z t a b c i j)
  :name "Data.Colour.Matrix:determinant from colour-2.3.3, A"
  :precision binary64
  (+ (- (* x (- (* y z) (* t a))) (* b (- (* c z) (* t i)))) (* j (- (* c a) (* y i)))))