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

Percentage Accurate: 98.2% → 98.7%

Time: 3.8s

Alternatives: 13

Speedup: 0.5×

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.7% accurate, 0.5× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < -inf.0

   1. Initial program 86.1%

      \[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

      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 98.0

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

   5. Applied rewrites 98.0%

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

   if -inf.0 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))))

   1. Initial program 98.8%

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

Alternative 2: 88.3% accurate, 0.2× speedup

Math

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 92.6%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 83.9

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

   5. Applied rewrites 83.9%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 70.9

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

   8. Applied rewrites 70.9%

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

   if -1.9999999999999999e60 < (/.f64 (-.f64 z t) (-.f64 z a)) < 0.0050000000000000001

   1. Initial program 99.3%

      \[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. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lift--.f64 99.3

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 94.0

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

   7. Applied rewrites 94.0%

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

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

   1. Initial program 100.0%

      \[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

      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 99.0

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

   5. Applied rewrites 99.0%

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

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

   1. Initial program 99.8%

      \[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

      1. lower-/.f64 61.2

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

   5. Applied rewrites 61.2%

      \[\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 61.2

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

   7. Applied rewrites 61.2%

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

   if 9.9999999999999994e236 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 83.6%

      \[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

      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 88.1

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

   5. Applied rewrites 88.1%

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

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 94.0%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 67.8

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

   8. Applied rewrites 67.8%

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

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

   1. Initial program 99.6%

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

   3. Taylor expanded in z around inf

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

   5. Applied rewrites 90.9%

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

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

   1. Initial program 99.8%

      \[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

      1. lower-/.f64 61.2

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

   5. Applied rewrites 61.2%

      \[\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 61.2

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

   7. Applied rewrites 61.2%

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

   if 9.9999999999999994e236 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 83.6%

      \[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

      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 88.1

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

   5. Applied rewrites 88.1%

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

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 94.0%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 81.6

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 67.8

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

   8. Applied rewrites 67.8%

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

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

   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

      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 90.9

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

   5. Applied rewrites 90.9%

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

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

   1. Initial program 99.8%

      \[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

      1. lower-/.f64 61.2

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

   5. Applied rewrites 61.2%

      \[\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 61.2

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

   7. Applied rewrites 61.2%

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

   if 9.9999999999999994e236 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 83.6%

      \[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

      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 88.1

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

   5. Applied rewrites 88.1%

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

Alternative 5: 83.3% accurate, 0.3× speedup

Math

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -2e19 or 9.9999999999999994e236 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 91.9%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 82.5

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

   5. Applied rewrites 82.5%

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

   6. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift--.f64 72.0

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

   8. Applied rewrites 72.0%

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

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

   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

      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 90.9

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

   5. Applied rewrites 90.9%

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

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

   1. Initial program 99.8%

      \[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

      1. lower-/.f64 61.2

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

   5. Applied rewrites 61.2%

      \[\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 61.2

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

   7. Applied rewrites 61.2%

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

Alternative 6: 71.3% 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 -2 \cdot 10^{+135}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 10^{-112}:\\ \;\;\;\;x\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+111}:\\ \;\;\;\;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 (/ (* t y) a)))
   (if (<= t_1 -2e+135)
     t_2
     (if (<= t_1 1e-112) x (if (<= t_1 2e+111) (+ 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 = (t * y) / a;
	double tmp;
	if (t_1 <= -2e+135) {
		tmp = t_2;
	} else if (t_1 <= 1e-112) {
		tmp = x;
	} else if (t_1 <= 2e+111) {
		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 = (t * y) / a
    if (t_1 <= (-2d+135)) then
        tmp = t_2
    else if (t_1 <= 1d-112) then
        tmp = x
    else if (t_1 <= 2d+111) 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 = (t * y) / a;
	double tmp;
	if (t_1 <= -2e+135) {
		tmp = t_2;
	} else if (t_1 <= 1e-112) {
		tmp = x;
	} else if (t_1 <= 2e+111) {
		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 = (t * y) / a
	tmp = 0
	if t_1 <= -2e+135:
		tmp = t_2
	elif t_1 <= 1e-112:
		tmp = x
	elif t_1 <= 2e+111:
		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(t * y) / a)
	tmp = 0.0
	if (t_1 <= -2e+135)
		tmp = t_2;
	elseif (t_1 <= 1e-112)
		tmp = x;
	elseif (t_1 <= 2e+111)
		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 = (t * y) / a;
	tmp = 0.0;
	if (t_1 <= -2e+135)
		tmp = t_2;
	elseif (t_1 <= 1e-112)
		tmp = x;
	elseif (t_1 <= 2e+111)
		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[(t * y), $MachinePrecision] / a), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+135], t$95$2, If[LessEqual[t$95$1, 1e-112], x, If[LessEqual[t$95$1, 2e+111], N[(x + y), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -1.99999999999999992e135 or 1.99999999999999991e111 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 91.1%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 84.1

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

   5. Applied rewrites 84.1%

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

   6. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. sub-div N/A

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

      5. lower-/.f64 N/A

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

      6. lift--.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift--.f64 57.9

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

   8. Applied rewrites 57.9%

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

   9. Taylor expanded in z around 0

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

       1. lower-/.f64 N/A

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

       2. lower-*.f64 48.5

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

   11. Applied rewrites 48.5%

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

   if -1.99999999999999992e135 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999995e-113

   1. Initial program 99.2%

      \[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 66.9%

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

   if 9.9999999999999995e-113 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.99999999999999991e111

   1. Initial program 99.9%

      \[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 82.5%

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

Alternative 7: 81.8% 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 -2 \cdot 10^{+19}:\\ \;\;\;\;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 (/ y a) x)))
   (if (<= t_1 -2e+19) 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, (y / a), x);
	double tmp;
	if (t_1 <= -2e+19) {
		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(t, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= -2e+19)
		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[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, -2e+19], 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)) < -2e19 or 5 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 95.1%

      \[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

      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 62.8

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

   5. Applied rewrites 62.8%

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

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

   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

      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 90.9

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

   5. Applied rewrites 90.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 8: 81.3% accurate, 0.4× speedup

Math

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 97.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

      1. lower-/.f64 76.7

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

   5. Applied rewrites 76.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 76.7

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

   7. Applied rewrites 76.7%

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

   if 0.0050000000000000001 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4e6

   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 97.5%

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

   if 4e6 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.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

      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 62.3

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

   5. Applied rewrites 62.3%

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

Alternative 9: 81.0% 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 10^{-32}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 4000000:\\ \;\;\;\;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 (fma t (/ y a) x)))
   (if (<= t_1 1e-32) t_2 (if (<= t_1 4000000.0) (+ 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 = fma(t, (y / a), x);
	double tmp;
	if (t_1 <= 1e-32) {
		tmp = t_2;
	} else if (t_1 <= 4000000.0) {
		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 = fma(t, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= 1e-32)
		tmp = t_2;
	elseif (t_1 <= 4000000.0)
		tmp = Float64(x + y);
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 1.00000000000000006e-32 or 4e6 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 97.1%

      \[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

      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 73.3

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

   5. Applied rewrites 73.3%

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

   if 1.00000000000000006e-32 < (/.f64 (-.f64 z t) (-.f64 z a)) < 4e6

   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 94.7%

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

Alternative 10: 98.7% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= (+ x (* y t_1)) (- INFINITY))
     (/ (* (- t) y) (- z a))
     (fma t_1 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 ((x + (y * t_1)) <= -((double) INFINITY)) {
		tmp = (-t * y) / (z - a);
	} else {
		tmp = fma(t_1, 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 (Float64(x + Float64(y * t_1)) <= Float64(-Inf))
		tmp = Float64(Float64(Float64(-t) * y) / Float64(z - a));
	else
		tmp = fma(t_1, 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[N[(x + N[(y * t$95$1), $MachinePrecision]), $MachinePrecision], (-Infinity)], N[(N[((-t) * y), $MachinePrecision] / N[(z - a), $MachinePrecision]), $MachinePrecision], N[(t$95$1 * y + x), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))) < -inf.0

   1. Initial program 86.1%

      \[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

      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 98.0

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

   5. Applied rewrites 98.0%

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

   if -inf.0 < (+.f64 x (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))))

   1. Initial program 98.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. lift-*.f64 N/A

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

      3. lift--.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lift-/.f64 N/A

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

      10. lift--.f64 N/A

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

      11. lift--.f64 98.8

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

   4. Applied rewrites 98.8%

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

Alternative 11: 66.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Python

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 97.3%

      \[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 58.2%

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

   if 7.5000000000000002e-106 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.8%

      \[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 73.1%

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

Alternative 12: 53.3% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6.8 \cdot 10^{-72}:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 9.6 \cdot 10^{-204}:\\ \;\;\;\;y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= x -6.8e-72) x (if (<= x 9.6e-204) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -6.8e-72) {
		tmp = x;
	} else if (x <= 9.6e-204) {
		tmp = y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (x <= (-6.8d-72)) then
        tmp = x
    else if (x <= 9.6d-204) then
        tmp = y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (x <= -6.8e-72) {
		tmp = x;
	} else if (x <= 9.6e-204) {
		tmp = y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if x <= -6.8e-72:
		tmp = x
	elif x <= 9.6e-204:
		tmp = y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (x <= -6.8e-72)
		tmp = x;
	elseif (x <= 9.6e-204)
		tmp = y;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (x <= -6.8e-72)
		tmp = x;
	elseif (x <= 9.6e-204)
		tmp = y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[x, -6.8e-72], x, If[LessEqual[x, 9.6e-204], y, x]]

Derivation

1. Split input into 2 regimes

2. if x < -6.7999999999999997e-72 or 9.6e-204 < x

   1. Initial program 98.3%

      \[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 61.9%

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

   if -6.7999999999999997e-72 < x < 9.6e-204

   1. Initial program 97.6%

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

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-*.f64 N/A

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

      5. lower--.f64 N/A

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

      6. associate-*r/ N/A

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

      7. lower-/.f64 N/A

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

      8. mul-1-neg N/A

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

      9. lower-neg.f64 N/A

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lift--.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-*.f64 N/A

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

      15. lift--.f64 67.5

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

   5. Applied rewrites 67.5%

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

   6. Taylor expanded in y around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-*.f64 N/A

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

      4. sub-div N/A

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

      5. lower-/.f64 N/A

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

      6. lift--.f64 N/A

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

      7. *-commutative N/A

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

      8. lift-*.f64 N/A

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

      9. lift--.f64 52.5

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

   8. Applied rewrites 52.5%

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

   9. Taylor expanded in z around inf

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

   11. Applied rewrites 29.0%

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

Alternative 13: 51.7% 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.2%

   \[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 51.7%

   \[\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 2025089 
(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)))))