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

Percentage Accurate: 98.0% → 98.0%

Time: 3.8s

Alternatives: 13

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.0% 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.0% 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.0%

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

Alternative 2: 92.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \mathsf{fma}\left(\frac{-t}{z - a}, y, x\right)\\ \mathbf{if}\;t\_1 \leq -500:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \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 (fma (/ (- t) (- z a)) y x)))
   (if (<= t_1 -500.0) t_2 (if (<= t_1 5.0) (fma y (/ z (- z a)) x) 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 = fma((-t / (z - a)), y, x);
	double tmp;
	if (t_1 <= -500.0) {
		tmp = t_2;
	} else if (t_1 <= 5.0) {
		tmp = fma(y, (z / (z - a)), x);
	} 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 = fma(Float64(Float64(-t) / Float64(z - a)), y, x)
	tmp = 0.0
	if (t_1 <= -500.0)
		tmp = t_2;
	elseif (t_1 <= 5.0)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	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[(z - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[((-t) / N[(z - a), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -500.0], t$95$2, If[LessEqual[t$95$1, 5.0], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 75.7

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

   4. Applied rewrites 75.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 75.7

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

   6. Applied rewrites 75.7%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.9

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

   4. Applied rewrites 71.9%

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

Alternative 3: 84.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \frac{\left(-t\right) \cdot y}{z - a}\\ \mathbf{if}\;t\_1 \leq -5 \cdot 10^{+203}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq -2 \cdot 10^{+20}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{-t}{z}, x\right)\\ \mathbf{elif}\;t\_1 \leq 5:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{z}{z - a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+94}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \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 (/ (* (- t) y) (- z a))))
   (if (<= t_1 -5e+203)
     t_2
     (if (<= t_1 -2e+20)
       (fma y (/ (- t) z) x)
       (if (<= t_1 5.0)
         (fma y (/ z (- z a)) x)
         (if (<= t_1 2e+94) (fma (/ t a) y x) 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 = (-t * y) / (z - a);
	double tmp;
	if (t_1 <= -5e+203) {
		tmp = t_2;
	} else if (t_1 <= -2e+20) {
		tmp = fma(y, (-t / z), x);
	} else if (t_1 <= 5.0) {
		tmp = fma(y, (z / (z - a)), x);
	} else if (t_1 <= 2e+94) {
		tmp = fma((t / a), y, x);
	} 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(Float64(-t) * y) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -5e+203)
		tmp = t_2;
	elseif (t_1 <= -2e+20)
		tmp = fma(y, Float64(Float64(-t) / z), x);
	elseif (t_1 <= 5.0)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	elseif (t_1 <= 2e+94)
		tmp = fma(Float64(t / a), y, x);
	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[(z - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[((-t) * y), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+203], t$95$2, If[LessEqual[t$95$1, -2e+20], N[(y * N[((-t) / z), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 5.0], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+94], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision], t$95$2]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -4.99999999999999994e203 or 2e94 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lift--.f64 25.9

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

   4. Applied rewrites 25.9%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 51.1

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

   7. Applied rewrites 51.1%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.9

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

   4. Applied rewrites 71.9%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

      \[\leadsto x + y \cdot \color{blue}{\frac{t}{a}} \]
   5. 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 61.0

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

   6. Applied rewrites 61.0%

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

Alternative 4: 84.3% accurate, 0.4× speedup

Math

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

FPCore

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

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 <= -1e+111) {
		tmp = t_1;
	} else if (t_1 <= 1e+93) {
		tmp = fma(y, (z / (z - a)), x);
	} else {
		tmp = t_1;
	}
	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 <= -1e+111)
		tmp = t_1;
	elseif (t_1 <= 1e+93)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	else
		tmp = t_1;
	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[LessEqual[t$95$1, -1e+111], t$95$1, If[LessEqual[t$95$1, 1e+93], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < -9.99999999999999957e110 or 1.00000000000000004e93 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 84.2

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

   4. Applied rewrites 84.2%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 49.6

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

   7. Applied rewrites 49.6%

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

   if -9.99999999999999957e110 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < 1.00000000000000004e93

   1. Initial program 98.0%

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

   2. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 71.9

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

   4. Applied rewrites 71.9%

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

Alternative 5: 83.6% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a)))
        (t_2 (fma (/ t a) y x))
        (t_3 (/ (* (- t) y) (- z a))))
   (if (<= t_1 -5e+203)
     t_3
     (if (<= t_1 -50000000000.0)
       (fma y (/ (- t) z) x)
       (if (<= t_1 4e-26)
         t_2
         (if (<= t_1 5.0) (+ y x) (if (<= t_1 2e+94) t_2 t_3)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double t_2 = fma((t / a), y, x);
	double t_3 = (-t * y) / (z - a);
	double tmp;
	if (t_1 <= -5e+203) {
		tmp = t_3;
	} else if (t_1 <= -50000000000.0) {
		tmp = fma(y, (-t / z), x);
	} else if (t_1 <= 4e-26) {
		tmp = t_2;
	} else if (t_1 <= 5.0) {
		tmp = y + x;
	} else if (t_1 <= 2e+94) {
		tmp = t_2;
	} else {
		tmp = t_3;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	t_2 = fma(Float64(t / a), y, x)
	t_3 = Float64(Float64(Float64(-t) * y) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -5e+203)
		tmp = t_3;
	elseif (t_1 <= -50000000000.0)
		tmp = fma(y, Float64(Float64(-t) / z), x);
	elseif (t_1 <= 4e-26)
		tmp = t_2;
	elseif (t_1 <= 5.0)
		tmp = Float64(y + x);
	elseif (t_1 <= 2e+94)
		tmp = t_2;
	else
		tmp = t_3;
	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]}, Block[{t$95$2 = N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision]}, Block[{t$95$3 = N[(N[((-t) * y), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -5e+203], t$95$3, If[LessEqual[t$95$1, -50000000000.0], N[(y * N[((-t) / z), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e-26], t$95$2, If[LessEqual[t$95$1, 5.0], N[(y + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+94], t$95$2, t$95$3]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -4.99999999999999994e203 or 2e94 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lift--.f64 25.9

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

   4. Applied rewrites 25.9%

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

   if -4.99999999999999994e203 < (/.f64 (-.f64 z t) (-.f64 z a)) < -5e10

   1. Initial program 98.0%

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

   2. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 51.1

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

   7. Applied rewrites 51.1%

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

   if -5e10 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4.0000000000000002e-26 or 5 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2e94

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

      \[\leadsto x + y \cdot \color{blue}{\frac{t}{a}} \]
   5. 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 61.0

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

   6. Applied rewrites 61.0%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

Alternative 6: 80.7% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \mathsf{fma}\left(\frac{t}{a}, y, x\right)\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+235}:\\ \;\;\;\;\frac{t \cdot y}{a}\\ \mathbf{elif}\;t\_1 \leq -50000000000:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{-t}{z}, x\right)\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-26}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5:\\ \;\;\;\;y + x\\ \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 (fma (/ t a) y x)))
   (if (<= t_1 -1e+235)
     (/ (* t y) a)
     (if (<= t_1 -50000000000.0)
       (fma y (/ (- t) z) x)
       (if (<= t_1 4e-26) t_2 (if (<= t_1 5.0) (+ y x) 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 = fma((t / a), y, x);
	double tmp;
	if (t_1 <= -1e+235) {
		tmp = (t * y) / a;
	} else if (t_1 <= -50000000000.0) {
		tmp = fma(y, (-t / z), x);
	} else if (t_1 <= 4e-26) {
		tmp = t_2;
	} else if (t_1 <= 5.0) {
		tmp = y + x;
	} 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 = fma(Float64(t / a), y, x)
	tmp = 0.0
	if (t_1 <= -1e+235)
		tmp = Float64(Float64(t * y) / a);
	elseif (t_1 <= -50000000000.0)
		tmp = fma(y, Float64(Float64(-t) / z), x);
	elseif (t_1 <= 4e-26)
		tmp = t_2;
	elseif (t_1 <= 5.0)
		tmp = Float64(y + x);
	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[(z - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+235], N[(N[(t * y), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[t$95$1, -50000000000.0], N[(y * N[((-t) / z), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 4e-26], t$95$2, If[LessEqual[t$95$1, 5.0], N[(y + x), $MachinePrecision], t$95$2]]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lift--.f64 25.9

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

   4. Applied rewrites 25.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 18.4

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

   7. Applied rewrites 18.4%

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

   if -1.0000000000000001e235 < (/.f64 (-.f64 z t) (-.f64 z a)) < -5e10

   1. Initial program 98.0%

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

   2. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. mul-1-neg N/A

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

      3. lift-neg.f64 N/A

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

      4. lower-/.f64 51.1

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

   7. Applied rewrites 51.1%

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

   if -5e10 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4.0000000000000002e-26 or 5 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

      \[\leadsto x + y \cdot \color{blue}{\frac{t}{a}} \]
   5. 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 61.0

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

   6. Applied rewrites 61.0%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

Alternative 7: 80.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ \mathbf{if}\;t\_1 \leq 4 \cdot 10^{-26}:\\ \;\;\;\;\mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 5:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{t}{a}, y, 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-26)
     (fma t (/ y a) x)
     (if (<= t_1 5.0) (+ y x) (fma (/ t a) y 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-26) {
		tmp = fma(t, (y / a), x);
	} else if (t_1 <= 5.0) {
		tmp = y + x;
	} else {
		tmp = fma((t / a), y, 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-26)
		tmp = fma(t, Float64(y / a), x);
	elseif (t_1 <= 5.0)
		tmp = Float64(y + x);
	else
		tmp = fma(Float64(t / a), y, 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-26], N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 5.0], N[(y + x), $MachinePrecision], N[(N[(t / a), $MachinePrecision] * y + x), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

      \[\leadsto x + y \cdot \color{blue}{\frac{t}{a}} \]
   5. 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 61.0

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

   6. Applied rewrites 61.0%

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

Alternative 8: 80.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \mathsf{fma}\left(t, \frac{y}{a}, x\right)\\ \mathbf{if}\;t\_1 \leq 4 \cdot 10^{-26}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+33}:\\ \;\;\;\;y + x\\ \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 (fma t (/ y a) x)))
   (if (<= t_1 4e-26) t_2 (if (<= t_1 5e+33) (+ y x) 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 = fma(t, (y / a), x);
	double tmp;
	if (t_1 <= 4e-26) {
		tmp = t_2;
	} else if (t_1 <= 5e+33) {
		tmp = y + x;
	} 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 = fma(t, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= 4e-26)
		tmp = t_2;
	elseif (t_1 <= 5e+33)
		tmp = Float64(y + x);
	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[(z - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, 4e-26], t$95$2, If[LessEqual[t$95$1, 5e+33], N[(y + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 4.0000000000000002e-26 or 4.99999999999999973e33 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 61.0

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

   4. Applied rewrites 61.0%

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

   if 4.0000000000000002e-26 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4.99999999999999973e33

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

Alternative 9: 71.9% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -1e+135)
     (/ (* t y) a)
     (if (<= t_1 5e-95)
       (* 1.0 x)
       (if (<= t_1 2e+94) (+ y x) (/ (* (- t) y) z))))))

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+135) {
		tmp = (t * y) / a;
	} else if (t_1 <= 5e-95) {
		tmp = 1.0 * x;
	} else if (t_1 <= 2e+94) {
		tmp = y + x;
	} else {
		tmp = (-t * y) / z;
	}
	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 <= (-1d+135)) then
        tmp = (t * y) / a
    else if (t_1 <= 5d-95) then
        tmp = 1.0d0 * x
    else if (t_1 <= 2d+94) then
        tmp = y + x
    else
        tmp = (-t * y) / z
    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 <= -1e+135) {
		tmp = (t * y) / a;
	} else if (t_1 <= 5e-95) {
		tmp = 1.0 * x;
	} else if (t_1 <= 2e+94) {
		tmp = y + x;
	} else {
		tmp = (-t * y) / z;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (z - a)
	tmp = 0
	if t_1 <= -1e+135:
		tmp = (t * y) / a
	elif t_1 <= 5e-95:
		tmp = 1.0 * x
	elif t_1 <= 2e+94:
		tmp = y + x
	else:
		tmp = (-t * y) / z
	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+135)
		tmp = Float64(Float64(t * y) / a);
	elseif (t_1 <= 5e-95)
		tmp = Float64(1.0 * x);
	elseif (t_1 <= 2e+94)
		tmp = Float64(y + x);
	else
		tmp = Float64(Float64(Float64(-t) * y) / z);
	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 <= -1e+135)
		tmp = (t * y) / a;
	elseif (t_1 <= 5e-95)
		tmp = 1.0 * x;
	elseif (t_1 <= 2e+94)
		tmp = y + x;
	else
		tmp = (-t * y) / z;
	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, -1e+135], N[(N[(t * y), $MachinePrecision] / a), $MachinePrecision], If[LessEqual[t$95$1, 5e-95], N[(1.0 * x), $MachinePrecision], If[LessEqual[t$95$1, 2e+94], N[(y + x), $MachinePrecision], N[(N[((-t) * y), $MachinePrecision] / z), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lift--.f64 25.9

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

   4. Applied rewrites 25.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 18.4

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

   7. Applied rewrites 18.4%

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

   if -9.99999999999999962e134 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4.9999999999999998e-95

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 84.2

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

   4. Applied rewrites 84.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   6. Step-by-step derivation

   7. Applied rewrites 50.3%

      \[\leadsto 1 \cdot x \]

   if 4.9999999999999998e-95 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2e94

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

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

   1. Initial program 98.0%

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

   2. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.5

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

   4. Applied rewrites 66.5%

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

   5. Taylor expanded in z around 0

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. mul-1-neg N/A

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

      5. lift-neg.f64 N/A

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

      6. lower-*.f64 14.3

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

   7. Applied rewrites 14.3%

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

Alternative 10: 71.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := \frac{t \cdot y}{a}\\ \mathbf{if}\;t\_1 \leq -1 \cdot 10^{+135}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{-95}:\\ \;\;\;\;1 \cdot x\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+94}:\\ \;\;\;\;y + x\\ \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 (/ (* t y) a)))
   (if (<= t_1 -1e+135)
     t_2
     (if (<= t_1 5e-95) (* 1.0 x) (if (<= t_1 2e+94) (+ y x) 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 = (t * y) / a;
	double tmp;
	if (t_1 <= -1e+135) {
		tmp = t_2;
	} else if (t_1 <= 5e-95) {
		tmp = 1.0 * x;
	} else if (t_1 <= 2e+94) {
		tmp = y + x;
	} 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 = (t * y) / a
    if (t_1 <= (-1d+135)) then
        tmp = t_2
    else if (t_1 <= 5d-95) then
        tmp = 1.0d0 * x
    else if (t_1 <= 2d+94) then
        tmp = y + x
    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 = (t * y) / a;
	double tmp;
	if (t_1 <= -1e+135) {
		tmp = t_2;
	} else if (t_1 <= 5e-95) {
		tmp = 1.0 * x;
	} else if (t_1 <= 2e+94) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (z - a)
	t_2 = (t * y) / a
	tmp = 0
	if t_1 <= -1e+135:
		tmp = t_2
	elif t_1 <= 5e-95:
		tmp = 1.0 * x
	elif t_1 <= 2e+94:
		tmp = y + x
	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(t * y) / a)
	tmp = 0.0
	if (t_1 <= -1e+135)
		tmp = t_2;
	elseif (t_1 <= 5e-95)
		tmp = Float64(1.0 * x);
	elseif (t_1 <= 2e+94)
		tmp = Float64(y + x);
	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 = (t * y) / a;
	tmp = 0.0;
	if (t_1 <= -1e+135)
		tmp = t_2;
	elseif (t_1 <= 5e-95)
		tmp = 1.0 * x;
	elseif (t_1 <= 2e+94)
		tmp = y + x;
	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[(t * y), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[t$95$1, -1e+135], t$95$2, If[LessEqual[t$95$1, 5e-95], N[(1.0 * x), $MachinePrecision], If[LessEqual[t$95$1, 2e+94], N[(y + x), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -9.99999999999999962e134 or 2e94 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in t around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 N/A

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

      7. lift--.f64 25.9

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

   4. Applied rewrites 25.9%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 18.4

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

   7. Applied rewrites 18.4%

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

   if -9.99999999999999962e134 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4.9999999999999998e-95

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 84.2

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

   4. Applied rewrites 84.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   6. Step-by-step derivation

   7. Applied rewrites 50.3%

      \[\leadsto 1 \cdot x \]

   if 4.9999999999999998e-95 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2e94

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

Alternative 11: 66.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- z a)) 1.42e-87) (* 1.0 x) (+ y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (z - a)) <= 1.42e-87) {
		tmp = 1.0 * x;
	} else {
		tmp = y + 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 (((z - t) / (z - a)) <= 1.42d-87) then
        tmp = 1.0d0 * x
    else
        tmp = y + 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 (((z - t) / (z - a)) <= 1.42e-87) {
		tmp = 1.0 * x;
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (z - a)) <= 1.42e-87:
		tmp = 1.0 * x
	else:
		tmp = y + x
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (((z - t) / (z - a)) <= 1.42e-87)
		tmp = 1.0 * x;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 98.0%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. associate-/l* N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lift--.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 N/A

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

      10. lift--.f64 84.2

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

   4. Applied rewrites 84.2%

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

   5. Taylor expanded in x around inf

      \[\leadsto 1 \cdot x \]
   6. Step-by-step derivation

   7. Applied rewrites 50.3%

      \[\leadsto 1 \cdot x \]

   if 1.42e-87 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   2. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 60.8

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

   4. Applied rewrites 60.8%

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

Alternative 12: 60.8% accurate, 4.1× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := N[(y + x), $MachinePrecision]

Derivation

1. Initial program 98.0%

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

2. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 60.8

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

4. Applied rewrites 60.8%

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

Alternative 13: 19.2% accurate, 15.3× speedup

Math

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

FPCore

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

C

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

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 = y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.0%

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

2. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 60.8

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

4. Applied rewrites 60.8%

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

5. Taylor expanded in x around 0

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

7. Applied rewrites 19.2%

   \[\leadsto y \]
8. Add Preprocessing

Reproduce

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