Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B

Percentage Accurate: 98.0% → 98.0%

Time: 3.5s

Alternatives: 16

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x + (y * ((z - t) / (a - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.0%

   \[x + y \cdot \frac{z - t}{a - t} \]
2. Add Preprocessing

Alternative 2: 95.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := x + \frac{y \cdot z}{a - t}\\ \mathbf{if}\;t\_1 \leq -200000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 0.0005:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+36}:\\ \;\;\;\;x + y \cdot \left(1 - \frac{z}{t}\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (+ x (/ (* y z) (- a t)))))
   (if (<= t_1 -200000.0)
     t_2
     (if (<= t_1 0.0005)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 5e+36) (+ x (* y (- 1.0 (/ z t)))) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = x + ((y * z) / (a - t));
	double tmp;
	if (t_1 <= -200000.0) {
		tmp = t_2;
	} else if (t_1 <= 0.0005) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 5e+36) {
		tmp = x + (y * (1.0 - (z / t)));
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(x + Float64(Float64(y * z) / Float64(a - t)))
	tmp = 0.0
	if (t_1 <= -200000.0)
		tmp = t_2;
	elseif (t_1 <= 0.0005)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 5e+36)
		tmp = Float64(x + Float64(y * Float64(1.0 - Float64(z / t))));
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + N[(N[(y * z), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -200000.0], t$95$2, If[LessEqual[t$95$1, 0.0005], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 5e+36], N[(x + N[(y * N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e5 or 4.99999999999999977e36 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 91.6

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

   4. Applied rewrites 91.6%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 74.2

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

   7. Applied rewrites 74.2%

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

   if -2e5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.0000000000000001e-4

   1. Initial program 98.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 60.2

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

   4. Applied rewrites 60.2%

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

   if 5.0000000000000001e-4 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.99999999999999977e36

   1. Initial program 98.0%

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

   2. Taylor expanded in t around -inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 60.8

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

   4. Applied rewrites 60.8%

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

   5. Taylor expanded in a around 0

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

      1. lower--.f64 N/A

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

      2. lower-/.f64 67.0

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

   7. Applied rewrites 67.0%

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

Alternative 3: 95.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := x + \frac{y \cdot z}{a - t}\\ \mathbf{if}\;t\_1 \leq -200000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 1.000005:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (+ x (/ (* y z) (- a t)))))
   (if (<= t_1 -200000.0)
     t_2
     (if (<= t_1 2e-18)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 1.000005) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = x + ((y * z) / (a - t));
	double tmp;
	if (t_1 <= -200000.0) {
		tmp = t_2;
	} else if (t_1 <= 2e-18) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 1.000005) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(x + Float64(Float64(y * z) / Float64(a - t)))
	tmp = 0.0
	if (t_1 <= -200000.0)
		tmp = t_2;
	elseif (t_1 <= 2e-18)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 1.000005)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(x + N[(N[(y * z), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -200000.0], t$95$2, If[LessEqual[t$95$1, 2e-18], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 1.000005], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e5 or 1.00000500000000003 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 91.6

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

   4. Applied rewrites 91.6%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 74.2

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

   7. Applied rewrites 74.2%

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

   if -2e5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 60.2

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

   4. Applied rewrites 60.2%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 1.00000500000000003

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 4: 87.4% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := \left(z - t\right) \cdot \frac{y}{a - t}\\ \mathbf{if}\;t\_1 \leq -200000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* (- z t) (/ y (- a t)))))
   (if (<= t_1 -200000.0)
     t_2
     (if (<= t_1 2e-18)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 4e+28) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (z - t) * (y / (a - t));
	double tmp;
	if (t_1 <= -200000.0) {
		tmp = t_2;
	} else if (t_1 <= 2e-18) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(Float64(z - t) * Float64(y / Float64(a - t)))
	tmp = 0.0
	if (t_1 <= -200000.0)
		tmp = t_2;
	elseif (t_1 <= 2e-18)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(z - t), $MachinePrecision] * N[(y / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -200000.0], t$95$2, If[LessEqual[t$95$1, 2e-18], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e5 or 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 84.7

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

   4. Applied rewrites 84.7%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift--.f64 46.7

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

   7. Applied rewrites 46.7%

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

   if -2e5 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 60.2

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

   4. Applied rewrites 60.2%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 5: 87.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -20000000000:\\ \;\;\;\;y \cdot t\_1\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{z}{a - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -20000000000.0)
     (* y t_1)
     (if (<= t_1 2e-18)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 4e+28) (+ x y) (* y (/ z (- a t))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -20000000000.0) {
		tmp = y * t_1;
	} else if (t_1 <= 2e-18) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = y * (z / (a - t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -20000000000.0)
		tmp = Float64(y * t_1);
	elseif (t_1 <= 2e-18)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = Float64(y * Float64(z / Float64(a - t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -20000000000.0], N[(y * t$95$1), $MachinePrecision], If[LessEqual[t$95$1, 2e-18], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], N[(y * N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e10

   1. Initial program 98.0%

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

   2. Taylor expanded in z around -inf

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

      1. associate-*r* N/A

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

      2. mul-1-neg N/A

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

      3. lower-*.f64 N/A

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

      4. lower-neg.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lift--.f64 91.6

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

   4. Applied rewrites 91.6%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 48.6

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

   7. Applied rewrites 48.6%

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

   if -2e10 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 60.2

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

   4. Applied rewrites 60.2%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

      \[\leadsto x + \color{blue}{y} \]

   if 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

Alternative 6: 87.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := y \cdot \frac{z}{a - t}\\ \mathbf{if}\;t\_1 \leq -20000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z - t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* y (/ z (- a t)))))
   (if (<= t_1 -20000000000.0)
     t_2
     (if (<= t_1 2e-18)
       (fma y (/ (- z t) a) x)
       (if (<= t_1 4e+28) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = y * (z / (a - t));
	double tmp;
	if (t_1 <= -20000000000.0) {
		tmp = t_2;
	} else if (t_1 <= 2e-18) {
		tmp = fma(y, ((z - t) / a), x);
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(y * Float64(z / Float64(a - t)))
	tmp = 0.0
	if (t_1 <= -20000000000.0)
		tmp = t_2;
	elseif (t_1 <= 2e-18)
		tmp = fma(y, Float64(Float64(z - t) / a), x);
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -20000000000.0], t$95$2, If[LessEqual[t$95$1, 2e-18], N[(y * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e10 or 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   if -2e10 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 60.2

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

   4. Applied rewrites 60.2%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 7: 82.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ t_2 := y \cdot \frac{z}{a - t}\\ \mathbf{if}\;t\_1 \leq -20000000000:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (* y (/ z (- a t)))))
   (if (<= t_1 -20000000000.0)
     t_2
     (if (<= t_1 2e-18) (fma y (/ z a) x) (if (<= t_1 4e+28) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = y * (z / (a - t));
	double tmp;
	if (t_1 <= -20000000000.0) {
		tmp = t_2;
	} else if (t_1 <= 2e-18) {
		tmp = fma(y, (z / a), x);
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	t_2 = Float64(y * Float64(z / Float64(a - t)))
	tmp = 0.0
	if (t_1 <= -20000000000.0)
		tmp = t_2;
	elseif (t_1 <= 2e-18)
		tmp = fma(y, Float64(z / a), x);
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(z / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -20000000000.0], t$95$2, If[LessEqual[t$95$1, 2e-18], N[(y * N[(z / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -2e10 or 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   if -2e10 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 62.4

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

   4. Applied rewrites 62.4%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 8: 79.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-18}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{y}{-t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 2e-18)
     (fma y (/ z a) x)
     (if (<= t_1 4e+28) (+ x y) (* z (/ y (- t)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= 2e-18) {
		tmp = fma(y, (z / a), x);
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = z * (y / -t);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= 2e-18)
		tmp = fma(y, Float64(z / a), x);
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = Float64(z * Float64(y / Float64(-t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-18], N[(y * N[(z / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], N[(z * N[(y / (-t)), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-18

   1. Initial program 98.0%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 62.4

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

   4. Applied rewrites 62.4%

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

   if 2.0000000000000001e-18 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

      \[\leadsto x + \color{blue}{y} \]

   if 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 39.0

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

   4. Applied rewrites 39.0%

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

   5. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 24.0

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

   7. Applied rewrites 24.0%

      \[\leadsto \frac{\left(z - t\right) \cdot y}{-t} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lower-/.f64 29.5

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

   9. Applied rewrites 29.5%

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

   10. Taylor expanded in z around inf

       \[\leadsto z \cdot \frac{\color{blue}{y}}{-t} \]
   11. Step-by-step derivation

   12. Applied rewrites 15.6%

       \[\leadsto z \cdot \frac{\color{blue}{y}}{-t} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 9: 71.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+92}:\\ \;\;\;\;y \cdot \frac{z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{y}{-t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+92)
     (* y (/ z a))
     (if (<= t_1 2e-33) x (if (<= t_1 4e+28) (+ x y) (* z (/ y (- t))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = z * (y / -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)
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) :: t_1
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    if (t_1 <= (-5d+92)) then
        tmp = y * (z / a)
    else if (t_1 <= 2d-33) then
        tmp = x
    else if (t_1 <= 4d+28) then
        tmp = x + y
    else
        tmp = z * (y / -t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = z * (y / -t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= -5e+92:
		tmp = y * (z / a)
	elif t_1 <= 2e-33:
		tmp = x
	elif t_1 <= 4e+28:
		tmp = x + y
	else:
		tmp = z * (y / -t)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -5e+92)
		tmp = Float64(y * Float64(z / a));
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = Float64(z * Float64(y / Float64(-t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= -5e+92)
		tmp = y * (z / a);
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 4e+28)
		tmp = x + y;
	else
		tmp = z * (y / -t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+92], N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-33], x, If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], N[(z * N[(y / (-t)), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000022e92

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 20.1%

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

   if -5.00000000000000022e92 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 2.0000000000000001e-33 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

      \[\leadsto x + \color{blue}{y} \]

   if 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 39.0

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

   4. Applied rewrites 39.0%

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

   5. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 24.0

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

   7. Applied rewrites 24.0%

      \[\leadsto \frac{\left(z - t\right) \cdot y}{-t} \]
   8. Step-by-step derivation

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. associate-/l* N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lower-/.f64 29.5

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

   9. Applied rewrites 29.5%

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

   10. Taylor expanded in z around inf

       \[\leadsto z \cdot \frac{\color{blue}{y}}{-t} \]
   11. Step-by-step derivation

   12. Applied rewrites 15.6%

       \[\leadsto z \cdot \frac{\color{blue}{y}}{-t} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 10: 71.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+92}:\\ \;\;\;\;y \cdot \frac{z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+28}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{z}{-t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+92)
     (* y (/ z a))
     (if (<= t_1 2e-33) x (if (<= t_1 4e+28) (+ x y) (* y (/ z (- t))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = y * (z / -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)
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) :: t_1
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    if (t_1 <= (-5d+92)) then
        tmp = y * (z / a)
    else if (t_1 <= 2d-33) then
        tmp = x
    else if (t_1 <= 4d+28) then
        tmp = x + y
    else
        tmp = y * (z / -t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 4e+28) {
		tmp = x + y;
	} else {
		tmp = y * (z / -t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= -5e+92:
		tmp = y * (z / a)
	elif t_1 <= 2e-33:
		tmp = x
	elif t_1 <= 4e+28:
		tmp = x + y
	else:
		tmp = y * (z / -t)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -5e+92)
		tmp = Float64(y * Float64(z / a));
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 4e+28)
		tmp = Float64(x + y);
	else
		tmp = Float64(y * Float64(z / Float64(-t)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= -5e+92)
		tmp = y * (z / a);
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 4e+28)
		tmp = x + y;
	else
		tmp = y * (z / -t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+92], N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-33], x, If[LessEqual[t$95$1, 4e+28], N[(x + y), $MachinePrecision], N[(y * N[(z / (-t)), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000022e92

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 20.1%

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

   if -5.00000000000000022e92 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 2.0000000000000001e-33 < (/.f64 (-.f64 z t) (-.f64 a t)) < 3.99999999999999983e28

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

      \[\leadsto x + \color{blue}{y} \]

   if 3.99999999999999983e28 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 15.5

         \[\leadsto y \cdot \frac{z}{-t} \]

   7. Applied rewrites 15.5%

      \[\leadsto y \cdot \frac{z}{-t} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 11: 71.5% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+92}:\\ \;\;\;\;y \cdot \frac{z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+36}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;-\frac{y \cdot z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+92)
     (* y (/ z a))
     (if (<= t_1 2e-33) x (if (<= t_1 5e+36) (+ x y) (- (/ (* y z) t)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 5e+36) {
		tmp = x + y;
	} else {
		tmp = -((y * z) / 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)
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) :: t_1
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    if (t_1 <= (-5d+92)) then
        tmp = y * (z / a)
    else if (t_1 <= 2d-33) then
        tmp = x
    else if (t_1 <= 5d+36) then
        tmp = x + y
    else
        tmp = -((y * z) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else if (t_1 <= 5e+36) {
		tmp = x + y;
	} else {
		tmp = -((y * z) / t);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= -5e+92:
		tmp = y * (z / a)
	elif t_1 <= 2e-33:
		tmp = x
	elif t_1 <= 5e+36:
		tmp = x + y
	else:
		tmp = -((y * z) / t)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -5e+92)
		tmp = Float64(y * Float64(z / a));
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 5e+36)
		tmp = Float64(x + y);
	else
		tmp = Float64(-Float64(Float64(y * z) / t));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= -5e+92)
		tmp = y * (z / a);
	elseif (t_1 <= 2e-33)
		tmp = x;
	elseif (t_1 <= 5e+36)
		tmp = x + y;
	else
		tmp = -((y * z) / t);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+92], N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-33], x, If[LessEqual[t$95$1, 5e+36], N[(x + y), $MachinePrecision], (-N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision])]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000022e92

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 20.1%

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

   if -5.00000000000000022e92 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 2.0000000000000001e-33 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.99999999999999977e36

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

      \[\leadsto x + \color{blue}{y} \]

   if 4.99999999999999977e36 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

         \[\leadsto -\frac{y \cdot z}{t} \]

      3. lower-/.f64 N/A

         \[\leadsto -\frac{y \cdot z}{t} \]

      4. lower-*.f64 14.9

         \[\leadsto -\frac{y \cdot z}{t} \]

   7. Applied rewrites 14.9%

      \[\leadsto -\frac{y \cdot z}{t} \]
3. Recombined 4 regimes into one program.
4. Add Preprocessing

Alternative 12: 69.7% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+92}:\\ \;\;\;\;y \cdot \frac{z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+92) (* y (/ z a)) (if (<= t_1 2e-33) x (+ x y)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	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)
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) :: t_1
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    if (t_1 <= (-5d+92)) then
        tmp = y * (z / a)
    else if (t_1 <= 2d-33) then
        tmp = x
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = y * (z / a);
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= -5e+92:
		tmp = y * (z / a)
	elif t_1 <= 2e-33:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -5e+92)
		tmp = Float64(y * Float64(z / a));
	elseif (t_1 <= 2e-33)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= -5e+92)
		tmp = y * (z / a);
	elseif (t_1 <= 2e-33)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+92], N[(y * N[(z / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-33], x, N[(x + y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000022e92

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 28.3

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

   4. Applied rewrites 28.3%

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

   5. Taylor expanded in t around 0

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

   7. Applied rewrites 20.1%

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

   if -5.00000000000000022e92 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 2.0000000000000001e-33 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 13: 69.6% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{a - t}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+92}:\\ \;\;\;\;\frac{y \cdot z}{a}\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 -5e+92) (/ (* y z) a) (if (<= t_1 2e-33) x (+ x y)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = (y * z) / a;
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	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)
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) :: t_1
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    if (t_1 <= (-5d+92)) then
        tmp = (y * z) / a
    else if (t_1 <= 2d-33) then
        tmp = x
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double tmp;
	if (t_1 <= -5e+92) {
		tmp = (y * z) / a;
	} else if (t_1 <= 2e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	tmp = 0
	if t_1 <= -5e+92:
		tmp = (y * z) / a
	elif t_1 <= 2e-33:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(a - t))
	tmp = 0.0
	if (t_1 <= -5e+92)
		tmp = Float64(Float64(y * z) / a);
	elseif (t_1 <= 2e-33)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (z - t) / (a - t);
	tmp = 0.0;
	if (t_1 <= -5e+92)
		tmp = (y * z) / a;
	elseif (t_1 <= 2e-33)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+92], N[(N[(y * z), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[t$95$1, 2e-33], x, N[(x + y), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -5.00000000000000022e92

   1. Initial program 98.0%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 39.0

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

   4. Applied rewrites 39.0%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 18.6

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

   7. Applied rewrites 18.6%

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

   if -5.00000000000000022e92 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 2.0000000000000001e-33 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 14: 67.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z - t}{a - t} \leq 9 \cdot 10^{-33}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- a t)) 9e-33) x (+ x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 9e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	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)
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) :: tmp
    if (((z - t) / (a - t)) <= 9d-33) then
        tmp = x
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (a - t)) <= 9e-33) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (a - t)) <= 9e-33:
		tmp = x
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z - t) / Float64(a - t)) <= 9e-33)
		tmp = x;
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((z - t) / (a - t)) <= 9e-33)
		tmp = x;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision], 9e-33], x, N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 8.99999999999999982e-33

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if 8.99999999999999982e-33 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

   4. Applied rewrites 60.9%

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

Alternative 15: 54.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{-196}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 3.8 \cdot 10^{-141}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -2.7e-196) x (if (<= x 3.8e-141) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -2.7e-196) {
		tmp = x;
	} else if (x <= 3.8e-141) {
		tmp = y;
	} else {
		tmp = x;
	}
	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)
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) :: tmp
    if (x <= (-2.7d-196)) then
        tmp = x
    else if (x <= 3.8d-141) then
        tmp = y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -2.7e-196) {
		tmp = x;
	} else if (x <= 3.8e-141) {
		tmp = y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if x <= -2.7e-196:
		tmp = x
	elif x <= 3.8e-141:
		tmp = y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -2.7e-196)
		tmp = x;
	elseif (x <= 3.8e-141)
		tmp = y;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (x <= -2.7e-196)
		tmp = x;
	elseif (x <= 3.8e-141)
		tmp = y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -2.7e-196], x, If[LessEqual[x, 3.8e-141], y, x]]

Derivation

1. Split input into 2 regimes

2. if x < -2.69999999999999982e-196 or 3.79999999999999987e-141 < x

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

   4. Applied rewrites 51.4%

      \[\leadsto \color{blue}{x} \]

   if -2.69999999999999982e-196 < x < 3.79999999999999987e-141

   1. Initial program 98.0%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 39.0

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

   4. Applied rewrites 39.0%

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

   5. Taylor expanded in t around inf

      \[\leadsto y \]
   6. Step-by-step derivation

   7. Applied rewrites 18.4%

      \[\leadsto y \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 16: 51.4% accurate, 15.3× speedup

Math

\[\begin{array}{l} \\ x \end{array} \]

FPCore

(FPCore (x y z t a) :precision binary64 x)

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    code = x
end function

Java

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

Python

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

Julia

function code(x, y, z, t, a)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := x

Derivation

1. Initial program 98.0%

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

2. Taylor expanded in x around inf

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

4. Applied rewrites 51.4%

   \[\leadsto \color{blue}{x} \]
5. Add Preprocessing

Reproduce

herbie shell --seed 2025123 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:renderAxisLine from plot-0.2.3.4, B"
  :precision binary64
  (+ x (* y (/ (- z t) (- a t)))))