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

Percentage Accurate: 98.1% → 98.1%

Time: 8.7s

Alternatives: 15

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.1% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t, a)
    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 = (((z - t) / (z - a)) * y) + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

3. Final simplification 98.8%

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

Alternative 2: 96.7% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -1e5 or 2 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.6%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 96.6

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

   4. Applied rewrites 96.6%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 95.3

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

   7. Applied rewrites 95.3%

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

   8. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 91.3

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

   10. Applied rewrites 91.3%

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

   if -1e5 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20

   1. Initial program 99.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 98.6

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

   5. Applied rewrites 98.6%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2

   1. Initial program 100.0%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 99.7

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

   5. Applied rewrites 99.7%

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

4. Final simplification 96.4%

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

Alternative 3: 87.6% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -2e+38)
     (* (/ t (- a z)) y)
     (if (<= t_1 1e-19)
       (fma (- t z) (/ y a) x)
       (if (<= t_1 1e+20) (fma (/ z (- z a)) y x) (* (/ y (- a z)) t))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -2e+38) {
		tmp = (t / (a - z)) * y;
	} else if (t_1 <= 1e-19) {
		tmp = fma((t - z), (y / a), x);
	} else if (t_1 <= 1e+20) {
		tmp = fma((z / (z - a)), y, x);
	} else {
		tmp = (y / (a - z)) * t;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 97.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 75.9

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

   7. Applied rewrites 75.9%

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

   if -1.99999999999999995e38 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20

   1. Initial program 99.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 95.0

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

   5. Applied rewrites 95.0%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1e20

   1. Initial program 99.9%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 98.0

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

   5. Applied rewrites 98.0%

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

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

   1. Initial program 94.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 94.1

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

   4. Applied rewrites 94.1%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 93.8

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

   7. Applied rewrites 93.8%

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

   8. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 70.9

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

   10. Applied rewrites 70.9%

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

4. Final simplification 89.8%

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

Alternative 4: 87.9% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 97.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 75.9

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

   7. Applied rewrites 75.9%

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

   if -1.99999999999999995e38 < (/.f64 (-.f64 z t) (-.f64 z a)) < 0.0200000000000000004

   1. Initial program 99.8%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

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

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. sub-neg N/A

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

      10. +-commutative N/A

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

      11. distribute-neg-in N/A

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

      12. unsub-neg N/A

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

      13. remove-double-neg N/A

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

      14. lower--.f64 N/A

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

      15. lower-/.f64 93.4

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

   5. Applied rewrites 93.4%

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

   if 0.0200000000000000004 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1e20

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. div-sub N/A

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

      5. sub-neg N/A

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

      6. *-inverses N/A

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

      7. mul-1-neg N/A

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

      8. lower-fma.f64 N/A

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

      9. *-inverses N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. div-sub N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 98.1

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

   5. Applied rewrites 98.1%

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

   7. Applied rewrites 98.1%

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

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

   1. Initial program 94.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 94.1

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

   4. Applied rewrites 94.1%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 93.8

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

   7. Applied rewrites 93.8%

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

   8. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 70.9

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

   10. Applied rewrites 70.9%

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

4. Final simplification 89.2%

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

Alternative 5: 83.1% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -2e+38)
     (* (/ t (- a z)) y)
     (if (<= t_1 1e-19)
       (fma (/ t a) y x)
       (if (<= t_1 1e+20) (+ y x) (* (/ y (- a z)) t))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -2e+38) {
		tmp = (t / (a - z)) * y;
	} else if (t_1 <= 1e-19) {
		tmp = fma((t / a), y, x);
	} else if (t_1 <= 1e+20) {
		tmp = y + x;
	} else {
		tmp = (y / (a - z)) * t;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 97.7%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 97.6

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

   4. Applied rewrites 97.6%

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

   5. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 75.9

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

   7. Applied rewrites 75.9%

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

   if -1.99999999999999995e38 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 87.4

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

   5. Applied rewrites 87.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 87.4

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

   7. Applied rewrites 87.4%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1e20

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 93.7

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

   5. Applied rewrites 93.7%

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

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

   1. Initial program 94.0%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 94.1

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

   4. Applied rewrites 94.1%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 93.8

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

   7. Applied rewrites 93.8%

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

   8. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 70.9

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

   10. Applied rewrites 70.9%

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

4. Final simplification 85.8%

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

Alternative 6: 83.5% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -1e133 or 1e20 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 95.5%

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

      1. lift-/.f64 N/A

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

      2. clear-num N/A

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

      3. lower-/.f64 N/A

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

      4. frac-2neg N/A

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

      5. lower-/.f64 N/A

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

      6. neg-sub0 N/A

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

      7. lift--.f64 N/A

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

      8. sub-neg N/A

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

      9. +-commutative N/A

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

      10. associate--r+ N/A

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

      11. neg-sub0 N/A

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

      12. remove-double-neg N/A

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

      13. lower--.f64 N/A

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

      14. neg-sub0 N/A

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

      15. lift--.f64 N/A

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

      16. sub-neg N/A

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

      17. +-commutative N/A

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

      18. associate--r+ N/A

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

      19. neg-sub0 N/A

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

      20. remove-double-neg N/A

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

      21. lower--.f64 95.5

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

   4. Applied rewrites 95.5%

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

   5. Taylor expanded in a around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. mul-1-neg N/A

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

      5. unsub-neg N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. *-commutative N/A

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

      10. associate-/r* N/A

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

      11. lower-/.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 93.7

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

   7. Applied rewrites 93.7%

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

   8. Taylor expanded in t around inf

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

      1. associate-/l* N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 72.2

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

   10. Applied rewrites 72.2%

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

   if -1e133 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 84.7

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

   5. Applied rewrites 84.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 84.7

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

   7. Applied rewrites 84.7%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1e20

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 93.7

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

   5. Applied rewrites 93.7%

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

4. Final simplification 85.0%

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

Alternative 7: 80.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ t a) y x)) (t_2 (/ (- z t) (- z a))))
   (if (<= t_2 -5e+298)
     (* (/ y (- z)) t)
     (if (<= t_2 1e-19) t_1 (if (<= t_2 50000000000000.0) (+ y x) t_1)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 84.2%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. div-sub N/A

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

      5. sub-neg N/A

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

      6. *-inverses N/A

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

      7. mul-1-neg N/A

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

      8. lower-fma.f64 N/A

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

      9. *-inverses N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. div-sub N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 84.2

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

   5. Applied rewrites 84.2%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 100.0%

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

   if -5.0000000000000003e298 < (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20 or 5e13 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.6%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 74.9

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

   5. Applied rewrites 74.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 74.9

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

   7. Applied rewrites 74.9%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5e13

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 93.7

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

   5. Applied rewrites 93.7%

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

4. Final simplification 82.8%

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

Alternative 8: 65.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a} \cdot y\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{t \cdot y}{a}\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 79.6%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 64.6

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

   5. Applied rewrites 64.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 64.5%

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

   if -inf.0 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < 5.00000000000000015e256

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 67.5

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

   5. Applied rewrites 67.5%

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

   if 5.00000000000000015e256 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 81.2

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

   5. Applied rewrites 81.2%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 90.3%

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

   10. Applied rewrites 90.4%

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

4. Final simplification 68.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \cdot y \leq -\infty:\\ \;\;\;\;\frac{t \cdot y}{a}\\ \mathbf{elif}\;\frac{z - t}{z - a} \cdot y \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 65.6% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a} \cdot y\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;\frac{y}{a} \cdot t\\ \mathbf{elif}\;t\_1 \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \end{array} \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 79.6%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 64.6

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

   5. Applied rewrites 64.6%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 64.5%

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

   10. Applied rewrites 64.5%

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

   if -inf.0 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < 5.00000000000000015e256

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 67.5

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

   5. Applied rewrites 67.5%

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

   if 5.00000000000000015e256 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 81.2

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

   5. Applied rewrites 81.2%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 90.3%

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

   10. Applied rewrites 90.4%

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

4. Final simplification 68.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \cdot y \leq -\infty:\\ \;\;\;\;\frac{y}{a} \cdot t\\ \mathbf{elif}\;\frac{z - t}{z - a} \cdot y \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 65.3% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t}{a} \cdot y\\ t_2 := \frac{z - t}{z - a} \cdot y\\ \mathbf{if}\;t\_2 \leq -\infty:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_2 \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < -inf.0 or 5.00000000000000015e256 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a)))

   1. Initial program 88.1%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 71.5

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

   5. Applied rewrites 71.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 75.2%

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

   10. Applied rewrites 71.4%

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

   if -inf.0 < (*.f64 y (/.f64 (-.f64 z t) (-.f64 z a))) < 5.00000000000000015e256

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 67.5

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

   5. Applied rewrites 67.5%

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

4. Final simplification 67.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\frac{z - t}{z - a} \cdot y \leq -\infty:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \mathbf{elif}\;\frac{z - t}{z - a} \cdot y \leq 5 \cdot 10^{+256}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;\frac{t}{a} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 80.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20 or 5e13 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 72.7

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

   5. Applied rewrites 72.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 72.7

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

   7. Applied rewrites 72.7%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5e13

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 93.7

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

   5. Applied rewrites 93.7%

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

Alternative 12: 80.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 9.9999999999999998e-20 or 5e13 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 98.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 71.4

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

   5. Applied rewrites 71.4%

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

   if 9.9999999999999998e-20 < (/.f64 (-.f64 z t) (-.f64 z a)) < 5e13

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 93.7

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

   5. Applied rewrites 93.7%

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

Alternative 13: 82.0% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- 1.0 (/ t z)) y x)))
   (if (<= z -1.36e-107) t_1 (if (<= z 4.75e-35) (fma (/ t a) y x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((1.0 - (t / z)), y, x);
	double tmp;
	if (z <= -1.36e-107) {
		tmp = t_1;
	} else if (z <= 4.75e-35) {
		tmp = fma((t / a), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(1.0 - Float64(t / z)), y, x)
	tmp = 0.0
	if (z <= -1.36e-107)
		tmp = t_1;
	elseif (z <= 4.75e-35)
		tmp = fma(Float64(t / a), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.36000000000000001e-107 or 4.7500000000000001e-35 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. div-sub N/A

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

      5. sub-neg N/A

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

      6. *-inverses N/A

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

      7. mul-1-neg N/A

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

      8. lower-fma.f64 N/A

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

      9. *-inverses N/A

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

      10. mul-1-neg N/A

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

      11. sub-neg N/A

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

      12. div-sub N/A

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

      13. lower-/.f64 N/A

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

      14. lower--.f64 84.4

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

   5. Applied rewrites 84.4%

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

   7. Applied rewrites 84.4%

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

   if -1.36000000000000001e-107 < z < 4.7500000000000001e-35

   1. Initial program 96.8%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 85.6

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

   5. Applied rewrites 85.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 85.6

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

   7. Applied rewrites 85.6%

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

Alternative 14: 95.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lift-/.f64 N/A

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

   6. div-inv N/A

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

   7. associate-*l* N/A

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

   8. *-commutative N/A

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

   9. lower-fma.f64 N/A

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

   10. associate-*l/ N/A

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

   11. *-lft-identity N/A

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

   12. lower-/.f64 95.3

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

4. Applied rewrites 95.3%

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

Alternative 15: 60.3% accurate, 6.5× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 98.8%

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

3. Taylor expanded in z around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 61.5

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

5. Applied rewrites 61.5%

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

Developer Target 1: 98.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ x + \frac{y}{\frac{z - a}{z - t}} \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (+ x (/ y (/ (- z a) (- z t)))))

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