Numeric.Signal:interpolate from hsignal-0.2.7.1

Percentage Accurate: 80.4% → 93.0%

Time: 6.1s

Alternatives: 17

Speedup: 0.3×

Specification

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \frac{t - x}{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(y - z) * Float64(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[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 80.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x + \left(y - z\right) \cdot \frac{t - x}{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(y - z) * Float64(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[(y - z), $MachinePrecision] * N[(N[(t - x), $MachinePrecision] / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 93.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-273

   1. Initial program 80.4%

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

   3. Applied rewrites 84.8%

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

   if -1e-273 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in z around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower--.f64 46.1

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

   4. Applied rewrites 46.1%

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

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

   1. Initial program 80.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. add-to-fraction N/A

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

      6. div-add N/A

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

      7. mult-flip N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mult-flip N/A

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

      10. div-sub N/A

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

      11. add-flip N/A

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

      12. +-commutative N/A

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

      13. div-add N/A

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

   3. Applied rewrites 84.8%

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

Alternative 2: 93.0% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-273

   1. Initial program 80.4%

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

   3. Applied rewrites 84.9%

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

   if -1e-273 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in z around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower--.f64 46.1

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

   4. Applied rewrites 46.1%

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

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

   1. Initial program 80.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. add-to-fraction N/A

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

      6. div-add N/A

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

      7. mult-flip N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mult-flip N/A

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

      10. div-sub N/A

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

      11. add-flip N/A

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

      12. +-commutative N/A

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

      13. div-add N/A

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

   3. Applied rewrites 84.8%

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

Alternative 3: 93.0% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- z y) (- z a)) (- t x) x))
        (t_2 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_2 -1e-273)
     t_1
     (if (<= t_2 0.0)
       (+ t (* -1.0 (/ (- (* y (- t x)) (* a (- t x))) z)))
       t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-273 or 0.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 80.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. add-to-fraction N/A

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

      6. div-add N/A

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

      7. mult-flip N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mult-flip N/A

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

      10. div-sub N/A

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

      11. add-flip N/A

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

      12. +-commutative N/A

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

      13. div-add N/A

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

   3. Applied rewrites 84.8%

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

   if -1e-273 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in z around -inf

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

      1. lower-+.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-*.f64 N/A

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

      8. lower--.f64 46.1

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

   4. Applied rewrites 46.1%

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

Alternative 4: 90.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- z y) (- z a)) (- t x) x))
        (t_2 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_2 -1e-295)
     t_1
     (if (<= t_2 0.0) (* (* -1.0 (/ (- a y) z)) x) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1.00000000000000006e-295 or 0.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 80.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. add-to-fraction N/A

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

      6. div-add N/A

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

      7. mult-flip N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mult-flip N/A

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

      10. div-sub N/A

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

      11. add-flip N/A

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

      12. +-commutative N/A

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

      13. div-add N/A

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

   3. Applied rewrites 84.8%

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

   if -1.00000000000000006e-295 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 25.0

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

   7. Applied rewrites 25.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. lower-*.f64 N/A

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

   9. Applied rewrites 25.0%

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

   10. Taylor expanded in z around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 N/A

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

       3. lower--.f64 23.2

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

   12. Applied rewrites 23.2%

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

Alternative 5: 86.3% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- x t) (- z a)) (- y z) x))
        (t_2 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_2 -1e-273)
     t_1
     (if (<= t_2 0.0) (* (* -1.0 (/ (- a y) z)) x) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-273 or 0.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 80.4%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*r/ N/A

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

      5. add-to-fraction N/A

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

      6. div-add N/A

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

      7. mult-flip N/A

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

      8. fp-cancel-sign-sub-inv N/A

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

      9. mult-flip N/A

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

      10. div-sub N/A

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

      11. add-flip N/A

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

      12. +-commutative N/A

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

      13. div-add N/A

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

   3. Applied rewrites 80.5%

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

   if -1e-273 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 25.0

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

   7. Applied rewrites 25.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. lower-*.f64 N/A

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

   9. Applied rewrites 25.0%

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

   10. Taylor expanded in z around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 N/A

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

       3. lower--.f64 23.2

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

   12. Applied rewrites 23.2%

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

Alternative 6: 75.9% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{y \cdot \left(x - t\right)}{z - a}\\ t_2 := x + \left(y - z\right) \cdot \frac{t - x}{a - z}\\ t_3 := x + \left(y - z\right) \cdot \frac{t}{a - z}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-273}:\\ \;\;\;\;t\_3\\ \mathbf{elif}\;t\_2 \leq 0:\\ \;\;\;\;\left(-1 \cdot \frac{a - y}{z}\right) \cdot x\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;t\_3\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* y (- x t)) (- z a)))
        (t_2 (+ x (* (- y z) (/ (- t x) (- a z)))))
        (t_3 (+ x (* (- y z) (/ t (- a z))))))
   (if (<= t_2 (- INFINITY))
     t_1
     (if (<= t_2 -1e-273)
       t_3
       (if (<= t_2 0.0)
         (* (* -1.0 (/ (- a y) z)) x)
         (if (<= t_2 2e+299) t_3 t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (x - t)) / (z - a);
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double t_3 = x + ((y - z) * (t / (a - z)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= -1e-273) {
		tmp = t_3;
	} else if (t_2 <= 0.0) {
		tmp = (-1.0 * ((a - y) / z)) * x;
	} else if (t_2 <= 2e+299) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (y * (x - t)) / (z - a);
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double t_3 = x + ((y - z) * (t / (a - z)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= -1e-273) {
		tmp = t_3;
	} else if (t_2 <= 0.0) {
		tmp = (-1.0 * ((a - y) / z)) * x;
	} else if (t_2 <= 2e+299) {
		tmp = t_3;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (y * (x - t)) / (z - a)
	t_2 = x + ((y - z) * ((t - x) / (a - z)))
	t_3 = x + ((y - z) * (t / (a - z)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= -1e-273:
		tmp = t_3
	elif t_2 <= 0.0:
		tmp = (-1.0 * ((a - y) / z)) * x
	elif t_2 <= 2e+299:
		tmp = t_3
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y * Float64(x - t)) / Float64(z - a))
	t_2 = Float64(x + Float64(Float64(y - z) * Float64(Float64(t - x) / Float64(a - z))))
	t_3 = Float64(x + Float64(Float64(y - z) * Float64(t / Float64(a - z))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= -1e-273)
		tmp = t_3;
	elseif (t_2 <= 0.0)
		tmp = Float64(Float64(-1.0 * Float64(Float64(a - y) / z)) * x);
	elseif (t_2 <= 2e+299)
		tmp = t_3;
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (y * (x - t)) / (z - a);
	t_2 = x + ((y - z) * ((t - x) / (a - z)));
	t_3 = x + ((y - z) * (t / (a - z)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_1;
	elseif (t_2 <= -1e-273)
		tmp = t_3;
	elseif (t_2 <= 0.0)
		tmp = (-1.0 * ((a - y) / z)) * x;
	elseif (t_2 <= 2e+299)
		tmp = t_3;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 80.4%

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

   3. Applied rewrites 84.8%

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

   4. Taylor expanded in y around -inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower--.f64 38.0

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

   6. Applied rewrites 38.0%

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

   if -inf.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-273 or 0.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 2.0000000000000001e299

   1. Initial program 80.4%

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

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 64.0%

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

   if -1e-273 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 0.0

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 25.0

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

   7. Applied rewrites 25.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. lower-*.f64 N/A

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

   9. Applied rewrites 25.0%

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

   10. Taylor expanded in z around -inf

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

       1. lower-*.f64 N/A

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

       2. lower-/.f64 N/A

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

       3. lower--.f64 23.2

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

   12. Applied rewrites 23.2%

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

Alternative 7: 68.3% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* (/ (- z y) (- z a)) t)))
   (if (<= z -1.7e+27)
     t_1
     (if (<= z 0.0138) (fma (/ (- x t) a) (- z y) x) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.7e27 or 0.0138 < z

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 51.8

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. sub-div N/A

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

      8. sub-negate-rev N/A

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

      9. lift--.f64 N/A

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

      10. sub-negate-rev N/A

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

      11. lift--.f64 N/A

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

      12. frac-2neg-rev N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 51.8

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

   6. Applied rewrites 51.8%

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

   if -1.7e27 < z < 0.0138

   1. Initial program 80.4%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 51.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lift--.f64 N/A

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

      6. sub-negate-rev N/A

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

      7. distribute-rgt-neg-out N/A

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

      8. distribute-lft-neg-in N/A

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

      9. lift-/.f64 N/A

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

      10. distribute-neg-frac2 N/A

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

      11. lower-fma.f64 N/A

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

      12. lift--.f64 N/A

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

      13. sub-negate-rev N/A

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

      14. lift--.f64 N/A

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

      15. frac-2neg-rev N/A

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

      16. lower-/.f64 N/A

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

      17. lower--.f64 51.8

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

   6. Applied rewrites 51.8%

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

Alternative 8: 64.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ t a) (- y z) x)))
   (if (<= a -3e+124) t_1 (if (<= a 7.2e+24) (* (/ (- z y) (- z a)) t) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -3e124 or 7.19999999999999966e24 < a

   1. Initial program 80.4%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 44.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 44.2

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

   9. Applied rewrites 44.2%

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

   if -3e124 < a < 7.19999999999999966e24

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 51.8

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

      4. lift--.f64 N/A

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

      5. lift-/.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. sub-div N/A

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

      8. sub-negate-rev N/A

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

      9. lift--.f64 N/A

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

      10. sub-negate-rev N/A

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

      11. lift--.f64 N/A

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

      12. frac-2neg-rev N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 51.8

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

   6. Applied rewrites 51.8%

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

Alternative 9: 54.9% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* -1.0 (* -1.0 t))))
   (if (<= z -9e+27) t_1 (if (<= z 8.2e+73) (fma (/ t a) (- y z) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = -1.0 * (-1.0 * t);
	double tmp;
	if (z <= -9e+27) {
		tmp = t_1;
	} else if (z <= 8.2e+73) {
		tmp = fma((t / a), (y - z), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8.9999999999999998e27 or 8.1999999999999996e73 < z

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

   if -8.9999999999999998e27 < z < 8.1999999999999996e73

   1. Initial program 80.4%

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

   2. Taylor expanded in z around 0

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 44.2%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 44.2

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

   9. Applied rewrites 44.2%

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

Alternative 10: 49.1% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* -1.0 (* -1.0 t))))
   (if (<= z -5e+184)
     t_1
     (if (<= z -4.4e-24)
       (+ x t)
       (if (<= z 2.5e+71) (* (- 1.0 (/ y a)) x) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = -1.0 * (-1.0 * t);
	double tmp;
	if (z <= -5e+184) {
		tmp = t_1;
	} else if (z <= -4.4e-24) {
		tmp = x + t;
	} else if (z <= 2.5e+71) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (-1.0d0) * ((-1.0d0) * t)
    if (z <= (-5d+184)) then
        tmp = t_1
    else if (z <= (-4.4d-24)) then
        tmp = x + t
    else if (z <= 2.5d+71) then
        tmp = (1.0d0 - (y / a)) * x
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = -1.0 * (-1.0 * t);
	double tmp;
	if (z <= -5e+184) {
		tmp = t_1;
	} else if (z <= -4.4e-24) {
		tmp = x + t;
	} else if (z <= 2.5e+71) {
		tmp = (1.0 - (y / a)) * x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = -1.0 * (-1.0 * t)
	tmp = 0
	if z <= -5e+184:
		tmp = t_1
	elif z <= -4.4e-24:
		tmp = x + t
	elif z <= 2.5e+71:
		tmp = (1.0 - (y / a)) * x
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(-1.0 * Float64(-1.0 * t))
	tmp = 0.0
	if (z <= -5e+184)
		tmp = t_1;
	elseif (z <= -4.4e-24)
		tmp = Float64(x + t);
	elseif (z <= 2.5e+71)
		tmp = Float64(Float64(1.0 - Float64(y / a)) * x);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = -1.0 * (-1.0 * t);
	tmp = 0.0;
	if (z <= -5e+184)
		tmp = t_1;
	elseif (z <= -4.4e-24)
		tmp = x + t;
	elseif (z <= 2.5e+71)
		tmp = (1.0 - (y / a)) * x;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -4.9999999999999999e184 or 2.49999999999999986e71 < z

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

   if -4.9999999999999999e184 < z < -4.40000000000000003e-24

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -4.40000000000000003e-24 < z < 2.49999999999999986e71

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 25.0

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

   7. Applied rewrites 25.0%

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

      1. lift-*.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. distribute-lft-neg-in N/A

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

      6. lift--.f64 N/A

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

      7. sub-negate-rev N/A

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

      8. lower-*.f64 N/A

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

   9. Applied rewrites 25.0%

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

   10. Taylor expanded in z around 0

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

       1. lower--.f64 N/A

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

       2. lower-/.f64 36.2

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

   12. Applied rewrites 36.2%

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

Alternative 11: 41.7% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_1 (- INFINITY))
     (/ (* x y) z)
     (if (<= t_1 -1e-202)
       (+ x t)
       (if (<= t_1 1e-53)
         (* -1.0 (* -1.0 t))
         (if (<= t_1 400000000.0)
           (/ (* t y) a)
           (if (<= t_1 2e+299) (+ x t) (* t (/ y a)))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = (x * y) / z;
	} else if (t_1 <= -1e-202) {
		tmp = x + t;
	} else if (t_1 <= 1e-53) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_1 <= 400000000.0) {
		tmp = (t * y) / a;
	} else if (t_1 <= 2e+299) {
		tmp = x + t;
	} else {
		tmp = t * (y / a);
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_1 <= -Double.POSITIVE_INFINITY) {
		tmp = (x * y) / z;
	} else if (t_1 <= -1e-202) {
		tmp = x + t;
	} else if (t_1 <= 1e-53) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_1 <= 400000000.0) {
		tmp = (t * y) / a;
	} else if (t_1 <= 2e+299) {
		tmp = x + t;
	} else {
		tmp = t * (y / a);
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + ((y - z) * ((t - x) / (a - z)))
	tmp = 0
	if t_1 <= -math.inf:
		tmp = (x * y) / z
	elif t_1 <= -1e-202:
		tmp = x + t
	elif t_1 <= 1e-53:
		tmp = -1.0 * (-1.0 * t)
	elif t_1 <= 400000000.0:
		tmp = (t * y) / a
	elif t_1 <= 2e+299:
		tmp = x + t
	else:
		tmp = t * (y / a)
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(Float64(y - z) * Float64(Float64(t - x) / Float64(a - z))))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(Float64(x * y) / z);
	elseif (t_1 <= -1e-202)
		tmp = Float64(x + t);
	elseif (t_1 <= 1e-53)
		tmp = Float64(-1.0 * Float64(-1.0 * t));
	elseif (t_1 <= 400000000.0)
		tmp = Float64(Float64(t * y) / a);
	elseif (t_1 <= 2e+299)
		tmp = Float64(x + t);
	else
		tmp = Float64(t * Float64(y / a));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + ((y - z) * ((t - x) / (a - z)));
	tmp = 0.0;
	if (t_1 <= -Inf)
		tmp = (x * y) / z;
	elseif (t_1 <= -1e-202)
		tmp = x + t;
	elseif (t_1 <= 1e-53)
		tmp = -1.0 * (-1.0 * t);
	elseif (t_1 <= 400000000.0)
		tmp = (t * y) / a;
	elseif (t_1 <= 2e+299)
		tmp = x + t;
	else
		tmp = t * (y / a);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 16.6

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

   7. Applied rewrites 16.6%

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

   if -inf.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-202 or 4e8 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 2.0000000000000001e299

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -1e-202 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 1.00000000000000003e-53

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

   if 1.00000000000000003e-53 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 4e8

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 16.6

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

   7. Applied rewrites 16.6%

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

   if 2.0000000000000001e299 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 19.2

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

   7. Applied rewrites 19.2%

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

Alternative 12: 41.5% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t \cdot y}{a}\\ t_2 := x + \left(y - z\right) \cdot \frac{t - x}{a - z}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\ \;\;\;\;x + t\\ \mathbf{elif}\;t\_2 \leq 10^{-53}:\\ \;\;\;\;-1 \cdot \left(-1 \cdot t\right)\\ \mathbf{elif}\;t\_2 \leq 400000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;x + t\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* t y) a)) (t_2 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_2 (- INFINITY))
     (/ (* x y) z)
     (if (<= t_2 -1e-202)
       (+ x t)
       (if (<= t_2 1e-53)
         (* -1.0 (* -1.0 t))
         (if (<= t_2 400000000.0) t_1 (if (<= t_2 2e+299) (+ x t) t_1)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (t * y) / a;
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = (x * y) / z;
	} else if (t_2 <= -1e-202) {
		tmp = x + t;
	} else if (t_2 <= 1e-53) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_2 <= 400000000.0) {
		tmp = t_1;
	} else if (t_2 <= 2e+299) {
		tmp = x + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (t * y) / a;
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = (x * y) / z;
	} else if (t_2 <= -1e-202) {
		tmp = x + t;
	} else if (t_2 <= 1e-53) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_2 <= 400000000.0) {
		tmp = t_1;
	} else if (t_2 <= 2e+299) {
		tmp = x + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (t * y) / a
	t_2 = x + ((y - z) * ((t - x) / (a - z)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = (x * y) / z
	elif t_2 <= -1e-202:
		tmp = x + t
	elif t_2 <= 1e-53:
		tmp = -1.0 * (-1.0 * t)
	elif t_2 <= 400000000.0:
		tmp = t_1
	elif t_2 <= 2e+299:
		tmp = x + t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(t * y) / a)
	t_2 = Float64(x + Float64(Float64(y - z) * Float64(Float64(t - x) / Float64(a - z))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = Float64(Float64(x * y) / z);
	elseif (t_2 <= -1e-202)
		tmp = Float64(x + t);
	elseif (t_2 <= 1e-53)
		tmp = Float64(-1.0 * Float64(-1.0 * t));
	elseif (t_2 <= 400000000.0)
		tmp = t_1;
	elseif (t_2 <= 2e+299)
		tmp = Float64(x + t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (t * y) / a;
	t_2 = x + ((y - z) * ((t - x) / (a - z)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = (x * y) / z;
	elseif (t_2 <= -1e-202)
		tmp = x + t;
	elseif (t_2 <= 1e-53)
		tmp = -1.0 * (-1.0 * t);
	elseif (t_2 <= 400000000.0)
		tmp = t_1;
	elseif (t_2 <= 2e+299)
		tmp = x + t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 16.6

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

   7. Applied rewrites 16.6%

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

   if -inf.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-202 or 4e8 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 2.0000000000000001e299

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -1e-202 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 1.00000000000000003e-53

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

   if 1.00000000000000003e-53 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 4e8 or 2.0000000000000001e299 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z))))

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 16.6

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

   7. Applied rewrites 16.6%

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

Alternative 13: 41.2% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* -1.0 (* -1.0 t))))
   (if (<= z -5e+184)
     t_1
     (if (<= z -9e-32) (+ x t) (if (<= z 1.1e+68) (* y (/ t (- a z))) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = -1.0 * (-1.0 * t);
	double tmp;
	if (z <= -5e+184) {
		tmp = t_1;
	} else if (z <= -9e-32) {
		tmp = x + t;
	} else if (z <= 1.1e+68) {
		tmp = y * (t / (a - z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (-1.0d0) * ((-1.0d0) * t)
    if (z <= (-5d+184)) then
        tmp = t_1
    else if (z <= (-9d-32)) then
        tmp = x + t
    else if (z <= 1.1d+68) then
        tmp = y * (t / (a - z))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = -1.0 * (-1.0 * t);
	double tmp;
	if (z <= -5e+184) {
		tmp = t_1;
	} else if (z <= -9e-32) {
		tmp = x + t;
	} else if (z <= 1.1e+68) {
		tmp = y * (t / (a - z));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = -1.0 * (-1.0 * t)
	tmp = 0
	if z <= -5e+184:
		tmp = t_1
	elif z <= -9e-32:
		tmp = x + t
	elif z <= 1.1e+68:
		tmp = y * (t / (a - z))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(-1.0 * Float64(-1.0 * t))
	tmp = 0.0
	if (z <= -5e+184)
		tmp = t_1;
	elseif (z <= -9e-32)
		tmp = Float64(x + t);
	elseif (z <= 1.1e+68)
		tmp = Float64(y * Float64(t / Float64(a - z)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = -1.0 * (-1.0 * t);
	tmp = 0.0;
	if (z <= -5e+184)
		tmp = t_1;
	elseif (z <= -9e-32)
		tmp = x + t;
	elseif (z <= 1.1e+68)
		tmp = y * (t / (a - z));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if z < -4.9999999999999999e184 or 1.09999999999999994e68 < z

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

   if -4.9999999999999999e184 < z < -9.00000000000000009e-32

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -9.00000000000000009e-32 < z < 1.09999999999999994e68

   1. Initial program 80.4%

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

   2. Taylor expanded in t around inf

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 51.8

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

   4. Applied rewrites 51.8%

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

   5. Taylor expanded in y around inf

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 21.3

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

   7. Applied rewrites 21.3%

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

      1. lift--.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. associate-/l* N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift--.f64 23.1

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

   9. Applied rewrites 23.1%

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

Alternative 14: 38.7% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x \cdot y}{z}\\ t_2 := x + \left(y - z\right) \cdot \frac{t - x}{a - z}\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq -1 \cdot 10^{-202}:\\ \;\;\;\;x + t\\ \mathbf{elif}\;t\_2 \leq 400000000:\\ \;\;\;\;-1 \cdot \left(-1 \cdot t\right)\\ \mathbf{elif}\;t\_2 \leq 2 \cdot 10^{+299}:\\ \;\;\;\;x + t\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* x y) z)) (t_2 (+ x (* (- y z) (/ (- t x) (- a z))))))
   (if (<= t_2 (- INFINITY))
     t_1
     (if (<= t_2 -1e-202)
       (+ x t)
       (if (<= t_2 400000000.0)
         (* -1.0 (* -1.0 t))
         (if (<= t_2 2e+299) (+ x t) t_1))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (x * y) / z;
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_2 <= -((double) INFINITY)) {
		tmp = t_1;
	} else if (t_2 <= -1e-202) {
		tmp = x + t;
	} else if (t_2 <= 400000000.0) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_2 <= 2e+299) {
		tmp = x + t;
	} 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;
	double t_2 = x + ((y - z) * ((t - x) / (a - z)));
	double tmp;
	if (t_2 <= -Double.POSITIVE_INFINITY) {
		tmp = t_1;
	} else if (t_2 <= -1e-202) {
		tmp = x + t;
	} else if (t_2 <= 400000000.0) {
		tmp = -1.0 * (-1.0 * t);
	} else if (t_2 <= 2e+299) {
		tmp = x + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (x * y) / z
	t_2 = x + ((y - z) * ((t - x) / (a - z)))
	tmp = 0
	if t_2 <= -math.inf:
		tmp = t_1
	elif t_2 <= -1e-202:
		tmp = x + t
	elif t_2 <= 400000000.0:
		tmp = -1.0 * (-1.0 * t)
	elif t_2 <= 2e+299:
		tmp = x + t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(x * y) / z)
	t_2 = Float64(x + Float64(Float64(y - z) * Float64(Float64(t - x) / Float64(a - z))))
	tmp = 0.0
	if (t_2 <= Float64(-Inf))
		tmp = t_1;
	elseif (t_2 <= -1e-202)
		tmp = Float64(x + t);
	elseif (t_2 <= 400000000.0)
		tmp = Float64(-1.0 * Float64(-1.0 * t));
	elseif (t_2 <= 2e+299)
		tmp = Float64(x + t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = (x * y) / z;
	t_2 = x + ((y - z) * ((t - x) / (a - z)));
	tmp = 0.0;
	if (t_2 <= -Inf)
		tmp = t_1;
	elseif (t_2 <= -1e-202)
		tmp = x + t;
	elseif (t_2 <= 400000000.0)
		tmp = -1.0 * (-1.0 * t);
	elseif (t_2 <= 2e+299)
		tmp = x + t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in a around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 16.6

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

   7. Applied rewrites 16.6%

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

   if -inf.0 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < -1e-202 or 4e8 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 2.0000000000000001e299

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -1e-202 < (+.f64 x (*.f64 (-.f64 y z) (/.f64 (-.f64 t x) (-.f64 a z)))) < 4e8

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

Alternative 15: 38.5% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -1.16 \cdot 10^{+29}:\\ \;\;\;\;x \cdot 1\\ \mathbf{elif}\;a \leq 7.2 \cdot 10^{+24}:\\ \;\;\;\;-1 \cdot \left(-1 \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.16e+29)
   (* x 1.0)
   (if (<= a 7.2e+24) (* -1.0 (* -1.0 t)) (* x 1.0))))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if a <= -1.16e+29:
		tmp = x * 1.0
	elif a <= 7.2e+24:
		tmp = -1.0 * (-1.0 * t)
	else:
		tmp = x * 1.0
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -1.16e+29)
		tmp = Float64(x * 1.0);
	elseif (a <= 7.2e+24)
		tmp = Float64(-1.0 * Float64(-1.0 * t));
	else
		tmp = Float64(x * 1.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (a <= -1.16e+29)
		tmp = x * 1.0;
	elseif (a <= 7.2e+24)
		tmp = -1.0 * (-1.0 * t);
	else
		tmp = x * 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[a, -1.16e+29], N[(x * 1.0), $MachinePrecision], If[LessEqual[a, 7.2e+24], N[(-1.0 * N[(-1.0 * t), $MachinePrecision]), $MachinePrecision], N[(x * 1.0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if a < -1.16e29 or 7.19999999999999966e24 < a

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 25.3

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

   7. Applied rewrites 25.3%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 25.0%

       \[\leadsto x \cdot 1 \]

   if -1.16e29 < a < 7.19999999999999966e24

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

   4. Applied rewrites 71.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-*.f64 25.4

         \[\leadsto -1 \cdot \left(-1 \cdot t\right) \]

   7. Applied rewrites 25.4%

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

Alternative 16: 37.1% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.3 \cdot 10^{-31}:\\ \;\;\;\;x + t\\ \mathbf{elif}\;z \leq 2.8 \cdot 10^{-34}:\\ \;\;\;\;x \cdot 1\\ \mathbf{else}:\\ \;\;\;\;x + t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -3.3e-31) (+ x t) (if (<= z 2.8e-34) (* x 1.0) (+ x t))))

C

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

Python

def code(x, y, z, t, a):
	tmp = 0
	if z <= -3.3e-31:
		tmp = x + t
	elif z <= 2.8e-34:
		tmp = x * 1.0
	else:
		tmp = x + t
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -3.3e-31)
		tmp = Float64(x + t);
	elseif (z <= 2.8e-34)
		tmp = Float64(x * 1.0);
	else
		tmp = Float64(x + t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (z <= -3.3e-31)
		tmp = x + t;
	elseif (z <= 2.8e-34)
		tmp = x * 1.0;
	else
		tmp = x + t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -3.3e-31], N[(x + t), $MachinePrecision], If[LessEqual[z, 2.8e-34], N[(x * 1.0), $MachinePrecision], N[(x + t), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -3.2999999999999999e-31 or 2.79999999999999997e-34 < z

   1. Initial program 80.4%

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

   2. Taylor expanded in z around inf

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

      1. lower--.f64 19.8

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

   4. Applied rewrites 19.8%

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

   5. Taylor expanded in x around 0

      \[\leadsto x + t \]
   6. Step-by-step derivation

   7. Applied rewrites 33.7%

      \[\leadsto x + t \]

   if -3.2999999999999999e-31 < z < 2.79999999999999997e-34

   1. Initial program 80.4%

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

   2. Taylor expanded in x around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-+.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 46.8

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

   4. Applied rewrites 46.8%

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

   5. Taylor expanded in y around 0

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

      1. lower-*.f64 N/A

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

      2. lower-+.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 25.3

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

   7. Applied rewrites 25.3%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 25.0%

       \[\leadsto x \cdot 1 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 17: 33.7% accurate, 4.8× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 80.4%

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

2. Taylor expanded in z around inf

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

   1. lower--.f64 19.8

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

4. Applied rewrites 19.8%

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

5. Taylor expanded in x around 0

   \[\leadsto x + t \]
6. Step-by-step derivation

7. Applied rewrites 33.7%

   \[\leadsto x + t \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025149 
(FPCore (x y z t a)
  :name "Numeric.Signal:interpolate   from hsignal-0.2.7.1"
  :precision binary64
  (+ x (* (- y z) (/ (- t x) (- a z)))))