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

Percentage Accurate: 68.6% → 89.5%

Time: 12.4s

Alternatives: 15

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

Fortran

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 68.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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 - x)) / (a - z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 89.5% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ (- y a) z) (- x t) t)))
   (if (<= z -3.2e+175)
     t_1
     (if (<= z 4.2e+111) (fma (- t x) (/ (- y z) (- a z)) x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma(((y - a) / z), (x - t), t);
	double tmp;
	if (z <= -3.2e+175) {
		tmp = t_1;
	} else if (z <= 4.2e+111) {
		tmp = fma((t - x), ((y - z) / (a - z)), x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(y - a) / z), Float64(x - t), t)
	tmp = 0.0
	if (z <= -3.2e+175)
		tmp = t_1;
	elseif (z <= 4.2e+111)
		tmp = fma(Float64(t - x), Float64(Float64(y - z) / Float64(a - z)), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -3.20000000000000022e175 or 4.1999999999999999e111 < z

   1. Initial program 17.5%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 86.6%

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

   7. Applied rewrites 86.6%

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

   if -3.20000000000000022e175 < z < 4.1999999999999999e111

   1. Initial program 81.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 93.8

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

   4. Applied rewrites 93.8%

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

Alternative 2: 76.5% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(y - a) / z), Float64(x - t), t)
	tmp = 0.0
	if (z <= -2.8e+71)
		tmp = t_1;
	elseif (z <= 2.3)
		tmp = fma(Float64(t - x), Float64(Float64(y - z) / a), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -2.80000000000000002e71 or 2.2999999999999998 < z

   1. Initial program 31.1%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   7. Applied rewrites 80.5%

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

   if -2.80000000000000002e71 < z < 2.2999999999999998

   1. Initial program 86.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 94.9

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

   4. Applied rewrites 94.9%

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

   5. Taylor expanded in a around inf

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 78.8

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

   7. Applied rewrites 78.8%

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

Alternative 3: 75.6% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(Float64(y - a) / z), Float64(x - t), t)
	tmp = 0.0
	if (z <= -1.3e+71)
		tmp = t_1;
	elseif (z <= 2.3)
		tmp = fma(Float64(y - z), Float64(Float64(t - x) / a), x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.29999999999999996e71 or 2.2999999999999998 < z

   1. Initial program 31.1%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   7. Applied rewrites 80.5%

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

   if -1.29999999999999996e71 < z < 2.2999999999999998

   1. Initial program 86.7%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 77.7

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

   5. Applied rewrites 77.7%

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

Alternative 4: 74.7% accurate, 0.8× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (- y z) (/ (- t x) a) x)))
   (if (<= a -1.45e+19) t_1 (if (<= a 1.38e-9) (fma (- x t) (/ y z) t) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.45e19 or 1.37999999999999999e-9 < a

   1. Initial program 63.3%

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

   3. Taylor expanded in a around inf

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 N/A

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

      7. lower--.f64 73.5

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

   5. Applied rewrites 73.5%

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

   if -1.45e19 < a < 1.37999999999999999e-9

   1. Initial program 60.9%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 75.7%

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

4. Final simplification 74.5%

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

Alternative 5: 71.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.45e+19)
   (fma (- t x) (/ y a) x)
   (if (<= a 5.2e-9) (fma (- x t) (/ y z) t) (fma y (/ (- t x) a) x))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -1.45e19

   1. Initial program 69.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 90.4

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

   4. Applied rewrites 90.4%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 68.6

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

   7. Applied rewrites 68.6%

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

   if -1.45e19 < a < 5.2000000000000002e-9

   1. Initial program 60.9%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 75.7%

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

   if 5.2000000000000002e-9 < a

   1. Initial program 57.7%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 66.1

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

   5. Applied rewrites 66.1%

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

4. Final simplification 71.2%

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

Alternative 6: 70.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.45e+19)
   (fma (- t x) (/ y a) x)
   (if (<= a 5.2e-9) (fma y (/ (- x t) z) t) (fma y (/ (- t x) a) x))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -1.45e19

   1. Initial program 69.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 90.4

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

   4. Applied rewrites 90.4%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 68.6

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

   7. Applied rewrites 68.6%

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

   if -1.45e19 < a < 5.2000000000000002e-9

   1. Initial program 60.9%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.0%

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

   if 5.2000000000000002e-9 < a

   1. Initial program 57.7%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 66.1

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

   5. Applied rewrites 66.1%

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

Alternative 7: 70.1% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma y (/ (- t x) a) x)))
   (if (<= a -1.45e+19) t_1 (if (<= a 5.2e-9) (fma y (/ (- x t) z) t) t_1))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.45e19 or 5.2000000000000002e-9 < a

   1. Initial program 63.3%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 66.6

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

   5. Applied rewrites 66.6%

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

   if -1.45e19 < a < 5.2000000000000002e-9

   1. Initial program 60.9%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 80.5%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 73.0%

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

Alternative 8: 62.8% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -1.55e+25)
   (fma (- x) (/ y a) x)
   (if (<= a 6.9e-9) (fma y (/ (- x t) z) t) (+ x (/ (* y t) a)))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (a <= -1.55e+25) {
		tmp = fma(-x, (y / a), x);
	} else if (a <= 6.9e-9) {
		tmp = fma(y, ((x - t) / z), t);
	} else {
		tmp = x + ((y * t) / a);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (a <= -1.55e+25)
		tmp = fma(Float64(-x), Float64(y / a), x);
	elseif (a <= 6.9e-9)
		tmp = fma(y, Float64(Float64(x - t) / z), t);
	else
		tmp = Float64(x + Float64(Float64(y * t) / a));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -1.5499999999999999e25

   1. Initial program 68.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 90.2

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

   4. Applied rewrites 90.2%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 68.1

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

   7. Applied rewrites 68.1%

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

   8. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 58.8

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

   10. Applied rewrites 58.8%

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

   if -1.5499999999999999e25 < a < 6.89999999999999975e-9

   1. Initial program 61.2%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 79.9%

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

   6. Taylor expanded in a around 0

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

   8. Applied rewrites 72.5%

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

   if 6.89999999999999975e-9 < a

   1. Initial program 57.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 52.4

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

   5. Applied rewrites 52.4%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 53.6%

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

Alternative 9: 47.4% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= a -5.1e-27)
   (fma (- x) (/ y a) x)
   (if (<= a 1.26e-9) (* y (/ (- x t) z)) (+ x (/ (* y t) a)))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if a < -5.0999999999999999e-27

   1. Initial program 67.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 89.0

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

   4. Applied rewrites 89.0%

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

   5. Taylor expanded in z around 0

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

      1. lower-/.f64 63.5

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

   7. Applied rewrites 63.5%

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

   8. Taylor expanded in t around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 53.8

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

   10. Applied rewrites 53.8%

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

   if -5.0999999999999999e-27 < a < 1.25999999999999999e-9

   1. Initial program 61.1%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 43.3%

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

   if 1.25999999999999999e-9 < a

   1. Initial program 57.7%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 52.4

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

   5. Applied rewrites 52.4%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 53.6%

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

Alternative 10: 48.2% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (/ (* y t) a))))
   (if (<= a -1.75e-27) t_1 (if (<= a 1.26e-9) (* y (/ (- x t) z)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y * t) / a);
	double tmp;
	if (a <= -1.75e-27) {
		tmp = t_1;
	} else if (a <= 1.26e-9) {
		tmp = y * ((x - t) / z);
	} 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 * t) / a)
    if (a <= (-1.75d-27)) then
        tmp = t_1
    else if (a <= 1.26d-9) then
        tmp = y * ((x - t) / z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + ((y * t) / a);
	double tmp;
	if (a <= -1.75e-27) {
		tmp = t_1;
	} else if (a <= 1.26e-9) {
		tmp = y * ((x - t) / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + ((y * t) / a)
	tmp = 0
	if a <= -1.75e-27:
		tmp = t_1
	elif a <= 1.26e-9:
		tmp = y * ((x - t) / z)
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + ((y * t) / a);
	tmp = 0.0;
	if (a <= -1.75e-27)
		tmp = t_1;
	elseif (a <= 1.26e-9)
		tmp = y * ((x - t) / z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if a < -1.7500000000000001e-27 or 1.25999999999999999e-9 < a

   1. Initial program 63.0%

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

   3. Taylor expanded in z around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 N/A

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

      3. lower--.f64 55.1

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

   5. Applied rewrites 55.1%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 52.1%

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

   if -1.7500000000000001e-27 < a < 1.25999999999999999e-9

   1. Initial program 61.1%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 81.6%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 43.3%

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

Alternative 11: 28.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(t - x\right)\\ \mathbf{if}\;t \leq -4.2 \cdot 10^{+103}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 4.3 \cdot 10^{+86}:\\ \;\;\;\;x \cdot \frac{y - a}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (- t x))))
   (if (<= t -4.2e+103) t_1 (if (<= t 4.3e+86) (* x (/ (- y a) z)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (t <= -4.2e+103) {
		tmp = t_1;
	} else if (t <= 4.3e+86) {
		tmp = x * ((y - a) / z);
	} 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 + (t - x)
    if (t <= (-4.2d+103)) then
        tmp = t_1
    else if (t <= 4.3d+86) then
        tmp = x * ((y - a) / z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (t <= -4.2e+103) {
		tmp = t_1;
	} else if (t <= 4.3e+86) {
		tmp = x * ((y - a) / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (t - x)
	tmp = 0
	if t <= -4.2e+103:
		tmp = t_1
	elif t <= 4.3e+86:
		tmp = x * ((y - a) / z)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(t - x))
	tmp = 0.0
	if (t <= -4.2e+103)
		tmp = t_1;
	elseif (t <= 4.3e+86)
		tmp = Float64(x * Float64(Float64(y - a) / z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (t - x);
	tmp = 0.0;
	if (t <= -4.2e+103)
		tmp = t_1;
	elseif (t <= 4.3e+86)
		tmp = x * ((y - a) / z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.2000000000000003e103 or 4.3000000000000002e86 < t

   1. Initial program 58.3%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 32.7

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

   5. Applied rewrites 32.7%

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

   if -4.2000000000000003e103 < t < 4.3000000000000002e86

   1. Initial program 64.1%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 51.0%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 32.2%

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

Alternative 12: 25.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(t - x\right)\\ \mathbf{if}\;t \leq -2.05 \cdot 10^{+18}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 3.8 \cdot 10^{+33}:\\ \;\;\;\;x \cdot \frac{y}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (- t x))))
   (if (<= t -2.05e+18) t_1 (if (<= t 3.8e+33) (* x (/ y z)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (t <= -2.05e+18) {
		tmp = t_1;
	} else if (t <= 3.8e+33) {
		tmp = x * (y / z);
	} 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 + (t - x)
    if (t <= (-2.05d+18)) then
        tmp = t_1
    else if (t <= 3.8d+33) then
        tmp = x * (y / z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (t <= -2.05e+18) {
		tmp = t_1;
	} else if (t <= 3.8e+33) {
		tmp = x * (y / z);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = x + (t - x)
	tmp = 0
	if t <= -2.05e+18:
		tmp = t_1
	elif t <= 3.8e+33:
		tmp = x * (y / z)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(x + Float64(t - x))
	tmp = 0.0
	if (t <= -2.05e+18)
		tmp = t_1;
	elseif (t <= 3.8e+33)
		tmp = Float64(x * Float64(y / z));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = x + (t - x);
	tmp = 0.0;
	if (t <= -2.05e+18)
		tmp = t_1;
	elseif (t <= 3.8e+33)
		tmp = x * (y / z);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -2.05e18 or 3.80000000000000002e33 < t

   1. Initial program 60.3%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 29.1

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

   5. Applied rewrites 29.1%

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

   if -2.05e18 < t < 3.80000000000000002e33

   1. Initial program 63.5%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 51.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 34.3%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 23.2%

       \[\leadsto x \cdot \frac{y}{z} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 13: 23.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := x + \left(t - x\right)\\ \mathbf{if}\;t \leq -8600000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 2.8 \cdot 10^{+33}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (+ x (- t x))))
   (if (<= t -8600000000000.0) t_1 (if (<= t 2.8e+33) (/ (* x y) z) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = x + (t - x);
	double tmp;
	if (t <= -8600000000000.0) {
		tmp = t_1;
	} else if (t <= 2.8e+33) {
		tmp = (x * y) / z;
	} 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 + (t - x)
    if (t <= (-8600000000000.0d0)) then
        tmp = t_1
    else if (t <= 2.8d+33) then
        tmp = (x * y) / z
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t, a):
	t_1 = x + (t - x)
	tmp = 0
	if t <= -8600000000000.0:
		tmp = t_1
	elif t <= 2.8e+33:
		tmp = (x * y) / z
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -8.6e12 or 2.8000000000000001e33 < t

   1. Initial program 60.3%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 29.1

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

   5. Applied rewrites 29.1%

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

   if -8.6e12 < t < 2.8000000000000001e33

   1. Initial program 63.5%

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

   3. Taylor expanded in z around inf

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

      1. associate--l+ N/A

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

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

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

      3. div-sub N/A

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

      4. +-commutative N/A

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

      5. mul-1-neg N/A

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

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

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

      7. associate-/l* N/A

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

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

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

      9. mul-1-neg N/A

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

      10. lower-fma.f64 N/A

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

   5. Applied rewrites 51.9%

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

   6. Taylor expanded in x around inf

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

   8. Applied rewrites 34.3%

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

   9. Taylor expanded in y around inf

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

   11. Applied rewrites 19.4%

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

4. Final simplification 23.4%

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

Alternative 14: 18.9% accurate, 4.1× speedup

Math

\[\begin{array}{l} \\ x + \left(t - x\right) \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.2%

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

3. Taylor expanded in z around inf

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

   1. lower--.f64 16.8

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

5. Applied rewrites 16.8%

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

Alternative 15: 2.7% accurate, 4.8× speedup

Math

\[\begin{array}{l} \\ x + \left(-x\right) \end{array} \]

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 62.2%

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

3. Taylor expanded in z around inf

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

   1. lower--.f64 16.8

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

5. Applied rewrites 16.8%

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

6. Taylor expanded in t around 0

   \[\leadsto x + -1 \cdot \color{blue}{x} \]
7. Step-by-step derivation

8. Applied rewrites 2.9%

   \[\leadsto x + \left(-x\right) \]
9. Add Preprocessing

Developer Target 1: 84.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := t - \frac{y}{z} \cdot \left(t - x\right)\\ \mathbf{if}\;z < -1.2536131056095036 \cdot 10^{+188}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 4.446702369113811 \cdot 10^{+64}:\\ \;\;\;\;x + \frac{y - z}{\frac{a - z}{t - x}}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (- t (* (/ y z) (- t x)))))
   (if (< z -1.2536131056095036e+188)
     t_1
     (if (< z 4.446702369113811e+64)
       (+ x (/ (- y z) (/ (- a z) (- t x))))
       t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} 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 = t - ((y / z) * (t - x))
    if (z < (-1.2536131056095036d+188)) then
        tmp = t_1
    else if (z < 4.446702369113811d+64) then
        tmp = x + ((y - z) / ((a - z) / (t - x)))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a) {
	double t_1 = t - ((y / z) * (t - x));
	double tmp;
	if (z < -1.2536131056095036e+188) {
		tmp = t_1;
	} else if (z < 4.446702369113811e+64) {
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a):
	t_1 = t - ((y / z) * (t - x))
	tmp = 0
	if z < -1.2536131056095036e+188:
		tmp = t_1
	elif z < 4.446702369113811e+64:
		tmp = x + ((y - z) / ((a - z) / (t - x)))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a)
	t_1 = Float64(t - Float64(Float64(y / z) * Float64(t - x)))
	tmp = 0.0
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = Float64(x + Float64(Float64(y - z) / Float64(Float64(a - z) / Float64(t - x))));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a)
	t_1 = t - ((y / z) * (t - x));
	tmp = 0.0;
	if (z < -1.2536131056095036e+188)
		tmp = t_1;
	elseif (z < 4.446702369113811e+64)
		tmp = x + ((y - z) / ((a - z) / (t - x)));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

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

Reproduce

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

  :alt
  (! :herbie-platform default (if (< z -125361310560950360000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (- t (* (/ y z) (- t x))) (if (< z 44467023691138110000000000000000000000000000000000000000000000000) (+ x (/ (- y z) (/ (- a z) (- t x)))) (- t (* (/ y z) (- t x))))))

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