Numeric.Signal.Multichannel:$cget from hsignal-0.2.7.1

Percentage Accurate: 97.6% → 97.7%

Time: 6.0s

Alternatives: 9

Speedup: 1.1×

• 25.4% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.6% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.7% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. clear-num N/A

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

   5. un-div-inv N/A

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

   6. lower-/.f64 N/A

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

   7. lower-/.f64 97.8

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

4. Applied rewrites 97.8%

   \[\leadsto \color{blue}{\frac{z - t}{\frac{y}{x}}} + t \]
5. Add Preprocessing

Alternative 2: 94.9% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x / y) * (z - t)
    if ((x / y) <= (-1.0d0)) then
        tmp = t_1
    else if ((x / y) <= 2d-8) then
        tmp = ((x * z) / y) + t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (x / y) * (z - t);
	double tmp;
	if ((x / y) <= -1.0) {
		tmp = t_1;
	} else if ((x / y) <= 2e-8) {
		tmp = ((x * z) / y) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -1 or 2e-8 < (/.f64 x y)

   1. Initial program 96.2%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 91.1

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

   5. Applied rewrites 91.1%

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

   7. Applied rewrites 94.6%

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

   if -1 < (/.f64 x y) < 2e-8

   1. Initial program 99.2%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 95.3

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

   5. Applied rewrites 95.3%

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

4. Final simplification 94.9%

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

Alternative 3: 94.1% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -20000.0)
   (/ (* x (- z t)) y)
   (if (<= (/ x y) 2e-8) (fma (/ z y) x t) (* (/ x y) (- z t)))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x / y) <= -20000.0) {
		tmp = (x * (z - t)) / y;
	} else if ((x / y) <= 2e-8) {
		tmp = fma((z / y), x, t);
	} else {
		tmp = (x / y) * (z - t);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x / y) <= -20000.0)
		tmp = Float64(Float64(x * Float64(z - t)) / y);
	elseif (Float64(x / y) <= 2e-8)
		tmp = fma(Float64(z / y), x, t);
	else
		tmp = Float64(Float64(x / y) * Float64(z - t));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 x y) < -2e4

   1. Initial program 95.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 94.1

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

   5. Applied rewrites 94.1%

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

   if -2e4 < (/.f64 x y) < 2e-8

   1. Initial program 99.1%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 92.9

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

   4. Applied rewrites 92.9%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 94.3

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

   7. Applied rewrites 94.3%

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

   if 2e-8 < (/.f64 x y)

   1. Initial program 97.1%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 90.9

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

   5. Applied rewrites 90.9%

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

   7. Applied rewrites 96.2%

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

4. Final simplification 94.8%

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

Alternative 4: 94.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -1 or 2e-8 < (/.f64 x y)

   1. Initial program 96.2%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 91.1

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

   5. Applied rewrites 91.1%

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

   7. Applied rewrites 94.6%

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

   if -1 < (/.f64 x y) < 2e-8

   1. Initial program 99.2%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 93.6

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

   4. Applied rewrites 93.6%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 94.9

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

   7. Applied rewrites 94.9%

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

Alternative 5: 72.8% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ x y) -2e+271) (* (/ (- t) y) x) (fma (/ z y) x t)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 x y) < -1.99999999999999991e271

   1. Initial program 87.0%

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

   3. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in t around inf

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

   8. Applied rewrites 71.1%

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

   if -1.99999999999999991e271 < (/.f64 x y)

   1. Initial program 98.6%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 92.8

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

   4. Applied rewrites 92.8%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 79.4

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

   7. Applied rewrites 79.4%

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

Alternative 6: 82.9% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma (/ z y) x t)))
   (if (<= z -1.32e-37) t_1 (if (<= z 1.8e-102) (* (- 1.0 (/ x y)) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma((z / y), x, t);
	double tmp;
	if (z <= -1.32e-37) {
		tmp = t_1;
	} else if (z <= 1.8e-102) {
		tmp = (1.0 - (x / y)) * t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(Float64(z / y), x, t)
	tmp = 0.0
	if (z <= -1.32e-37)
		tmp = t_1;
	elseif (z <= 1.8e-102)
		tmp = Float64(Float64(1.0 - Float64(x / y)) * t);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / y), $MachinePrecision] * x + t), $MachinePrecision]}, If[LessEqual[z, -1.32e-37], t$95$1, If[LessEqual[z, 1.8e-102], N[(N[(1.0 - N[(x / y), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.3200000000000001e-37 or 1.8e-102 < z

   1. Initial program 98.6%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 93.8

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

   4. Applied rewrites 93.8%

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

   5. Taylor expanded in t around 0

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

      1. lower-/.f64 85.8

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

   7. Applied rewrites 85.8%

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

   if -1.3200000000000001e-37 < z < 1.8e-102

   1. Initial program 96.1%

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

   3. Taylor expanded in t around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. mul-1-neg N/A

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

      4. unsub-neg N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 89.2

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

   5. Applied rewrites 89.2%

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

Alternative 7: 97.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lower-fma.f64 97.6

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

4. Applied rewrites 97.6%

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

Alternative 8: 73.3% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

   1. lift-+.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. lift-/.f64 N/A

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

   4. associate-*l/ N/A

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

   5. associate-/l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 93.4

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

4. Applied rewrites 93.4%

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

5. Taylor expanded in t around 0

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

   1. lower-/.f64 76.6

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

7. Applied rewrites 76.6%

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

Alternative 9: 41.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \frac{x}{y} \cdot z \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.6%

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

3. Taylor expanded in t around 0

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

   1. lower-/.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 39.8

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

5. Applied rewrites 39.8%

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

7. Applied rewrites 44.6%

   \[\leadsto \color{blue}{\frac{x}{y} \cdot z} \]
8. Add Preprocessing

Developer Target 1: 97.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{x}{y} \cdot \left(z - t\right) + t\\ \mathbf{if}\;z < 2.759456554562692 \cdot 10^{-282}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z < 2.326994450874436 \cdot 10^{-110}:\\ \;\;\;\;x \cdot \frac{z - t}{y} + t\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (+ (* (/ x y) (- z t)) t)))
   (if (< z 2.759456554562692e-282)
     t_1
     (if (< z 2.326994450874436e-110) (+ (* x (/ (- z t) y)) t) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = ((x / y) * (z - t)) + t;
	double tmp;
	if (z < 2.759456554562692e-282) {
		tmp = t_1;
	} else if (z < 2.326994450874436e-110) {
		tmp = (x * ((z - t) / y)) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = ((x / y) * (z - t)) + t
    if (z < 2.759456554562692d-282) then
        tmp = t_1
    else if (z < 2.326994450874436d-110) then
        tmp = (x * ((z - t) / y)) + t
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = ((x / y) * (z - t)) + t;
	double tmp;
	if (z < 2.759456554562692e-282) {
		tmp = t_1;
	} else if (z < 2.326994450874436e-110) {
		tmp = (x * ((z - t) / y)) + t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = ((x / y) * (z - t)) + t
	tmp = 0
	if z < 2.759456554562692e-282:
		tmp = t_1
	elif z < 2.326994450874436e-110:
		tmp = (x * ((z - t) / y)) + t
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(Float64(x / y) * Float64(z - t)) + t)
	tmp = 0.0
	if (z < 2.759456554562692e-282)
		tmp = t_1;
	elseif (z < 2.326994450874436e-110)
		tmp = Float64(Float64(x * Float64(Float64(z - t) / y)) + t);
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = ((x / y) * (z - t)) + t;
	tmp = 0.0;
	if (z < 2.759456554562692e-282)
		tmp = t_1;
	elseif (z < 2.326994450874436e-110)
		tmp = (x * ((z - t) / y)) + t;
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(N[(x / y), $MachinePrecision] * N[(z - t), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision]}, If[Less[z, 2.759456554562692e-282], t$95$1, If[Less[z, 2.326994450874436e-110], N[(N[(x * N[(N[(z - t), $MachinePrecision] / y), $MachinePrecision]), $MachinePrecision] + t), $MachinePrecision], t$95$1]]]

Reproduce

herbie shell --seed 2024277 
(FPCore (x y z t)
  :name "Numeric.Signal.Multichannel:$cget from hsignal-0.2.7.1"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< z 689864138640673/250000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (* (/ x y) (- z t)) t) (if (< z 581748612718609/25000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (+ (* x (/ (- z t) y)) t) (+ (* (/ x y) (- z t)) t))))

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