Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3

Percentage Accurate: 68.3% → 84.8%

Time: 5.3s

Alternatives: 13

Speedup: 0.8×

Specification

Math

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

FPCore

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

C

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

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 84.8% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -5.0000000000000004e242 or 1.7499999999999999e133 < z

   1. Initial program 30.0%

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

   2. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. sub-div N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate-*r/ N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

   4. Applied rewrites 65.1%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. sub-div N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 77.5

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

   7. Applied rewrites 77.5%

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

   if -5.0000000000000004e242 < z < 1.7499999999999999e133

   1. Initial program 77.1%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 86.5

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

   3. Applied rewrites 86.5%

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

Alternative 2: 76.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ (* y (/ (- x t) z)) t)))
   (if (<= z -1.8e+39)
     t_1
     (if (<= z 1.03e+65) (fma y (/ (- t x) (- a z)) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * ((x - t) / z)) + t;
	double tmp;
	if (z <= -1.8e+39) {
		tmp = t_1;
	} else if (z <= 1.03e+65) {
		tmp = fma(y, ((t - x) / (a - z)), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.79999999999999992e39 or 1.03000000000000002e65 < z

   1. Initial program 40.8%

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

   2. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. sub-div N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate-*r/ N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

   4. Applied rewrites 62.3%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. sub-div N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 70.2

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

   7. Applied rewrites 70.2%

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

   if -1.79999999999999992e39 < z < 1.03000000000000002e65

   1. Initial program 87.2%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 90.7

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

   3. Applied rewrites 90.7%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 80.5%

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

Alternative 3: 73.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- t x) (/ (- y z) a) x)))
   (if (<= a -8.8e-33) t_1 (if (<= a 1.1e-89) (+ (* y (/ (- x t) z)) t) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((t - x), ((y - z) / a), x);
	double tmp;
	if (a <= -8.8e-33) {
		tmp = t_1;
	} else if (a <= 1.1e-89) {
		tmp = (y * ((x - t) / z)) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -8.80000000000000022e-33 or 1.10000000000000006e-89 < a

   1. Initial program 68.9%

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

   2. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift--.f64 70.4

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

   4. Applied rewrites 70.4%

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

   if -8.80000000000000022e-33 < a < 1.10000000000000006e-89

   1. Initial program 67.3%

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

   2. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. sub-div N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate-*r/ N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

   4. Applied rewrites 77.1%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. sub-div N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 76.8

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

   7. Applied rewrites 76.8%

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

Alternative 4: 69.1% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t \cdot \frac{y - z}{a - z}\\ t_2 := \mathsf{fma}\left(y, \frac{t - x}{a}, x\right)\\ \mathbf{if}\;a \leq -1.35 \cdot 10^{+99}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq -2.75 \cdot 10^{-33}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 2.2 \cdot 10^{-138}:\\ \;\;\;\;y \cdot \frac{x - t}{z} + t\\ \mathbf{elif}\;a \leq 5.4 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* t (/ (- y z) (- a z)))) (t_2 (fma y (/ (- t x) a) x)))
   (if (<= a -1.35e+99)
     t_2
     (if (<= a -2.75e-33)
       t_1
       (if (<= a 2.2e-138)
         (+ (* y (/ (- x t) z)) t)
         (if (<= a 5.4e-7) t_1 t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t * ((y - z) / (a - z));
	double t_2 = fma(y, ((t - x) / a), x);
	double tmp;
	if (a <= -1.35e+99) {
		tmp = t_2;
	} else if (a <= -2.75e-33) {
		tmp = t_1;
	} else if (a <= 2.2e-138) {
		tmp = (y * ((x - t) / z)) + t;
	} else if (a <= 5.4e-7) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t * Float64(Float64(y - z) / Float64(a - z)))
	t_2 = fma(y, Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -1.35e+99)
		tmp = t_2;
	elseif (a <= -2.75e-33)
		tmp = t_1;
	elseif (a <= 2.2e-138)
		tmp = Float64(Float64(y * Float64(Float64(x - t) / z)) + t);
	elseif (a <= 5.4e-7)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(t * N[(N[(y - z), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -1.35e+99], t$95$2, If[LessEqual[a, -2.75e-33], t$95$1, If[LessEqual[a, 2.2e-138], N[(N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision], If[LessEqual[a, 5.4e-7], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if a < -1.34999999999999994e99 or 5.40000000000000018e-7 < a

   1. Initial program 68.1%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 68.2

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

   4. Applied rewrites 68.2%

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

   if -1.34999999999999994e99 < a < -2.75e-33 or 2.1999999999999999e-138 < a < 5.40000000000000018e-7

   1. Initial program 70.1%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 80.3

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

   3. Applied rewrites 80.3%

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

   4. Taylor expanded in t around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 55.1

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

   6. Applied rewrites 55.1%

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

   if -2.75e-33 < a < 2.1999999999999999e-138

   1. Initial program 67.3%

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

   2. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. sub-div N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate-*r/ N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

   4. Applied rewrites 78.4%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. sub-div N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 78.2

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

   7. Applied rewrites 78.2%

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

Alternative 5: 63.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ (- t x) a) x)))
   (if (<= a -1.35e+99) t_1 (if (<= a 5.4e-7) (* t (/ (- y z) (- a z))) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, ((t - x) / a), x);
	double tmp;
	if (a <= -1.35e+99) {
		tmp = t_1;
	} else if (a <= 5.4e-7) {
		tmp = t * ((y - z) / (a - z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.34999999999999994e99 or 5.40000000000000018e-7 < a

   1. Initial program 68.1%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 68.2

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

   4. Applied rewrites 68.2%

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

   if -1.34999999999999994e99 < a < 5.40000000000000018e-7

   1. Initial program 68.3%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 75.9

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

   3. Applied rewrites 75.9%

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

   4. Taylor expanded in t around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 60.3

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

   6. Applied rewrites 60.3%

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

Alternative 6: 59.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\left(y - z\right) \cdot t}{a - z}\\ t_2 := \mathsf{fma}\left(y, \frac{t - x}{a}, x\right)\\ \mathbf{if}\;a \leq -3.8 \cdot 10^{+20}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;a \leq -8.2 \cdot 10^{-84}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a \leq 1.2 \cdot 10^{-68}:\\ \;\;\;\;\frac{\left(t - x\right) \cdot y}{a - z}\\ \mathbf{elif}\;a \leq 1.25 \cdot 10^{-7}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- y z) t) (- a z))) (t_2 (fma y (/ (- t x) a) x)))
   (if (<= a -3.8e+20)
     t_2
     (if (<= a -8.2e-84)
       t_1
       (if (<= a 1.2e-68)
         (/ (* (- t x) y) (- a z))
         (if (<= a 1.25e-7) t_1 t_2))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((y - z) * t) / (a - z);
	double t_2 = fma(y, ((t - x) / a), x);
	double tmp;
	if (a <= -3.8e+20) {
		tmp = t_2;
	} else if (a <= -8.2e-84) {
		tmp = t_1;
	} else if (a <= 1.2e-68) {
		tmp = ((t - x) * y) / (a - z);
	} else if (a <= 1.25e-7) {
		tmp = t_1;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(y - z) * t) / Float64(a - z))
	t_2 = fma(y, Float64(Float64(t - x) / a), x)
	tmp = 0.0
	if (a <= -3.8e+20)
		tmp = t_2;
	elseif (a <= -8.2e-84)
		tmp = t_1;
	elseif (a <= 1.2e-68)
		tmp = Float64(Float64(Float64(t - x) * y) / Float64(a - z));
	elseif (a <= 1.25e-7)
		tmp = t_1;
	else
		tmp = t_2;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(y - z), $MachinePrecision] * t), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(y * N[(N[(t - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[a, -3.8e+20], t$95$2, If[LessEqual[a, -8.2e-84], t$95$1, If[LessEqual[a, 1.2e-68], N[(N[(N[(t - x), $MachinePrecision] * y), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 1.25e-7], t$95$1, t$95$2]]]]]]

Derivation

1. Split input into 3 regimes

2. if a < -3.8e20 or 1.24999999999999994e-7 < a

   1. Initial program 68.4%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 66.4

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

   4. Applied rewrites 66.4%

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

   if -3.8e20 < a < -8.2000000000000001e-84 or 1.19999999999999996e-68 < a < 1.24999999999999994e-7

   1. Initial program 71.7%

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

   2. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 46.3

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

   4. Applied rewrites 46.3%

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

   if -8.2000000000000001e-84 < a < 1.19999999999999996e-68

   1. Initial program 66.7%

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

   2. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift--.f64 53.6

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

   4. Applied rewrites 53.6%

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

Alternative 7: 58.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ (- t x) a) x)))
   (if (<= a -1.4e-28)
     t_1
     (if (<= a 1.05e-90) (/ (* (- t x) y) (- a z)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, ((t - x) / a), x);
	double tmp;
	if (a <= -1.4e-28) {
		tmp = t_1;
	} else if (a <= 1.05e-90) {
		tmp = ((t - x) * y) / (a - z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.3999999999999999e-28 or 1.05e-90 < a

   1. Initial program 69.0%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 62.6

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

   4. Applied rewrites 62.6%

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

   if -1.3999999999999999e-28 < a < 1.05e-90

   1. Initial program 67.2%

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

   2. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift--.f64 53.0

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

   4. Applied rewrites 53.0%

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

Alternative 8: 58.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2.65 \cdot 10^{+126}:\\ \;\;\;\;t\\ \mathbf{elif}\;z \leq 10^{+66}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{t - x}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -2.65e+126) t (if (<= z 1e+66) (fma y (/ (- t x) a) x) t)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.65000000000000014e126 or 9.99999999999999945e65 < z

   1. Initial program 36.6%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 50.9%

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

   if -2.65000000000000014e126 < z < 9.99999999999999945e65

   1. Initial program 84.5%

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

   2. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 64.4

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

   4. Applied rewrites 64.4%

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

Alternative 9: 49.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -5 \cdot 10^{+71}:\\ \;\;\;\;t\\ \mathbf{elif}\;z \leq -2.05 \cdot 10^{-253}:\\ \;\;\;\;t \cdot \frac{y - z}{a}\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+65}:\\ \;\;\;\;\left(1 - \frac{y}{a}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -5e+71)
   t
   (if (<= z -2.05e-253)
     (* t (/ (- y z) a))
     (if (<= z 4.2e+65) (* (- 1.0 (/ y a)) x) t))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -5e+71) {
		tmp = t;
	} else if (z <= -2.05e-253) {
		tmp = t * ((y - z) / a);
	} else if (z <= 4.2e+65) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z <= (-5d+71)) then
        tmp = t
    else if (z <= (-2.05d-253)) then
        tmp = t * ((y - z) / a)
    else if (z <= 4.2d+65) then
        tmp = (1.0d0 - (y / a)) * x
    else
        tmp = t
    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 <= -5e+71) {
		tmp = t;
	} else if (z <= -2.05e-253) {
		tmp = t * ((y - z) / a);
	} else if (z <= 4.2e+65) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -5e+71:
		tmp = t
	elif z <= -2.05e-253:
		tmp = t * ((y - z) / a)
	elif z <= 4.2e+65:
		tmp = (1.0 - (y / a)) * x
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -5e+71)
		tmp = t;
	elseif (z <= -2.05e-253)
		tmp = Float64(t * Float64(Float64(y - z) / a));
	elseif (z <= 4.2e+65)
		tmp = Float64(Float64(1.0 - Float64(y / a)) * x);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -5e+71)
		tmp = t;
	elseif (z <= -2.05e-253)
		tmp = t * ((y - z) / a);
	elseif (z <= 4.2e+65)
		tmp = (1.0 - (y / a)) * x;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -5e+71], t, If[LessEqual[z, -2.05e-253], N[(t * N[(N[(y - z), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 4.2e+65], N[(N[(1.0 - N[(y / a), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], t]]]

Derivation

1. Split input into 3 regimes

2. if z < -4.99999999999999972e71 or 4.19999999999999983e65 < z

   1. Initial program 39.1%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 48.6%

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

   if -4.99999999999999972e71 < z < -2.05000000000000001e-253

   1. Initial program 85.1%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift--.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 90.4

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

   3. Applied rewrites 90.4%

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

   4. Taylor expanded in t around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 43.4

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

   6. Applied rewrites 43.4%

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

   7. Taylor expanded in z around 0

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

   9. Applied rewrites 28.3%

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

   if -2.05000000000000001e-253 < z < 4.19999999999999983e65

   1. Initial program 87.4%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lift--.f64 57.7

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

   4. Applied rewrites 57.7%

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

   5. Taylor expanded in z around 0

      \[\leadsto \left(1 - \frac{y}{a}\right) \cdot x \]
   6. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. lower-/.f64 52.0

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

   7. Applied rewrites 52.0%

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

Alternative 10: 44.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.85 \cdot 10^{+40}:\\ \;\;\;\;t\\ \mathbf{elif}\;z \leq 4.2 \cdot 10^{+65}:\\ \;\;\;\;\left(1 - \frac{y}{a}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.85e+40) t (if (<= z 4.2e+65) (* (- 1.0 (/ y a)) x) t)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.85e+40) {
		tmp = t;
	} else if (z <= 4.2e+65) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (z <= (-1.85d+40)) then
        tmp = t
    else if (z <= 4.2d+65) then
        tmp = (1.0d0 - (y / a)) * x
    else
        tmp = t
    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 <= -1.85e+40) {
		tmp = t;
	} else if (z <= 4.2e+65) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -1.85e+40:
		tmp = t
	elif z <= 4.2e+65:
		tmp = (1.0 - (y / a)) * x
	else:
		tmp = t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.85e+40)
		tmp = t;
	elseif (z <= 4.2e+65)
		tmp = Float64(Float64(1.0 - Float64(y / a)) * x);
	else
		tmp = t;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -1.85e+40)
		tmp = t;
	elseif (z <= 4.2e+65)
		tmp = (1.0 - (y / a)) * x;
	else
		tmp = t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.85e40 or 4.19999999999999983e65 < z

   1. Initial program 40.7%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 47.4%

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

   if -1.85e40 < z < 4.19999999999999983e65

   1. Initial program 87.2%

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

   2. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 N/A

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

      5. associate-*r/ N/A

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

      6. lower-/.f64 N/A

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

      7. mul-1-neg N/A

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

      8. lower-neg.f64 N/A

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

      9. lift--.f64 N/A

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

      10. lift--.f64 57.8

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

   4. Applied rewrites 57.8%

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

   5. Taylor expanded in z around 0

      \[\leadsto \left(1 - \frac{y}{a}\right) \cdot x \]
   6. Step-by-step derivation

      1. lower--.f64 N/A

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

      2. lower-/.f64 51.3

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

   7. Applied rewrites 51.3%

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

Alternative 11: 42.4% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.55 \cdot 10^{+41}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq -3.8 \cdot 10^{-61}:\\ \;\;\;\;t\\ \mathbf{elif}\;a \leq 8 \cdot 10^{-130}:\\ \;\;\;\;y \cdot \frac{x - t}{z}\\ \mathbf{elif}\;a \leq 220000:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.55e+41)
   x
   (if (<= a -3.8e-61)
     t
     (if (<= a 8e-130) (* y (/ (- x t) z)) (if (<= a 220000.0) t x)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.55e+41) {
		tmp = x;
	} else if (a <= -3.8e-61) {
		tmp = t;
	} else if (a <= 8e-130) {
		tmp = y * ((x - t) / z);
	} else if (a <= 220000.0) {
		tmp = t;
	} 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 (a <= (-2.55d+41)) then
        tmp = x
    else if (a <= (-3.8d-61)) then
        tmp = t
    else if (a <= 8d-130) then
        tmp = y * ((x - t) / z)
    else if (a <= 220000.0d0) then
        tmp = t
    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 (a <= -2.55e+41) {
		tmp = x;
	} else if (a <= -3.8e-61) {
		tmp = t;
	} else if (a <= 8e-130) {
		tmp = y * ((x - t) / z);
	} else if (a <= 220000.0) {
		tmp = t;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -2.55e+41:
		tmp = x
	elif a <= -3.8e-61:
		tmp = t
	elif a <= 8e-130:
		tmp = y * ((x - t) / z)
	elif a <= 220000.0:
		tmp = t
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.55e+41)
		tmp = x;
	elseif (a <= -3.8e-61)
		tmp = t;
	elseif (a <= 8e-130)
		tmp = Float64(y * Float64(Float64(x - t) / z));
	elseif (a <= 220000.0)
		tmp = t;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -2.55e+41)
		tmp = x;
	elseif (a <= -3.8e-61)
		tmp = t;
	elseif (a <= 8e-130)
		tmp = y * ((x - t) / z);
	elseif (a <= 220000.0)
		tmp = t;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.55e+41], x, If[LessEqual[a, -3.8e-61], t, If[LessEqual[a, 8e-130], N[(y * N[(N[(x - t), $MachinePrecision] / z), $MachinePrecision]), $MachinePrecision], If[LessEqual[a, 220000.0], t, x]]]]

Derivation

1. Split input into 3 regimes

2. if a < -2.54999999999999989e41 or 2.2e5 < a

   1. Initial program 68.1%

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

   2. Taylor expanded in a around inf

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

   4. Applied rewrites 44.8%

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

   if -2.54999999999999989e41 < a < -3.7999999999999998e-61 or 8.0000000000000007e-130 < a < 2.2e5

   1. Initial program 71.4%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 29.5%

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

   if -3.7999999999999998e-61 < a < 8.0000000000000007e-130

   1. Initial program 66.8%

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

   2. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

      2. associate-*r/ N/A

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

      3. associate-*r/ N/A

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

      4. sub-div N/A

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

      5. distribute-lft-out-- N/A

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

      6. associate-*r/ N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 N/A

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

   4. Applied rewrites 79.7%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 N/A

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

      2. sub-div N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 46.3

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

   7. Applied rewrites 46.3%

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

Alternative 12: 39.1% accurate, 2.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -2.55 \cdot 10^{+41}:\\ \;\;\;\;x\\ \mathbf{elif}\;a \leq 220000:\\ \;\;\;\;t\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -2.55e+41) x (if (<= a 220000.0) t x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -2.55e+41) {
		tmp = x;
	} else if (a <= 220000.0) {
		tmp = t;
	} 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 (a <= (-2.55d+41)) then
        tmp = x
    else if (a <= 220000.0d0) then
        tmp = t
    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 (a <= -2.55e+41) {
		tmp = x;
	} else if (a <= 220000.0) {
		tmp = t;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -2.55e+41:
		tmp = x
	elif a <= 220000.0:
		tmp = t
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -2.55e+41)
		tmp = x;
	elseif (a <= 220000.0)
		tmp = t;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -2.55e+41)
		tmp = x;
	elseif (a <= 220000.0)
		tmp = t;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -2.55e+41], x, If[LessEqual[a, 220000.0], t, x]]

Derivation

1. Split input into 2 regimes

2. if a < -2.54999999999999989e41 or 2.2e5 < a

   1. Initial program 68.1%

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

   2. Taylor expanded in a around inf

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

   4. Applied rewrites 44.8%

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

   if -2.54999999999999989e41 < a < 2.2e5

   1. Initial program 68.4%

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

   2. Taylor expanded in z around inf

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

   4. Applied rewrites 34.1%

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

Alternative 13: 25.5% accurate, 17.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 68.3%

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

2. Taylor expanded in z around inf

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

4. Applied rewrites 25.5%

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

Reproduce

herbie shell --seed 2025114 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.Axis.Types:invLinMap from Chart-1.5.3"
  :precision binary64
  (+ x (/ (* (- y z) (- t x)) (- a z))))