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

Percentage Accurate: 68.0% → 91.2%

Time: 9.9s

Alternatives: 13

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 91.2% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 72.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 86.5

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

   4. Applied rewrites 86.5%

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

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

   1. Initial program 3.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 3.7

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

   4. Applied rewrites 3.7%

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

   5. Taylor expanded in t around -inf

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

      1. lower-+.f64 N/A

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

      2. mul-1-neg N/A

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

      3. lower-neg.f64 N/A

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

      4. lower-/.f64 N/A

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

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

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

      6. lower-*.f64 N/A

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

      7. lift--.f64 N/A

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

      8. lower--.f64 99.7

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

   7. Applied rewrites 99.7%

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

4. Final simplification 87.4%

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

Alternative 2: 57.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{\left(y - x\right) \cdot z}{a - t}\\ \mathbf{if}\;t \leq -1.56 \cdot 10^{+146}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq -6.3 \cdot 10^{+43}:\\ \;\;\;\;\mathsf{fma}\left(y - x, \frac{z}{a}, x\right)\\ \mathbf{elif}\;t \leq -2 \cdot 10^{-65}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 0.0205:\\ \;\;\;\;\mathsf{fma}\left(z, \frac{y - x}{a}, x\right)\\ \mathbf{elif}\;t \leq 3 \cdot 10^{+206}:\\ \;\;\;\;t\_1\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (* (- y x) z) (- a t))))
   (if (<= t -1.56e+146)
     y
     (if (<= t -6.3e+43)
       (fma (- y x) (/ z a) x)
       (if (<= t -2e-65)
         t_1
         (if (<= t 0.0205)
           (fma z (/ (- y x) a) x)
           (if (<= t 3e+206) t_1 y)))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = ((y - x) * z) / (a - t);
	double tmp;
	if (t <= -1.56e+146) {
		tmp = y;
	} else if (t <= -6.3e+43) {
		tmp = fma((y - x), (z / a), x);
	} else if (t <= -2e-65) {
		tmp = t_1;
	} else if (t <= 0.0205) {
		tmp = fma(z, ((y - x) / a), x);
	} else if (t <= 3e+206) {
		tmp = t_1;
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(Float64(y - x) * z) / Float64(a - t))
	tmp = 0.0
	if (t <= -1.56e+146)
		tmp = y;
	elseif (t <= -6.3e+43)
		tmp = fma(Float64(y - x), Float64(z / a), x);
	elseif (t <= -2e-65)
		tmp = t_1;
	elseif (t <= 0.0205)
		tmp = fma(z, Float64(Float64(y - x) / a), x);
	elseif (t <= 3e+206)
		tmp = t_1;
	else
		tmp = y;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := Block[{t$95$1 = N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t, -1.56e+146], y, If[LessEqual[t, -6.3e+43], N[(N[(y - x), $MachinePrecision] * N[(z / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t, -2e-65], t$95$1, If[LessEqual[t, 0.0205], N[(z * N[(N[(y - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t, 3e+206], t$95$1, y]]]]]]

Derivation

1. Split input into 4 regimes

2. if t < -1.5599999999999999e146 or 3.0000000000000001e206 < t

   1. Initial program 27.0%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 73.9%

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

   if -1.5599999999999999e146 < t < -6.2999999999999998e43

   1. Initial program 51.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 68.5

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

   4. Applied rewrites 68.5%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 55.7

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

   7. Applied rewrites 55.7%

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

   if -6.2999999999999998e43 < t < -1.99999999999999985e-65 or 0.0205000000000000009 < t < 3.0000000000000001e206

   1. Initial program 79.1%

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

   3. Taylor expanded in z around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift--.f64 57.2

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

   5. Applied rewrites 57.2%

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

   if -1.99999999999999985e-65 < t < 0.0205000000000000009

   1. Initial program 89.6%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 76.2

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

   5. Applied rewrites 76.2%

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

4. Final simplification 69.2%

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

Alternative 3: 64.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (* y (/ (- z t) (- a t)))))
   (if (<= t -1.45e+31)
     t_1
     (if (<= t -1.6e-219)
       (* z (/ (- y x) (- a t)))
       (if (<= t 3.6e-64) (fma (- y x) (/ z a) x) t_1)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = y * ((z - t) / (a - t));
	double tmp;
	if (t <= -1.45e+31) {
		tmp = t_1;
	} else if (t <= -1.6e-219) {
		tmp = z * ((y - x) / (a - t));
	} else if (t <= 3.6e-64) {
		tmp = fma((y - x), (z / a), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(y * Float64(Float64(z - t) / Float64(a - t)))
	tmp = 0.0
	if (t <= -1.45e+31)
		tmp = t_1;
	elseif (t <= -1.6e-219)
		tmp = Float64(z * Float64(Float64(y - x) / Float64(a - t)));
	elseif (t <= 3.6e-64)
		tmp = fma(Float64(y - x), Float64(z / a), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -1.45e31 or 3.5999999999999998e-64 < t

   1. Initial program 49.5%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 68.7

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

   4. Applied rewrites 68.7%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 61.3

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

   7. Applied rewrites 61.3%

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

   if -1.45e31 < t < -1.59999999999999999e-219

   1. Initial program 86.6%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 91.1

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

   4. Applied rewrites 91.1%

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

   5. Taylor expanded in z around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 68.8

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

   7. Applied rewrites 68.8%

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

   if -1.59999999999999999e-219 < t < 3.5999999999999998e-64

   1. Initial program 91.4%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 97.4

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

   4. Applied rewrites 97.4%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 81.9

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

   7. Applied rewrites 81.9%

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

Alternative 4: 57.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.56 \cdot 10^{+146}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 2.1 \cdot 10^{+16}:\\ \;\;\;\;\mathsf{fma}\left(z, \frac{y - x}{a}, x\right)\\ \mathbf{elif}\;t \leq 3 \cdot 10^{+206}:\\ \;\;\;\;\frac{z \cdot \left(y - x\right)}{-t}\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.56e+146)
   y
   (if (<= t 2.1e+16)
     (fma z (/ (- y x) a) x)
     (if (<= t 3e+206) (/ (* z (- y x)) (- t)) y))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.56e+146) {
		tmp = y;
	} else if (t <= 2.1e+16) {
		tmp = fma(z, ((y - x) / a), x);
	} else if (t <= 3e+206) {
		tmp = (z * (y - x)) / -t;
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.56e+146)
		tmp = y;
	elseif (t <= 2.1e+16)
		tmp = fma(z, Float64(Float64(y - x) / a), x);
	elseif (t <= 3e+206)
		tmp = Float64(Float64(z * Float64(y - x)) / Float64(-t));
	else
		tmp = y;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.56e+146], y, If[LessEqual[t, 2.1e+16], N[(z * N[(N[(y - x), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t, 3e+206], N[(N[(z * N[(y - x), $MachinePrecision]), $MachinePrecision] / (-t)), $MachinePrecision], y]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.5599999999999999e146 or 3.0000000000000001e206 < t

   1. Initial program 27.0%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 73.9%

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

   if -1.5599999999999999e146 < t < 2.1e16

   1. Initial program 84.3%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 65.3

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

   5. Applied rewrites 65.3%

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

   if 2.1e16 < t < 3.0000000000000001e206

   1. Initial program 68.8%

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

   3. Taylor expanded in z around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lift--.f64 N/A

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

      7. lift--.f64 52.5

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

   5. Applied rewrites 52.5%

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

   6. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower-*.f64 N/A

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

      5. lift--.f64 49.6

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

   8. Applied rewrites 49.6%

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

4. Final simplification 65.3%

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

Alternative 5: 68.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -2.9 \cdot 10^{+101} \lor \neg \left(t \leq 1.12 \cdot 10^{+19}\right):\\ \;\;\;\;y \cdot \frac{z - t}{a - t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(y - x, \frac{z - t}{a}, x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -2.9e+101) (not (<= t 1.12e+19)))
   (* y (/ (- z t) (- a t)))
   (fma (- y x) (/ (- z t) a) x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -2.9e+101) || !(t <= 1.12e+19)) {
		tmp = y * ((z - t) / (a - t));
	} else {
		tmp = fma((y - x), ((z - t) / a), x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -2.9e+101) || !(t <= 1.12e+19))
		tmp = Float64(y * Float64(Float64(z - t) / Float64(a - t)));
	else
		tmp = fma(Float64(y - x), Float64(Float64(z - t) / a), x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -2.9e+101], N[Not[LessEqual[t, 1.12e+19]], $MachinePrecision]], N[(y * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y - x), $MachinePrecision] * N[(N[(z - t), $MachinePrecision] / a), $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -2.89999999999999987e101 or 1.12e19 < t

   1. Initial program 41.7%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 64.5

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

   4. Applied rewrites 64.5%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 66.6

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

   7. Applied rewrites 66.6%

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

   if -2.89999999999999987e101 < t < 1.12e19

   1. Initial program 85.7%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lift--.f64 69.8

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

   5. Applied rewrites 69.8%

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

4. Final simplification 68.5%

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

Alternative 6: 64.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;a \leq -0.0058 \lor \neg \left(a \leq 6.8 \cdot 10^{+92}\right):\\ \;\;\;\;\mathsf{fma}\left(y - x, \frac{z}{a}, x\right)\\ \mathbf{else}:\\ \;\;\;\;y \cdot \frac{z - t}{a - t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= a -0.0058) (not (<= a 6.8e+92)))
   (fma (- y x) (/ z a) x)
   (* y (/ (- z t) (- a t)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((a <= -0.0058) || !(a <= 6.8e+92)) {
		tmp = fma((y - x), (z / a), x);
	} else {
		tmp = y * ((z - t) / (a - t));
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((a <= -0.0058) || !(a <= 6.8e+92))
		tmp = fma(Float64(y - x), Float64(z / a), x);
	else
		tmp = Float64(y * Float64(Float64(z - t) / Float64(a - t)));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[a, -0.0058], N[Not[LessEqual[a, 6.8e+92]], $MachinePrecision]], N[(N[(y - x), $MachinePrecision] * N[(z / a), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(N[(z - t), $MachinePrecision] / N[(a - t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if a < -0.0058 or 6.7999999999999996e92 < a

   1. Initial program 64.3%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 86.3

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

   4. Applied rewrites 86.3%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 71.1

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

   7. Applied rewrites 71.1%

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

   if -0.0058 < a < 6.7999999999999996e92

   1. Initial program 70.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 77.5

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

   4. Applied rewrites 77.5%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 64.1

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

   7. Applied rewrites 64.1%

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

4. Final simplification 66.9%

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

Alternative 7: 60.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.56e+146) y (if (<= t 1.05e+107) (fma (- y x) (/ z a) x) y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.56e+146) {
		tmp = y;
	} else if (t <= 1.05e+107) {
		tmp = fma((y - x), (z / a), x);
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.56e+146)
		tmp = y;
	elseif (t <= 1.05e+107)
		tmp = fma(Float64(y - x), Float64(z / a), x);
	else
		tmp = y;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.5599999999999999e146 or 1.05e107 < t

   1. Initial program 32.3%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 65.0%

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

   if -1.5599999999999999e146 < t < 1.05e107

   1. Initial program 83.0%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 89.9

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

   4. Applied rewrites 89.9%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 61.9

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

   7. Applied rewrites 61.9%

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

4. Final simplification 62.8%

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

Alternative 8: 59.7% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.56e+146) y (if (<= t 1.05e+107) (fma z (/ (- y x) a) x) y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.56e+146) {
		tmp = y;
	} else if (t <= 1.05e+107) {
		tmp = fma(z, ((y - x) / a), x);
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.56e+146)
		tmp = y;
	elseif (t <= 1.05e+107)
		tmp = fma(z, Float64(Float64(y - x) / a), x);
	else
		tmp = y;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.5599999999999999e146 or 1.05e107 < t

   1. Initial program 32.3%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 65.0%

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

   if -1.5599999999999999e146 < t < 1.05e107

   1. Initial program 83.0%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 61.3

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

   5. Applied rewrites 61.3%

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

4. Final simplification 62.4%

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

Alternative 9: 85.2% accurate, 0.9× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.9500000000000001e199

   1. Initial program 24.0%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 42.5

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

   4. Applied rewrites 42.5%

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

   5. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 83.3

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

   7. Applied rewrites 83.3%

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

   if -1.9500000000000001e199 < t

   1. Initial program 73.8%

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

      1. lift-+.f64 N/A

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

      2. lift--.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. lift--.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. +-commutative N/A

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

      8. associate-/l* N/A

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

      9. sub-div N/A

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

      10. lower-fma.f64 N/A

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

      11. lift--.f64 N/A

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

      12. sub-div N/A

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

      13. lower-/.f64 N/A

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

      14. lift--.f64 N/A

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

      15. lift--.f64 85.9

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

   4. Applied rewrites 85.9%

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

Alternative 10: 51.5% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.45e+146) y (if (<= t 1.35e+165) (fma z (/ y a) x) y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.45e+146) {
		tmp = y;
	} else if (t <= 1.35e+165) {
		tmp = fma(z, (y / a), x);
	} else {
		tmp = y;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.45e+146)
		tmp = y;
	elseif (t <= 1.35e+165)
		tmp = fma(z, Float64(y / a), x);
	else
		tmp = y;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.4499999999999999e146 or 1.35e165 < t

   1. Initial program 30.1%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 71.0%

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

   if -1.4499999999999999e146 < t < 1.35e165

   1. Initial program 81.7%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 59.3

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

   5. Applied rewrites 59.3%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 51.2%

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

4. Final simplification 56.4%

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

Alternative 11: 39.5% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.3 \cdot 10^{+101}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 8.6 \cdot 10^{-157}:\\ \;\;\;\;x\\ \mathbf{elif}\;t \leq 2.55 \cdot 10^{+217}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.3e+101)
   y
   (if (<= t 8.6e-157) x (if (<= t 2.55e+217) (+ x y) y))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.3e+101) {
		tmp = y;
	} else if (t <= 8.6e-157) {
		tmp = x;
	} else if (t <= 2.55e+217) {
		tmp = x + y;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= (-1.3d+101)) then
        tmp = y
    else if (t <= 8.6d-157) then
        tmp = x
    else if (t <= 2.55d+217) then
        tmp = x + y
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.3e+101) {
		tmp = y;
	} else if (t <= 8.6e-157) {
		tmp = x;
	} else if (t <= 2.55e+217) {
		tmp = x + y;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -1.3e+101:
		tmp = y
	elif t <= 8.6e-157:
		tmp = x
	elif t <= 2.55e+217:
		tmp = x + y
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.3e+101)
		tmp = y;
	elseif (t <= 8.6e-157)
		tmp = x;
	elseif (t <= 2.55e+217)
		tmp = Float64(x + y);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -1.3e+101)
		tmp = y;
	elseif (t <= 8.6e-157)
		tmp = x;
	elseif (t <= 2.55e+217)
		tmp = x + y;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.3e+101], y, If[LessEqual[t, 8.6e-157], x, If[LessEqual[t, 2.55e+217], N[(x + y), $MachinePrecision], y]]]

Derivation

1. Split input into 3 regimes

2. if t < -1.3e101 or 2.5500000000000002e217 < t

   1. Initial program 28.6%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 71.3%

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

   if -1.3e101 < t < 8.5999999999999995e-157

   1. Initial program 85.6%

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

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 37.8%

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

   if 8.5999999999999995e-157 < t < 2.5500000000000002e217

   1. Initial program 77.1%

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

   3. Taylor expanded in t around inf

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

      1. lift--.f64 16.8

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

   5. Applied rewrites 16.8%

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

   6. Taylor expanded in x around 0

      \[\leadsto x + y \]
   7. Step-by-step derivation

   8. Applied rewrites 30.8%

      \[\leadsto x + y \]
3. Recombined 3 regimes into one program.

4. Final simplification 44.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.3 \cdot 10^{+101}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 8.6 \cdot 10^{-157}:\\ \;\;\;\;x\\ \mathbf{elif}\;t \leq 2.55 \cdot 10^{+217}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 12: 38.2% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -1.3 \cdot 10^{+101}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 1.4 \cdot 10^{+169}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -1.3e+101) y (if (<= t 1.4e+169) x y)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.3e+101) {
		tmp = y;
	} else if (t <= 1.4e+169) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8) :: tmp
    if (t <= (-1.3d+101)) then
        tmp = y
    else if (t <= 1.4d+169) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -1.3e+101) {
		tmp = y;
	} else if (t <= 1.4e+169) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if t <= -1.3e+101:
		tmp = y
	elif t <= 1.4e+169:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (t <= -1.3e+101)
		tmp = y;
	elseif (t <= 1.4e+169)
		tmp = x;
	else
		tmp = y;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	tmp = 0.0;
	if (t <= -1.3e+101)
		tmp = y;
	elseif (t <= 1.4e+169)
		tmp = x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[t, -1.3e+101], y, If[LessEqual[t, 1.4e+169], x, y]]

Derivation

1. Split input into 2 regimes

2. if t < -1.3e101 or 1.4000000000000001e169 < t

   1. Initial program 32.4%

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

   3. Taylor expanded in t around inf

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

   5. Applied rewrites 66.5%

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

   if -1.3e101 < t < 1.4000000000000001e169

   1. Initial program 83.0%

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

   3. Taylor expanded in a around inf

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

   5. Applied rewrites 32.9%

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

4. Final simplification 42.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -1.3 \cdot 10^{+101}:\\ \;\;\;\;y\\ \mathbf{elif}\;t \leq 1.4 \cdot 10^{+169}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 13: 25.7% accurate, 29.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 68.2%

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

3. Taylor expanded in a around inf

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

5. Applied rewrites 25.4%

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

6. Final simplification 25.4%

   \[\leadsto x \]
7. Add Preprocessing

Developer Target 1: 86.8% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \frac{y - x}{1} \cdot \frac{z - t}{a - t}\\ \mathbf{if}\;a < -1.6153062845442575 \cdot 10^{-142}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;a < 3.774403170083174 \cdot 10^{-182}:\\ \;\;\;\;y - \frac{z}{t} \cdot \left(y - x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* (/ (- y x) 1.0) (/ (- z t) (- a t))))))
   (if (< a -1.6153062845442575e-142)
     t_1
     (if (< a 3.774403170083174e-182) (- y (* (/ z t) (- y x))) t_1))))

C

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

Python

def code(x, y, z, t, a):
	t_1 = x + (((y - x) / 1.0) * ((z - t) / (a - t)))
	tmp = 0
	if a < -1.6153062845442575e-142:
		tmp = t_1
	elif a < 3.774403170083174e-182:
		tmp = y - ((z / t) * (y - x))
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (((y - x) / 1.0) * ((z - t) / (a - t)));
	tmp = 0.0;
	if (a < -1.6153062845442575e-142)
		tmp = t_1;
	elseif (a < 3.774403170083174e-182)
		tmp = y - ((z / t) * (y - x));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

herbie shell --seed 2025046 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.Axis.Types:linMap from Chart-1.5.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< a -646122513817703/4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ x (* (/ (- y x) 1) (/ (- z t) (- a t)))) (if (< a 1887201585041587/50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- y (* (/ z t) (- y x))) (+ x (* (/ (- y x) 1) (/ (- z t) (- a t)))))))

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