Graphics.Rendering.Chart.SparkLine:renderSparkLine from Chart-1.5.3

Percentage Accurate: 97.3% → 97.5%

Time: 8.2s

Alternatives: 11

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.3% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.5% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.3%

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

   1. lift--.f64 N/A

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

   2. sub-neg N/A

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

   3. +-commutative N/A

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

   4. lift-/.f64 N/A

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

   5. clear-num N/A

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

   6. associate-/r/ N/A

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

   7. lift-/.f64 N/A

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

   8. clear-num N/A

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

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

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

   10. clear-num N/A

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

   11. lift-/.f64 N/A

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

   12. distribute-frac-neg2 N/A

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

   13. lower-fma.f64 N/A

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

4. Applied rewrites 97.6%

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

Alternative 2: 64.4% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 y z) (/.f64 (+.f64 (-.f64 t z) #s(literal 1 binary64)) a)) < -5.0000000000000003e288 or 2e285 < (/.f64 (-.f64 y z) (/.f64 (+.f64 (-.f64 t z) #s(literal 1 binary64)) a))

   1. Initial program 100.0%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 72.3

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

   7. Applied rewrites 72.3%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 64.9%

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

   11. Taylor expanded in x around 0

       \[\leadsto -1 \cdot \left(a \cdot \color{blue}{y}\right) \]
   12. Step-by-step derivation

   13. Applied rewrites 64.9%

       \[\leadsto \left(-a\right) \cdot y \]

   if -5.0000000000000003e288 < (/.f64 (-.f64 y z) (/.f64 (+.f64 (-.f64 t z) #s(literal 1 binary64)) a)) < 2e285

   1. Initial program 97.0%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 64.3

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

   5. Applied rewrites 64.3%

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

4. Final simplification 64.4%

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

Alternative 3: 90.8% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (/ (- y z) t)))
   (if (<= t -8200000000.0)
     (- x (* t_1 a))
     (if (<= t 42000000.0)
       (fma a (/ (- y z) (- z 1.0)) x)
       (fma t_1 (- a) x)))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = (y - z) / t;
	double tmp;
	if (t <= -8200000000.0) {
		tmp = x - (t_1 * a);
	} else if (t <= 42000000.0) {
		tmp = fma(a, ((y - z) / (z - 1.0)), x);
	} else {
		tmp = fma(t_1, -a, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = Float64(Float64(y - z) / t)
	tmp = 0.0
	if (t <= -8200000000.0)
		tmp = Float64(x - Float64(t_1 * a));
	elseif (t <= 42000000.0)
		tmp = fma(a, Float64(Float64(y - z) / Float64(z - 1.0)), x);
	else
		tmp = fma(t_1, Float64(-a), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -8.2e9

   1. Initial program 97.1%

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

   3. Taylor expanded in t around inf

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 81.2

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

   5. Applied rewrites 81.2%

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

   7. Applied rewrites 88.8%

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

   if -8.2e9 < t < 4.2e7

   1. Initial program 97.6%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 97.7%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 99.3

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

   7. Applied rewrites 99.3%

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

   if 4.2e7 < t

   1. Initial program 96.9%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-neg.f64 91.6

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

   5. Applied rewrites 91.6%

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

Alternative 4: 88.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ a z) (- y z) x)))
   (if (<= z -7000000000.0)
     t_1
     (if (<= z 160000000000.0) (- x (* (/ y (- t -1.0)) a)) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((a / z), (y - z), x);
	double tmp;
	if (z <= -7000000000.0) {
		tmp = t_1;
	} else if (z <= 160000000000.0) {
		tmp = x - ((y / (t - -1.0)) * a);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(a / z), Float64(y - z), x)
	tmp = 0.0
	if (z <= -7000000000.0)
		tmp = t_1;
	elseif (z <= 160000000000.0)
		tmp = Float64(x - Float64(Float64(y / Float64(t - -1.0)) * a));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -7e9 or 1.6e11 < z

   1. Initial program 94.2%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 94.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 86.1

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

   7. Applied rewrites 86.1%

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

   if -7e9 < z < 1.6e11

   1. Initial program 99.2%

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

   3. Taylor expanded in z around 0

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower-+.f64 91.8

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

   5. Applied rewrites 91.8%

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

4. Final simplification 89.6%

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

Alternative 5: 88.1% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{a}{z}, y - z, x\right)\\ \mathbf{if}\;z \leq -7000000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 160000000000:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{-1 - t}, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (let* ((t_1 (fma (/ a z) (- y z) x)))
   (if (<= z -7000000000.0)
     t_1
     (if (<= z 160000000000.0) (fma (/ y (- -1.0 t)) a x) t_1))))

C

double code(double x, double y, double z, double t, double a) {
	double t_1 = fma((a / z), (y - z), x);
	double tmp;
	if (z <= -7000000000.0) {
		tmp = t_1;
	} else if (z <= 160000000000.0) {
		tmp = fma((y / (-1.0 - t)), a, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	t_1 = fma(Float64(a / z), Float64(y - z), x)
	tmp = 0.0
	if (z <= -7000000000.0)
		tmp = t_1;
	elseif (z <= 160000000000.0)
		tmp = fma(Float64(y / Float64(-1.0 - t)), a, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -7e9 or 1.6e11 < z

   1. Initial program 94.2%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 94.9%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 86.1

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

   7. Applied rewrites 86.1%

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

   if -7e9 < z < 1.6e11

   1. Initial program 99.2%

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

   3. Taylor expanded in z around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. lower-fma.f64 N/A

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

      7. distribute-neg-frac2 N/A

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

      8. lower-/.f64 N/A

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

      9. distribute-neg-in N/A

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

      10. metadata-eval N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 91.7

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

   5. Applied rewrites 91.7%

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

Alternative 6: 84.3% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.45e+130)
   (- x a)
   (if (<= z 320000000000.0) (fma (/ y (- -1.0 t)) a x) (- x a))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.45e130 or 3.2e11 < z

   1. Initial program 92.9%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 82.3

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

   5. Applied rewrites 82.3%

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

   if -1.45e130 < z < 3.2e11

   1. Initial program 99.3%

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

   3. Taylor expanded in z around 0

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

      1. sub-neg N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. lower-fma.f64 N/A

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

      7. distribute-neg-frac2 N/A

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

      8. lower-/.f64 N/A

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

      9. distribute-neg-in N/A

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

      10. metadata-eval N/A

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

      11. unsub-neg N/A

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

      12. lower--.f64 90.4

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

   5. Applied rewrites 90.4%

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

Alternative 7: 71.8% accurate, 1.1× speedup

Math

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

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -0.021) (- x a) (if (<= z 8e+14) (fma (/ (- a) t) y x) (- x a))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -0.0210000000000000013 or 8e14 < z

   1. Initial program 94.1%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 81.2

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

   5. Applied rewrites 81.2%

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

   if -0.0210000000000000013 < z < 8e14

   1. Initial program 99.2%

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

   3. Taylor expanded in t around inf

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

      1. mul-1-neg N/A

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

      2. +-commutative N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

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

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

      6. lower-fma.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lower--.f64 N/A

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

      9. lower-neg.f64 76.6

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

   5. Applied rewrites 76.6%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 58.2%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 74.5%

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

Alternative 8: 75.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.45:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq 9500:\\ \;\;\;\;\mathsf{fma}\left(a, \mathsf{fma}\left(1 - y, z, -y\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -1.45)
   (- x a)
   (if (<= z 9500.0) (fma a (fma (- 1.0 y) z (- y)) x) (- x a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -1.45) {
		tmp = x - a;
	} else if (z <= 9500.0) {
		tmp = fma(a, fma((1.0 - y), z, -y), x);
	} else {
		tmp = x - a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -1.45)
		tmp = Float64(x - a);
	elseif (z <= 9500.0)
		tmp = fma(a, fma(Float64(1.0 - y), z, Float64(-y)), x);
	else
		tmp = Float64(x - a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -1.45], N[(x - a), $MachinePrecision], If[LessEqual[z, 9500.0], N[(a * N[(N[(1.0 - y), $MachinePrecision] * z + (-y)), $MachinePrecision] + x), $MachinePrecision], N[(x - a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.44999999999999996 or 9500 < z

   1. Initial program 94.3%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 80.9

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

   5. Applied rewrites 80.9%

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

   if -1.44999999999999996 < z < 9500

   1. Initial program 99.2%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 68.5

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

   7. Applied rewrites 68.5%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 68.4%

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

Alternative 9: 73.5% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -0.00021:\\ \;\;\;\;x - a\\ \mathbf{elif}\;z \leq 6800000000:\\ \;\;\;\;\mathsf{fma}\left(-y, a, x\right)\\ \mathbf{else}:\\ \;\;\;\;x - a\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a)
 :precision binary64
 (if (<= z -0.00021) (- x a) (if (<= z 6800000000.0) (fma (- y) a x) (- x a))))

C

double code(double x, double y, double z, double t, double a) {
	double tmp;
	if (z <= -0.00021) {
		tmp = x - a;
	} else if (z <= 6800000000.0) {
		tmp = fma(-y, a, x);
	} else {
		tmp = x - a;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a)
	tmp = 0.0
	if (z <= -0.00021)
		tmp = Float64(x - a);
	elseif (z <= 6800000000.0)
		tmp = fma(Float64(-y), a, x);
	else
		tmp = Float64(x - a);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_] := If[LessEqual[z, -0.00021], N[(x - a), $MachinePrecision], If[LessEqual[z, 6800000000.0], N[((-y) * a + x), $MachinePrecision], N[(x - a), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.1000000000000001e-4 or 6.8e9 < z

   1. Initial program 94.4%

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

   3. Taylor expanded in z around inf

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

      1. lower--.f64 80.3

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

   5. Applied rewrites 80.3%

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

   if -2.1000000000000001e-4 < z < 6.8e9

   1. Initial program 99.2%

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

      1. lift--.f64 N/A

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

      2. sub-neg N/A

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

      3. +-commutative N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. associate-/r/ N/A

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

      7. lift-/.f64 N/A

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

      8. clear-num N/A

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

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

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

      10. clear-num N/A

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

      11. lift-/.f64 N/A

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

      12. distribute-frac-neg2 N/A

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

      13. lower-fma.f64 N/A

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

   4. Applied rewrites 99.3%

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

   5. Taylor expanded in t around 0

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower--.f64 68.3

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

   7. Applied rewrites 68.3%

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

   8. Taylor expanded in z around 0

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

   10. Applied rewrites 67.7%

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

Alternative 10: 61.0% accurate, 8.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.3%

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

3. Taylor expanded in z around inf

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

   1. lower--.f64 58.7

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

5. Applied rewrites 58.7%

   \[\leadsto \color{blue}{x - a} \]
6. Add Preprocessing

Alternative 11: 17.7% accurate, 11.7× speedup

Math

\[\begin{array}{l} \\ -a \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_] := (-a)

Derivation

1. Initial program 97.3%

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

3. Taylor expanded in z around inf

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

   1. lower--.f64 58.7

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

5. Applied rewrites 58.7%

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

6. Taylor expanded in x around 0

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

8. Applied rewrites 17.2%

   \[\leadsto -a \]
9. Add Preprocessing

Developer Target 1: 99.6% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024332 
(FPCore (x y z t a)
  :name "Graphics.Rendering.Chart.SparkLine:renderSparkLine from Chart-1.5.3"
  :precision binary64

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

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