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

Percentage Accurate: 98.2% → 98.2%

Time: 6.7s

Alternatives: 14

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.5%

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

Alternative 2: 81.5% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -20000000.0)
     (fma (/ (- t) z) y x)
     (if (<= t_1 1e-9)
       (fma (/ t a) y x)
       (if (<= t_1 2.0) (+ x y) (fma (/ y a) t x))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -20000000.0) {
		tmp = fma((-t / z), y, x);
	} else if (t_1 <= 1e-9) {
		tmp = fma((t / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -20000000.0)
		tmp = fma(Float64(Float64(-t) / z), y, x);
	elseif (t_1 <= 1e-9)
		tmp = fma(Float64(t / a), y, x);
	elseif (t_1 <= 2.0)
		tmp = Float64(x + y);
	else
		tmp = fma(Float64(y / a), t, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 97.5%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 77.6%

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

   6. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot t}{z}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 77.7%

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

   if -2e7 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-9

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 86.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 86.6

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

   7. Applied rewrites 86.6%

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

   if 1.00000000000000006e-9 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 3: 79.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -4e+33)
     (* (/ (- z t) z) y)
     (if (<= t_1 1e-9)
       (fma (/ t a) y x)
       (if (<= t_1 2.0) (+ x y) (fma (/ y a) t x))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -4e+33) {
		tmp = ((z - t) / z) * y;
	} else if (t_1 <= 1e-9) {
		tmp = fma((t / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 97.2%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 82.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 68.4%

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

   if -3.9999999999999998e33 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-9

   1. Initial program 99.1%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 83.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 83.7

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

   7. Applied rewrites 83.7%

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

   if 1.00000000000000006e-9 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 4: 79.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -5e+67)
     (* (- t) (/ y z))
     (if (<= t_1 1e-9)
       (fma (/ t a) y x)
       (if (<= t_1 2.0) (+ x y) (fma (/ y a) t x))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -5e+67) {
		tmp = -t * (y / z);
	} else if (t_1 <= 1e-9) {
		tmp = fma((t / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -5e+67)
		tmp = Float64(Float64(-t) * Float64(y / z));
	elseif (t_1 <= 1e-9)
		tmp = fma(Float64(t / a), y, x);
	elseif (t_1 <= 2.0)
		tmp = Float64(x + y);
	else
		tmp = fma(Float64(y / a), t, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 96.2%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 83.3%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 78.8%

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

   if -4.99999999999999976e67 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-9

   1. Initial program 99.1%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 78.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 78.8

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

   7. Applied rewrites 78.8%

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

   if 1.00000000000000006e-9 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 5: 71.6% accurate, 0.3× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -2e+103) {
		tmp = (t * y) / a;
	} else if (t_1 <= 4e-52) {
		tmp = x;
	} else if (t_1 <= 5e+61) {
		tmp = x + y;
	} else {
		tmp = (y / a) * t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 95.3%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 40.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 40.9%

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

   10. Applied rewrites 41.0%

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

   if -2e103 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4e-52

   1. Initial program 99.1%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 68.1%

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

   if 4e-52 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5.00000000000000018e61

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 91.5%

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

   if 5.00000000000000018e61 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 91.4%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 71.0%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 57.5%

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

Alternative 6: 71.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))) (t_2 (* (/ y a) t)))
   (if (<= t_1 -2e+103)
     t_2
     (if (<= t_1 4e-52) x (if (<= t_1 5e+61) (+ x y) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double t_2 = (y / a) * t;
	double tmp;
	if (t_1 <= -2e+103) {
		tmp = t_2;
	} else if (t_1 <= 4e-52) {
		tmp = x;
	} else if (t_1 <= 5e+61) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	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) :: t_2
    real(8) :: tmp
    t_1 = (z - t) / (z - a)
    t_2 = (y / a) * t
    if (t_1 <= (-2d+103)) then
        tmp = t_2
    else if (t_1 <= 4d-52) then
        tmp = x
    else if (t_1 <= 5d+61) then
        tmp = x + y
    else
        tmp = t_2
    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) / (z - a);
	double t_2 = (y / a) * t;
	double tmp;
	if (t_1 <= -2e+103) {
		tmp = t_2;
	} else if (t_1 <= 4e-52) {
		tmp = x;
	} else if (t_1 <= 5e+61) {
		tmp = x + y;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -2e103 or 5.00000000000000018e61 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 93.2%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 56.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 49.6%

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

   if -2e103 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4e-52

   1. Initial program 99.1%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 68.1%

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

   if 4e-52 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5.00000000000000018e61

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 91.5%

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

Alternative 7: 81.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* y (/ (- z t) (- z a)))))
   (if (or (<= t_1 -2e-71) (not (<= t_1 1e+133)))
     (* (- z t) (/ y (- z a)))
     (fma (/ z (- z a)) y x))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y * ((z - t) / (z - a));
	double tmp;
	if ((t_1 <= -2e-71) || !(t_1 <= 1e+133)) {
		tmp = (z - t) * (y / (z - a));
	} else {
		tmp = fma((z / (z - a)), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y * Float64(Float64(z - t) / Float64(z - a)))
	tmp = 0.0
	if ((t_1 <= -2e-71) || !(t_1 <= 1e+133))
		tmp = Float64(Float64(z - t) * Float64(y / Float64(z - a)));
	else
		tmp = fma(Float64(z / Float64(z - a)), y, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < -1.9999999999999998e-71 or 1e133 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))

   1. Initial program 97.2%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 84.0%

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

   if -1.9999999999999998e-71 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < 1e133

   1. Initial program 99.4%

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

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 92.2%

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

4. Final simplification 88.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \cdot \frac{z - t}{z - a} \leq -2 \cdot 10^{-71} \lor \neg \left(y \cdot \frac{z - t}{z - a} \leq 10^{+133}\right):\\ \;\;\;\;\left(z - t\right) \cdot \frac{y}{z - a}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{z - a}, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 83.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -5e+15)
     (* (- y) (/ t (- z a)))
     (if (<= t_1 3e+61) (fma (/ z (- z a)) y x) (* (- t) (/ y (- z a)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -5e+15) {
		tmp = -y * (t / (z - a));
	} else if (t_1 <= 3e+61) {
		tmp = fma((z / (z - a)), y, x);
	} else {
		tmp = -t * (y / (z - a));
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.4%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 79.7%

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

   if -5e15 < (/.f64 (-.f64 z t) (-.f64 z a)) < 3e61

   1. Initial program 99.6%

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

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 90.4%

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

   if 3e61 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 91.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. add-cube-cbrt N/A

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

      5. associate-*l* N/A

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

      6. lower-fma.f64 N/A

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

      7. pow2 N/A

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

      8. lower-pow.f64 N/A

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

      9. lower-cbrt.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. lower-cbrt.f64 90.9

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

   4. Applied rewrites 90.9%

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

   5. Taylor expanded in t around inf

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

   7. Applied rewrites 82.5%

      \[\leadsto \color{blue}{\left(-t\right) \cdot \frac{y}{z - a}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 88.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \leq -5 \cdot 10^{+15}:\\ \;\;\;\;\left(-y\right) \cdot \frac{t}{z - a}\\ \mathbf{elif}\;\frac{z - t}{z - a} \leq 3 \cdot 10^{+61}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{z - a}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\left(-t\right) \cdot \frac{y}{z - a}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 82.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -5e+15)
     (* (- y) (/ t (- z a)))
     (if (<= t_1 2.0) (fma (/ z (- z a)) y x) (fma (/ y a) t x)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -5e+15) {
		tmp = -y * (t / (z - a));
	} else if (t_1 <= 2.0) {
		tmp = fma((z / (z - a)), y, x);
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.4%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 79.7%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 91.5%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 10: 81.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -20000000000.0)
     (fma (/ (- t) z) y x)
     (if (<= t_1 2.0) (fma (/ z (- z a)) y x) (fma (/ y a) t x)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -20000000000.0) {
		tmp = fma((-t / z), y, x);
	} else if (t_1 <= 2.0) {
		tmp = fma((z / (z - a)), y, x);
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -20000000000.0)
		tmp = fma(Float64(Float64(-t) / z), y, x);
	elseif (t_1 <= 2.0)
		tmp = fma(Float64(z / Float64(z - a)), y, x);
	else
		tmp = fma(Float64(y / a), t, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.5%

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

   3. Taylor expanded in a around 0

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

   5. Applied rewrites 77.1%

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

   6. Taylor expanded in z around 0

      \[\leadsto \mathsf{fma}\left(\frac{-1 \cdot t}{z}, y, x\right) \]
   7. Step-by-step derivation

   8. Applied rewrites 77.1%

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

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

   1. Initial program 99.5%

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

   3. Taylor expanded in t around 0

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

   5. Applied rewrites 92.0%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 11: 81.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (or (<= t_1 1e-9) (not (<= t_1 2.0))) (fma (/ y a) t x) (+ x y))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if ((t_1 <= 1e-9) || !(t_1 <= 2.0)) {
		tmp = fma((y / a), t, x);
	} else {
		tmp = x + y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if ((t_1 <= 1e-9) || !(t_1 <= 2.0))
		tmp = fma(Float64(y / a), t, x);
	else
		tmp = Float64(x + y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-9 or 2 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 97.7%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 71.2%

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

   if 1.00000000000000006e-9 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

4. Final simplification 81.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \leq 10^{-9} \lor \neg \left(\frac{z - t}{z - a} \leq 2\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{a}, t, x\right)\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 81.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 1e-9)
     (fma (/ t a) y x)
     (if (<= t_1 2.0) (+ x y) (fma (/ y a) t x)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= 1e-9) {
		tmp = fma((t / a), y, x);
	} else if (t_1 <= 2.0) {
		tmp = x + y;
	} else {
		tmp = fma((y / a), t, x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-9

   1. Initial program 98.6%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 70.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 70.7

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

   7. Applied rewrites 70.7%

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

   if 1.00000000000000006e-9 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 98.5%

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

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

   1. Initial program 94.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 73.9%

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

Alternative 13: 67.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (z - a)) <= 5e-52) {
		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) / (z - a)) <= 5d-52) 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) / (z - a)) <= 5e-52) {
		tmp = x;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (z - a)) <= 5e-52:
		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(z - a)) <= 5e-52)
		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) / (z - a)) <= 5e-52)
		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[(z - a), $MachinePrecision]), $MachinePrecision], 5e-52], x, N[(x + y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 5e-52

   1. Initial program 98.5%

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

   3. Taylor expanded in x around inf

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

   5. Applied rewrites 57.1%

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

   if 5e-52 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.6%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 80.3%

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

Alternative 14: 51.1% accurate, 26.0× 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.5%

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

3. Taylor expanded in x around inf

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

5. Applied rewrites 50.8%

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

Developer Target 1: 98.3% accurate, 0.8× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z, double t, double a) {
	return x + (y / ((z - a) / (z - 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 - a) / (z - t)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (+ x (/ y (/ (- z a) (- z t)))))

  (+ x (* y (/ (- z t) (- z a)))))