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

Percentage Accurate: 98.3% → 98.3%

Time: 11.1s

Alternatives: 14

Speedup: 1.1×

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

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

   \[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. lower-fma.f64 98.4

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

4. Applied rewrites 98.4%

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

Alternative 2: 87.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -1.5e+217)
     (* t (/ y (- a z)))
     (if (<= t_1 -10000000000.0)
       (fma y (/ (- t) z) x)
       (if (<= t_1 0.0002)
         (fma y (/ (- t z) a) x)
         (if (<= t_1 2e+81) (fma y (- 1.0 (/ t z)) x) (+ x (/ (* t y) a))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double tmp;
	if (t_1 <= -1.5e+217) {
		tmp = t * (y / (a - z));
	} else if (t_1 <= -10000000000.0) {
		tmp = fma(y, (-t / z), x);
	} else if (t_1 <= 0.0002) {
		tmp = fma(y, ((t - z) / a), x);
	} else if (t_1 <= 2e+81) {
		tmp = fma(y, (1.0 - (t / z)), x);
	} else {
		tmp = x + ((t * y) / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_1 <= -1.5e+217)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_1 <= -10000000000.0)
		tmp = fma(y, Float64(Float64(-t) / z), x);
	elseif (t_1 <= 0.0002)
		tmp = fma(y, Float64(Float64(t - z) / a), x);
	elseif (t_1 <= 2e+81)
		tmp = fma(y, Float64(1.0 - Float64(t / z)), x);
	else
		tmp = Float64(x + Float64(Float64(t * y) / a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 5 regimes

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

   1. Initial program 78.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 92.8

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

   5. Applied rewrites 92.8%

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

   7. Applied rewrites 99.9%

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

   if -1.49999999999999988e217 < (/.f64 (-.f64 z t) (-.f64 z a)) < -1e10

   1. Initial program 99.7%

      \[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. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 72.1

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

   5. Applied rewrites 72.1%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 72.1%

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

   if -1e10 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000001e-4

   1. Initial program 99.9%

      \[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. associate-/l* N/A

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

      4. distribute-rgt-neg-in N/A

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

      5. mul-1-neg N/A

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

      6. lower-fma.f64 N/A

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

      7. associate-*r/ N/A

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

      8. lower-/.f64 N/A

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

      9. mul-1-neg N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. distribute-neg-in N/A

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

      13. unsub-neg N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 98.2

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

   5. Applied rewrites 98.2%

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

   if 2.0000000000000001e-4 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.99999999999999984e81

   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. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 95.4

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

   5. Applied rewrites 95.4%

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

   if 1.99999999999999984e81 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 95.6%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

4. Final simplification 92.4%

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

Alternative 3: 82.5% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (- 1.0 (/ t z)) x)) (t_2 (/ (- z t) (- z a))))
   (if (<= t_2 -1.5e+217)
     (* t (/ y (- a z)))
     (if (<= t_2 -4.0)
       t_1
       (if (<= t_2 0.0002)
         (fma (/ z (- a)) y x)
         (if (<= t_2 2e+81) t_1 (+ x (/ (* t y) a))))))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(y, (1.0 - (t / z)), x);
	double t_2 = (z - t) / (z - a);
	double tmp;
	if (t_2 <= -1.5e+217) {
		tmp = t * (y / (a - z));
	} else if (t_2 <= -4.0) {
		tmp = t_1;
	} else if (t_2 <= 0.0002) {
		tmp = fma((z / -a), y, x);
	} else if (t_2 <= 2e+81) {
		tmp = t_1;
	} else {
		tmp = x + ((t * y) / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(y, Float64(1.0 - Float64(t / z)), x)
	t_2 = Float64(Float64(z - t) / Float64(z - a))
	tmp = 0.0
	if (t_2 <= -1.5e+217)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_2 <= -4.0)
		tmp = t_1;
	elseif (t_2 <= 0.0002)
		tmp = fma(Float64(z / Float64(-a)), y, x);
	elseif (t_2 <= 2e+81)
		tmp = t_1;
	else
		tmp = Float64(x + Float64(Float64(t * y) / a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 4 regimes

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

   1. Initial program 78.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 92.8

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

   5. Applied rewrites 92.8%

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

   7. Applied rewrites 99.9%

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

   if -1.49999999999999988e217 < (/.f64 (-.f64 z t) (-.f64 z a)) < -4 or 2.0000000000000001e-4 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.99999999999999984e81

   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. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 89.1

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

   5. Applied rewrites 89.1%

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

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

   1. Initial program 99.9%

      \[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. lower-fma.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 90.2

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

   7. Applied rewrites 90.2%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 89.5%

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

   if 1.99999999999999984e81 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 95.6%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 78.0

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

   5. Applied rewrites 78.0%

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

4. Final simplification 88.8%

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

Alternative 4: 83.3% accurate, 0.2× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -1.5e+217)
     (* t (/ y (- a z)))
     (if (<= t_1 -10000000000.0)
       (fma y (/ (- t) z) x)
       (if (<= t_1 2e-22)
         (fma y (/ t a) x)
         (if (<= t_1 2e+50) (+ y x) (* y (/ t (- a z)))))))))

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 <= -1.5e+217) {
		tmp = t * (y / (a - z));
	} else if (t_1 <= -10000000000.0) {
		tmp = fma(y, (-t / z), x);
	} else if (t_1 <= 2e-22) {
		tmp = fma(y, (t / a), x);
	} else if (t_1 <= 2e+50) {
		tmp = y + x;
	} else {
		tmp = y * (t / (a - z));
	}
	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 <= -1.5e+217)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_1 <= -10000000000.0)
		tmp = fma(y, Float64(Float64(-t) / z), x);
	elseif (t_1 <= 2e-22)
		tmp = fma(y, Float64(t / a), x);
	elseif (t_1 <= 2e+50)
		tmp = Float64(y + x);
	else
		tmp = Float64(y * Float64(t / Float64(a - z)));
	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, -1.5e+217], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -10000000000.0], N[(y * N[((-t) / z), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e-22], N[(y * N[(t / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+50], N[(y + x), $MachinePrecision], N[(y * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 5 regimes

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

   1. Initial program 78.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 92.8

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

   5. Applied rewrites 92.8%

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

   7. Applied rewrites 99.9%

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

   if -1.49999999999999988e217 < (/.f64 (-.f64 z t) (-.f64 z a)) < -1e10

   1. Initial program 99.7%

      \[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. div-sub N/A

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

      4. sub-neg N/A

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

      5. *-inverses N/A

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

      6. mul-1-neg N/A

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

      7. lower-fma.f64 N/A

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

      8. mul-1-neg N/A

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

      9. unsub-neg N/A

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

      10. lower--.f64 N/A

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

      11. lower-/.f64 72.1

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

   5. Applied rewrites 72.1%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 72.1%

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

   if -1e10 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000001e-22

   1. Initial program 99.9%

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

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 82.2

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

   5. Applied rewrites 82.2%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000002e50

   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 95.0

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

   5. Applied rewrites 95.0%

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

   if 2.0000000000000002e50 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.3%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 70.7%

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

4. Final simplification 85.3%

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

Alternative 5: 82.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -4e+31)
     (* t (/ y (- a z)))
     (if (<= t_1 2e-11)
       (fma (/ z (- a)) y x)
       (if (<= t_1 2e+50) (+ y x) (* y (/ t (- a z))))))))

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 <= -4e+31) {
		tmp = t * (y / (a - z));
	} else if (t_1 <= 2e-11) {
		tmp = fma((z / -a), y, x);
	} else if (t_1 <= 2e+50) {
		tmp = y + x;
	} else {
		tmp = y * (t / (a - z));
	}
	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 <= -4e+31)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_1 <= 2e-11)
		tmp = fma(Float64(z / Float64(-a)), y, x);
	elseif (t_1 <= 2e+50)
		tmp = Float64(y + x);
	else
		tmp = Float64(y * Float64(t / Float64(a - z)));
	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, -4e+31], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-11], N[(N[(z / (-a)), $MachinePrecision] * y + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+50], N[(y + x), $MachinePrecision], N[(y * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 92.7%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 61.3

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

   5. Applied rewrites 61.3%

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

   7. Applied rewrites 73.0%

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

   if -3.9999999999999999e31 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.99999999999999988e-11

   1. Initial program 99.9%

      \[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. lower-fma.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 88.8

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

   7. Applied rewrites 88.8%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 87.1%

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

   if 1.99999999999999988e-11 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000002e50

   1. Initial program 100.0%

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

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

   5. Applied rewrites 95.9%

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

   if 2.0000000000000002e50 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.3%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 70.7%

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

4. Final simplification 86.3%

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

Alternative 6: 83.7% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -3.65e+28)
     (* t (/ y (- a z)))
     (if (<= t_1 2e-22)
       (fma y (/ t a) x)
       (if (<= t_1 2e+50) (+ y x) (* y (/ t (- a z))))))))

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 <= -3.65e+28) {
		tmp = t * (y / (a - z));
	} else if (t_1 <= 2e-22) {
		tmp = fma(y, (t / a), x);
	} else if (t_1 <= 2e+50) {
		tmp = y + x;
	} else {
		tmp = y * (t / (a - z));
	}
	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 <= -3.65e+28)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_1 <= 2e-22)
		tmp = fma(y, Float64(t / a), x);
	elseif (t_1 <= 2e+50)
		tmp = Float64(y + x);
	else
		tmp = Float64(y * Float64(t / Float64(a - z)));
	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, -3.65e+28], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e-22], N[(y * N[(t / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+50], N[(y + x), $MachinePrecision], N[(y * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 4 regimes

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

   1. Initial program 92.9%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 59.9

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

   5. Applied rewrites 59.9%

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

   7. Applied rewrites 71.3%

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

   if -3.6499999999999999e28 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000001e-22

   1. Initial program 99.9%

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

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 81.8

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

   5. Applied rewrites 81.8%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000002e50

   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 95.0

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

   5. Applied rewrites 95.0%

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

   if 2.0000000000000002e50 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.3%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 70.7%

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

4. Final simplification 83.8%

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

Alternative 7: 84.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z - t}{z - a}\\ t_2 := t \cdot \frac{y}{a - z}\\ \mathbf{if}\;t\_1 \leq -3.65 \cdot 10^{+28}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{-22}:\\ \;\;\;\;\mathsf{fma}\left(y, \frac{t}{a}, x\right)\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+50}:\\ \;\;\;\;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 (* t (/ y (- a z)))))
   (if (<= t_1 -3.65e+28)
     t_2
     (if (<= t_1 2e-22) (fma y (/ t a) x) (if (<= t_1 2e+50) (+ y x) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (z - a);
	double t_2 = t * (y / (a - z));
	double tmp;
	if (t_1 <= -3.65e+28) {
		tmp = t_2;
	} else if (t_1 <= 2e-22) {
		tmp = fma(y, (t / a), x);
	} else if (t_1 <= 2e+50) {
		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(t * Float64(y / Float64(a - z)))
	tmp = 0.0
	if (t_1 <= -3.65e+28)
		tmp = t_2;
	elseif (t_1 <= 2e-22)
		tmp = fma(y, Float64(t / a), x);
	elseif (t_1 <= 2e+50)
		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[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, -3.65e+28], t$95$2, If[LessEqual[t$95$1, 2e-22], N[(y * N[(t / a), $MachinePrecision] + x), $MachinePrecision], If[LessEqual[t$95$1, 2e+50], N[(y + x), $MachinePrecision], t$95$2]]]]]

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < -3.6499999999999999e28 or 2.0000000000000002e50 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 94.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 64.2

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

   5. Applied rewrites 64.2%

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

   7. Applied rewrites 70.1%

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

   if -3.6499999999999999e28 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000001e-22

   1. Initial program 99.9%

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

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 81.8

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

   5. Applied rewrites 81.8%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000002e50

   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 95.0

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

   5. Applied rewrites 95.0%

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

Alternative 8: 83.5% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- z a))))
   (if (<= t_1 -4e+31)
     (* t (/ y (- a z)))
     (if (<= t_1 2e+50) (fma y (/ z (- z a)) x) (* y (/ t (- a z)))))))

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 <= -4e+31) {
		tmp = t * (y / (a - z));
	} else if (t_1 <= 2e+50) {
		tmp = fma(y, (z / (z - a)), x);
	} else {
		tmp = y * (t / (a - z));
	}
	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 <= -4e+31)
		tmp = Float64(t * Float64(y / Float64(a - z)));
	elseif (t_1 <= 2e+50)
		tmp = fma(y, Float64(z / Float64(z - a)), x);
	else
		tmp = Float64(y * Float64(t / Float64(a - z)));
	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, -4e+31], N[(t * N[(y / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, 2e+50], N[(y * N[(z / N[(z - a), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision], N[(y * N[(t / N[(a - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

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

   1. Initial program 92.7%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 61.3

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

   5. Applied rewrites 61.3%

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

   7. Applied rewrites 73.0%

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

   if -3.9999999999999999e31 < (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000002e50

   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. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 92.9

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

   5. Applied rewrites 92.9%

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

   if 2.0000000000000002e50 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 96.3%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.7

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

   5. Applied rewrites 70.7%

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

   7. Applied rewrites 70.7%

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

4. Final simplification 87.4%

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

Alternative 9: 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(t, \frac{y}{a}, x\right)\\ \mathbf{if}\;t\_1 \leq 2 \cdot 10^{-22}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 2 \cdot 10^{+81}:\\ \;\;\;\;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 (/ y a) x)))
   (if (<= t_1 2e-22) t_2 (if (<= t_1 2e+81) (+ 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, (y / a), x);
	double tmp;
	if (t_1 <= 2e-22) {
		tmp = t_2;
	} else if (t_1 <= 2e+81) {
		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(t, Float64(y / a), x)
	tmp = 0.0
	if (t_1 <= 2e-22)
		tmp = t_2;
	elseif (t_1 <= 2e+81)
		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[(t * N[(y / a), $MachinePrecision] + x), $MachinePrecision]}, If[LessEqual[t$95$1, 2e-22], t$95$2, If[LessEqual[t$95$1, 2e+81], N[(y + x), $MachinePrecision], t$95$2]]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 z a)) < 2.0000000000000001e-22 or 1.99999999999999984e81 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 97.5%

      \[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. lower-fma.f64 97.5

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

   4. Applied rewrites 97.5%

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

   5. Taylor expanded in z around 0

      \[\leadsto \color{blue}{x + \frac{t \cdot y}{a}} \]
   6. 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. lower-fma.f64 N/A

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

      4. lower-/.f64 73.0

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

   7. Applied rewrites 73.0%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 z a)) < 1.99999999999999984e81

   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 91.5

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

   5. Applied rewrites 91.5%

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

Alternative 10: 62.9% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- z a)) -1e+81) (* t (/ y a)) (+ y x)))

C

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

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
    real(8) :: tmp
    if (((z - t) / (z - a)) <= (-1d+81)) then
        tmp = t * (y / a)
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (z - a)) <= -1e+81) {
		tmp = t * (y / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (z - a)) <= -1e+81:
		tmp = t * (y / a)
	else:
		tmp = y + x
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 91.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.6

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

   5. Applied rewrites 70.6%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 44.1%

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

   10. Applied rewrites 49.7%

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

   if -9.99999999999999921e80 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 99.5%

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

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

   5. Applied rewrites 68.6%

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

4. Final simplification 66.2%

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

Alternative 11: 62.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- z a)) -1e+81) (* y (/ t a)) (+ y x)))

C

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

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
    real(8) :: tmp
    if (((z - t) / (z - a)) <= (-1d+81)) then
        tmp = y * (t / a)
    else
        tmp = y + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (((z - t) / (z - a)) <= -1e+81) {
		tmp = y * (t / a);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	tmp = 0
	if ((z - t) / (z - a)) <= -1e+81:
		tmp = y * (t / a)
	else:
		tmp = y + x
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 91.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. distribute-neg-frac2 N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. sub-neg N/A

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

      7. +-commutative N/A

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

      8. distribute-neg-in N/A

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

      9. remove-double-neg N/A

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

      10. neg-mul-1 N/A

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

      11. lower-+.f64 N/A

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

      12. neg-mul-1 N/A

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

      13. lower-neg.f64 70.6

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

   5. Applied rewrites 70.6%

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

   6. Taylor expanded in a around inf

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

   8. Applied rewrites 44.1%

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

   10. Applied rewrites 46.7%

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

   if -9.99999999999999921e80 < (/.f64 (-.f64 z t) (-.f64 z a))

   1. Initial program 99.5%

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

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

   5. Applied rewrites 68.6%

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

Alternative 12: 77.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.75e-23) (+ y x) (if (<= z 0.86) (fma y (/ t a) x) (+ y x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.75e-23) {
		tmp = y + x;
	} else if (z <= 0.86) {
		tmp = fma(y, (t / a), x);
	} else {
		tmp = y + x;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.75e-23)
		tmp = Float64(y + x);
	elseif (z <= 0.86)
		tmp = fma(y, Float64(t / a), x);
	else
		tmp = Float64(y + x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.74999999999999997e-23 or 0.859999999999999987 < z

   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 80.9

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

   5. Applied rewrites 80.9%

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

   if -1.74999999999999997e-23 < z < 0.859999999999999987

   1. Initial program 96.8%

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

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 76.6

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

   5. Applied rewrites 76.6%

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

Alternative 13: 96.1% 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.4%

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

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

4. Applied rewrites 95.4%

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

Alternative 14: 59.8% 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.4%

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

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

5. Applied rewrites 62.3%

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

Developer Target 1: 98.4% 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 2024220 
(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)))))