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

Percentage Accurate: 98.3% → 98.3%

Time: 7.8s

Alternatives: 12

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 98.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 98.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.1%

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

Alternative 2: 88.7% accurate, 0.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -9.99999999999999934e168

   1. Initial program 89.3%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 23.0

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

   5. Applied rewrites 23.0%

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

   6. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 75.8

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

   8. Applied rewrites 75.8%

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

   if -9.99999999999999934e168 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2.0000000000000001e-22

   1. Initial program 99.8%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 90.5

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

   5. Applied rewrites 90.5%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e104

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. mul-1-neg N/A

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

      7. div-sub N/A

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

      8. sub-neg N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. +-commutative N/A

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

      12. distribute-lft-in N/A

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

      13. metadata-eval N/A

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

      14. lower-fma.f64 N/A

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

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 92.8

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

   5. Applied rewrites 92.8%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 88.9

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

   5. Applied rewrites 88.9%

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

4. Final simplification 90.3%

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

Alternative 3: 81.8% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))))
   (if (<= t_1 1e-78)
     (fma z (/ y a) x)
     (if (<= t_1 5e-24)
       (fma y (/ t (- a)) x)
       (if (<= t_1 5e+69) (+ y x) (* (/ z (- a t)) y))))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 4 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999999e-79

   1. Initial program 98.2%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 98.2

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

   4. Applied rewrites 98.2%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 80.2

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

   7. Applied rewrites 80.2%

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

   if 9.99999999999999999e-79 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.9999999999999998e-24

   1. Initial program 99.6%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 99.8

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

   4. Applied rewrites 99.8%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 82.1

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

   7. Applied rewrites 82.1%

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

   8. Taylor expanded in t around 0

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

   10. Applied rewrites 82.1%

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

   if 4.9999999999999998e-24 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.00000000000000036e69

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.9

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

   5. Applied rewrites 92.9%

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

   if 5.00000000000000036e69 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 83.0

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

   5. Applied rewrites 83.0%

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

4. Final simplification 85.7%

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

Alternative 4: 71.6% accurate, 0.3× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- z t) (- a t))) (t_2 (/ (* y z) a)))
   (if (<= t_1 -5e+214)
     t_2
     (if (<= t_1 5e-58) (* (- x) -1.0) (if (<= t_1 5e+140) (+ y x) t_2)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y * z) / a;
	double tmp;
	if (t_1 <= -5e+214) {
		tmp = t_2;
	} else if (t_1 <= 5e-58) {
		tmp = -x * -1.0;
	} else if (t_1 <= 5e+140) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	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) :: t_1
    real(8) :: t_2
    real(8) :: tmp
    t_1 = (z - t) / (a - t)
    t_2 = (y * z) / a
    if (t_1 <= (-5d+214)) then
        tmp = t_2
    else if (t_1 <= 5d-58) then
        tmp = -x * (-1.0d0)
    else if (t_1 <= 5d+140) then
        tmp = y + x
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = (z - t) / (a - t);
	double t_2 = (y * z) / a;
	double tmp;
	if (t_1 <= -5e+214) {
		tmp = t_2;
	} else if (t_1 <= 5e-58) {
		tmp = -x * -1.0;
	} else if (t_1 <= 5e+140) {
		tmp = y + x;
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = (z - t) / (a - t)
	t_2 = (y * z) / a
	tmp = 0
	if t_1 <= -5e+214:
		tmp = t_2
	elif t_1 <= 5e-58:
		tmp = -x * -1.0
	elif t_1 <= 5e+140:
		tmp = y + x
	else:
		tmp = t_2
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < -4.99999999999999953e214 or 5.00000000000000008e140 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 92.2%

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

   3. Taylor expanded in x around 0

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

      1. associate-/l* N/A

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

      2. div-sub N/A

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

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

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

      4. associate-/l* N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. associate-*l/ N/A

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

      8. associate-/l* N/A

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

      9. *-commutative N/A

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

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

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

      11. lower-*.f64 N/A

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

      12. lower-/.f64 N/A

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

      13. lower--.f64 N/A

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

      14. lower--.f64 85.9

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

   5. Applied rewrites 85.9%

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

   6. Taylor expanded in t around 0

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

   8. Applied rewrites 73.3%

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

   9. Taylor expanded in t around 0

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

   11. Applied rewrites 73.4%

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

   if -4.99999999999999953e214 < (/.f64 (-.f64 z t) (-.f64 a t)) < 4.99999999999999977e-58

   1. Initial program 99.8%

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

   3. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 87.4%

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

   6. Taylor expanded in x around inf

      \[\leadsto \left(-x\right) \cdot -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 65.9%

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

   if 4.99999999999999977e-58 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.00000000000000008e140

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 85.7

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

   5. Applied rewrites 85.7%

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

4. Final simplification 76.2%

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

Alternative 5: 86.6% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

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

   1. Initial program 98.4%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 84.3

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

   5. Applied rewrites 84.3%

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

   if 2.0000000000000001e-22 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e104

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. mul-1-neg N/A

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

      7. div-sub N/A

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

      8. sub-neg N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. +-commutative N/A

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

      12. distribute-lft-in N/A

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

      13. metadata-eval N/A

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

      14. lower-fma.f64 N/A

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

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 92.8

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

   5. Applied rewrites 92.8%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 88.9

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

   5. Applied rewrites 88.9%

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

4. Final simplification 88.3%

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

Alternative 6: 81.7% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999943e-30

   1. Initial program 98.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 98.3

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

   4. Applied rewrites 98.3%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 77.4

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

   7. Applied rewrites 77.4%

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

   if 9.99999999999999943e-30 < (/.f64 (-.f64 z t) (-.f64 a t)) < 5.00000000000000036e69

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 92.2

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

   5. Applied rewrites 92.2%

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

   if 5.00000000000000036e69 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 83.0

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

   5. Applied rewrites 83.0%

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

4. Final simplification 84.1%

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

Alternative 7: 81.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 9.99999999999999943e-30

   1. Initial program 98.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 98.3

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

   4. Applied rewrites 98.3%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 77.4

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

   7. Applied rewrites 77.4%

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

   if 9.99999999999999943e-30 < (/.f64 (-.f64 z t) (-.f64 a t)) < 2e104

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 90.0

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

   5. Applied rewrites 90.0%

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

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

   1. Initial program 100.0%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 15.7

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

   5. Applied rewrites 15.7%

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

   6. Taylor expanded in z around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 83.6

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

   8. Applied rewrites 83.6%

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

4. Final simplification 83.3%

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

Alternative 8: 82.4% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= t -5.4e-89)
   (fma (- 1.0 (/ z t)) y x)
   (if (<= t 2.9e-78) (+ x (/ (* (- z t) y) a)) (fma y (/ t (- t a)) x))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (t <= -5.4e-89) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else if (t <= 2.9e-78) {
		tmp = x + (((z - t) * y) / a);
	} else {
		tmp = fma(y, (t / (t - a)), x);
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -5.39999999999999975e-89

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. mul-1-neg N/A

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

      7. div-sub N/A

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

      8. sub-neg N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. +-commutative N/A

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

      12. distribute-lft-in N/A

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

      13. metadata-eval N/A

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

      14. lower-fma.f64 N/A

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

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 88.2

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

   5. Applied rewrites 88.2%

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

   if -5.39999999999999975e-89 < t < 2.9000000000000001e-78

   1. Initial program 97.9%

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

   3. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 90.5

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

   5. Applied rewrites 90.5%

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

   if 2.9000000000000001e-78 < t

   1. Initial program 99.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. frac-2neg N/A

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

      7. lower-/.f64 N/A

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

      8. neg-sub0 N/A

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

      9. lift--.f64 N/A

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

      10. sub-neg N/A

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

      11. +-commutative N/A

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

      12. associate--r+ N/A

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

      13. neg-sub0 N/A

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

      14. remove-double-neg N/A

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

      15. lower--.f64 N/A

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

      16. neg-sub0 N/A

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

      17. lift--.f64 N/A

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

      18. sub-neg N/A

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

      19. +-commutative N/A

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

      20. associate--r+ N/A

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

      21. neg-sub0 N/A

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

      22. remove-double-neg N/A

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

      23. lower--.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 N/A

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

      6. lower--.f64 86.9

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

   7. Applied rewrites 86.9%

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

4. Final simplification 88.6%

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

Alternative 9: 80.8% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -5.4e-89) (not (<= t 1.45e-143)))
   (fma (- 1.0 (/ z t)) y x)
   (+ x (/ (* z y) a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -5.4e-89) || !(t <= 1.45e-143)) {
		tmp = fma((1.0 - (z / t)), y, x);
	} else {
		tmp = x + ((z * y) / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -5.4e-89) || !(t <= 1.45e-143))
		tmp = fma(Float64(1.0 - Float64(z / t)), y, x);
	else
		tmp = Float64(x + Float64(Float64(z * y) / a));
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[Or[LessEqual[t, -5.4e-89], N[Not[LessEqual[t, 1.45e-143]], $MachinePrecision]], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * y + x), $MachinePrecision], N[(x + N[(N[(z * y), $MachinePrecision] / a), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -5.39999999999999975e-89 or 1.45e-143 < t

   1. Initial program 99.9%

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

   3. Taylor expanded in a around 0

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

      1. +-commutative N/A

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

      2. mul-1-neg N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. mul-1-neg N/A

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

      7. div-sub N/A

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

      8. sub-neg N/A

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

      9. *-inverses N/A

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

      10. metadata-eval N/A

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

      11. +-commutative N/A

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

      12. distribute-lft-in N/A

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

      13. metadata-eval N/A

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

      14. lower-fma.f64 N/A

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

      15. mul-1-neg N/A

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

      16. unsub-neg N/A

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

      17. lower--.f64 N/A

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

      18. lower-/.f64 87.3

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

   5. Applied rewrites 87.3%

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

   if -5.39999999999999975e-89 < t < 1.45e-143

   1. Initial program 97.7%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 88.6

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

   5. Applied rewrites 88.6%

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

4. Final simplification 87.7%

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

Alternative 10: 66.9% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= (/ (- z t) (- a t)) 1.7e-57) (* (- x) -1.0) (+ y x)))

C

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

Python

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

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (Float64(Float64(z - t) / Float64(a - t)) <= 1.7e-57)
		tmp = Float64(Float64(-x) * -1.0);
	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) / (a - t)) <= 1.7e-57)
		tmp = -x * -1.0;
	else
		tmp = y + x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 z t) (-.f64 a t)) < 1.70000000000000008e-57

   1. Initial program 98.2%

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

   3. Taylor expanded in x around -inf

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

      1. associate-*r* N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 N/A

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

      5. sub-neg N/A

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

      6. mul-1-neg N/A

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

      7. *-commutative N/A

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

      8. associate-/l* N/A

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

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

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

      10. mul-1-neg N/A

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

      11. metadata-eval N/A

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

      12. lower-fma.f64 N/A

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

   5. Applied rewrites 88.4%

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

   6. Taylor expanded in x around inf

      \[\leadsto \left(-x\right) \cdot -1 \]
   7. Step-by-step derivation

   8. Applied rewrites 62.1%

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

   if 1.70000000000000008e-57 < (/.f64 (-.f64 z t) (-.f64 a t))

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 78.2

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

   5. Applied rewrites 78.2%

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

4. Final simplification 70.8%

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

Alternative 11: 76.6% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (or (<= t -5.4e-89) (not (<= t 1.25e+61))) (+ y x) (fma (/ z a) y x)))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if ((t <= -5.4e-89) || !(t <= 1.25e+61)) {
		tmp = y + x;
	} else {
		tmp = fma((z / a), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if ((t <= -5.4e-89) || !(t <= 1.25e+61))
		tmp = Float64(y + x);
	else
		tmp = fma(Float64(z / a), y, x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -5.39999999999999975e-89 or 1.25000000000000004e61 < t

   1. Initial program 99.9%

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

   3. Taylor expanded in t around inf

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

      1. +-commutative N/A

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

      2. lower-+.f64 83.3

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

   5. Applied rewrites 83.3%

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

   if -5.39999999999999975e-89 < t < 1.25000000000000004e61

   1. Initial program 98.3%

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

   3. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lower-/.f64 83.1

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

   5. Applied rewrites 83.1%

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

4. Final simplification 83.2%

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

Alternative 12: 60.4% 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 99.1%

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

3. Taylor expanded in t around inf

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

   1. +-commutative N/A

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

   2. lower-+.f64 64.1

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

5. Applied rewrites 64.1%

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

6. Final simplification 64.1%

   \[\leadsto y + x \]
7. Add Preprocessing

Developer Target 1: 99.4% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (* y (/ (- z t) (- a t))))))
   (if (< y -8.508084860551241e-17)
     t_1
     (if (< y 2.894426862792089e-49)
       (+ x (* (* y (- z t)) (/ 1.0 (- a t))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	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) :: t_1
    real(8) :: tmp
    t_1 = x + (y * ((z - t) / (a - t)))
    if (y < (-8.508084860551241d-17)) then
        tmp = t_1
    else if (y < 2.894426862792089d-49) then
        tmp = x + ((y * (z - t)) * (1.0d0 / (a - t)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (y * ((z - t) / (a - t)));
	double tmp;
	if (y < -8.508084860551241e-17) {
		tmp = t_1;
	} else if (y < 2.894426862792089e-49) {
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (y * ((z - t) / (a - t)))
	tmp = 0
	if y < -8.508084860551241e-17:
		tmp = t_1
	elif y < 2.894426862792089e-49:
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)))
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (y * ((z - t) / (a - t)));
	tmp = 0.0;
	if (y < -8.508084860551241e-17)
		tmp = t_1;
	elseif (y < 2.894426862792089e-49)
		tmp = x + ((y * (z - t)) * (1.0 / (a - t)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (if (< y -8508084860551241/100000000000000000000000000000000) (+ x (* y (/ (- z t) (- a t)))) (if (< y 2894426862792089/10000000000000000000000000000000000000000000000000000000000000000) (+ x (* (* y (- z t)) (/ 1 (- a t)))) (+ x (* y (/ (- z t) (- a t)))))))

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