Linear.Projection:inverseInfinitePerspective from linear-1.19.1.3

Percentage Accurate: 96.4% → 97.0%

Time: 11.0s

Alternatives: 5

Speedup: 1.3×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 96.4% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.0% accurate, 1.3× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ [x, y_m, z, t_m] = \mathsf{sort}([x, y_m, z, t_m])\\ \\ t\_s \cdot \left(y\_s \cdot \left(\left(\left(x - z\right) \cdot y\_m\right) \cdot t\_m\right)\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
(FPCore (t_s y_s x y_m z t_m)
 :precision binary64
 (* t_s (* y_s (* (* (- x z) y_m) t_m))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
assert(x < y_m && y_m < z && z < t_m);
double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	return t_s * (y_s * (((x - z) * y_m) * t_m));
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
real(8) function code(t_s, y_s, x, y_m, z, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8), intent (in) :: t_m
    code = t_s * (y_s * (((x - z) * y_m) * t_m))
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
assert x < y_m && y_m < z && z < t_m;
public static double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	return t_s * (y_s * (((x - z) * y_m) * t_m));
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
[x, y_m, z, t_m] = sort([x, y_m, z, t_m])
def code(t_s, y_s, x, y_m, z, t_m):
	return t_s * (y_s * (((x - z) * y_m) * t_m))

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
t\_m = abs(t)
t\_s = copysign(1.0, t)
x, y_m, z, t_m = sort([x, y_m, z, t_m])
function code(t_s, y_s, x, y_m, z, t_m)
	return Float64(t_s * Float64(y_s * Float64(Float64(Float64(x - z) * y_m) * t_m)))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
x, y_m, z, t_m = num2cell(sort([x, y_m, z, t_m])){:}
function tmp = code(t_s, y_s, x, y_m, z, t_m)
	tmp = t_s * (y_s * (((x - z) * y_m) * t_m));
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
code[t$95$s_, y$95$s_, x_, y$95$m_, z_, t$95$m_] := N[(t$95$s * N[(y$95$s * N[(N[(N[(x - z), $MachinePrecision] * y$95$m), $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 90.5%

   \[\left(x \cdot y - z \cdot y\right) \cdot t \]
2. Step-by-step derivation

   1. *-commutative N/A

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

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

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

   3. associate-*r* N/A

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

   4. *-commutative N/A

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

   5. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

   6. --lowering--.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

   7. *-commutative N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

   8. *-lowering-*.f64 90.0%

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

3. Simplified 90.0%

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

   1. associate-*r* N/A

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

   2. *-commutative N/A

      \[\leadsto \left(y \cdot \left(x - z\right)\right) \cdot t \]

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

      \[\leadsto \left(x \cdot y - z \cdot y\right) \cdot t \]

   4. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\left(x \cdot y - z \cdot y\right), \color{blue}{t}\right) \]

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

      \[\leadsto \mathsf{*.f64}\left(\left(y \cdot \left(x - z\right)\right), t\right) \]

   6. *-commutative N/A

      \[\leadsto \mathsf{*.f64}\left(\left(\left(x - z\right) \cdot y\right), t\right) \]

   7. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(\left(x - z\right), y\right), t\right) \]

   8. --lowering--.f64 91.2%

      \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), y\right), t\right) \]

6. Applied egg-rr 91.2%

   \[\leadsto \color{blue}{\left(\left(x - z\right) \cdot y\right) \cdot t} \]
7. Add Preprocessing

Alternative 2: 89.4% accurate, 0.5× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ [x, y_m, z, t_m] = \mathsf{sort}([x, y_m, z, t_m])\\ \\ \begin{array}{l} t_2 := t\_m \cdot \left(x \cdot y\_m\right)\\ t\_s \cdot \left(y\_s \cdot \begin{array}{l} \mathbf{if}\;x \leq -1.32 \cdot 10^{+96}:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;x \leq 6.5 \cdot 10^{+195}:\\ \;\;\;\;y\_m \cdot \left(\left(x - z\right) \cdot t\_m\right)\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array}\right) \end{array} \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
(FPCore (t_s y_s x y_m z t_m)
 :precision binary64
 (let* ((t_2 (* t_m (* x y_m))))
   (*
    t_s
    (*
     y_s
     (if (<= x -1.32e+96)
       t_2
       (if (<= x 6.5e+195) (* y_m (* (- x z) t_m)) t_2))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
assert(x < y_m && y_m < z && z < t_m);
double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double t_2 = t_m * (x * y_m);
	double tmp;
	if (x <= -1.32e+96) {
		tmp = t_2;
	} else if (x <= 6.5e+195) {
		tmp = y_m * ((x - z) * t_m);
	} else {
		tmp = t_2;
	}
	return t_s * (y_s * tmp);
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
real(8) function code(t_s, y_s, x, y_m, z, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8), intent (in) :: t_m
    real(8) :: t_2
    real(8) :: tmp
    t_2 = t_m * (x * y_m)
    if (x <= (-1.32d+96)) then
        tmp = t_2
    else if (x <= 6.5d+195) then
        tmp = y_m * ((x - z) * t_m)
    else
        tmp = t_2
    end if
    code = t_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
assert x < y_m && y_m < z && z < t_m;
public static double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double t_2 = t_m * (x * y_m);
	double tmp;
	if (x <= -1.32e+96) {
		tmp = t_2;
	} else if (x <= 6.5e+195) {
		tmp = y_m * ((x - z) * t_m);
	} else {
		tmp = t_2;
	}
	return t_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
[x, y_m, z, t_m] = sort([x, y_m, z, t_m])
def code(t_s, y_s, x, y_m, z, t_m):
	t_2 = t_m * (x * y_m)
	tmp = 0
	if x <= -1.32e+96:
		tmp = t_2
	elif x <= 6.5e+195:
		tmp = y_m * ((x - z) * t_m)
	else:
		tmp = t_2
	return t_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
t\_m = abs(t)
t\_s = copysign(1.0, t)
x, y_m, z, t_m = sort([x, y_m, z, t_m])
function code(t_s, y_s, x, y_m, z, t_m)
	t_2 = Float64(t_m * Float64(x * y_m))
	tmp = 0.0
	if (x <= -1.32e+96)
		tmp = t_2;
	elseif (x <= 6.5e+195)
		tmp = Float64(y_m * Float64(Float64(x - z) * t_m));
	else
		tmp = t_2;
	end
	return Float64(t_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
x, y_m, z, t_m = num2cell(sort([x, y_m, z, t_m])){:}
function tmp_2 = code(t_s, y_s, x, y_m, z, t_m)
	t_2 = t_m * (x * y_m);
	tmp = 0.0;
	if (x <= -1.32e+96)
		tmp = t_2;
	elseif (x <= 6.5e+195)
		tmp = y_m * ((x - z) * t_m);
	else
		tmp = t_2;
	end
	tmp_2 = t_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
code[t$95$s_, y$95$s_, x_, y$95$m_, z_, t$95$m_] := Block[{t$95$2 = N[(t$95$m * N[(x * y$95$m), $MachinePrecision]), $MachinePrecision]}, N[(t$95$s * N[(y$95$s * If[LessEqual[x, -1.32e+96], t$95$2, If[LessEqual[x, 6.5e+195], N[(y$95$m * N[(N[(x - z), $MachinePrecision] * t$95$m), $MachinePrecision]), $MachinePrecision], t$95$2]]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.3199999999999999e96 or 6.5000000000000003e195 < x

   1. Initial program 81.4%

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

   3. Taylor expanded in x around inf

      \[\leadsto \mathsf{*.f64}\left(\color{blue}{\left(x \cdot y\right)}, t\right) \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot x\right), t\right) \]

      2. *-lowering-*.f64 80.2%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, x\right), t\right) \]

   5. Simplified 80.2%

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

   if -1.3199999999999999e96 < x < 6.5000000000000003e195

   1. Initial program 93.6%

      \[\left(x \cdot y - z \cdot y\right) \cdot t \]
   2. Step-by-step derivation

      1. *-commutative N/A

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

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

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

      8. *-lowering-*.f64 87.6%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

   3. Simplified 87.6%

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(\left(x - z\right) \cdot t\right), \color{blue}{y}\right) \]

      4. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(\left(x - z\right), t\right), y\right) \]

      5. --lowering--.f64 93.9%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), t\right), y\right) \]

   6. Applied egg-rr 93.9%

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

4. Final simplification 90.4%

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

Alternative 3: 56.2% accurate, 0.9× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ [x, y_m, z, t_m] = \mathsf{sort}([x, y_m, z, t_m])\\ \\ t\_s \cdot \left(y\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 5.6 \cdot 10^{+258}:\\ \;\;\;\;t\_m \cdot \left(x \cdot y\_m\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y\_m \cdot t\_m\right)\\ \end{array}\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
(FPCore (t_s y_s x y_m z t_m)
 :precision binary64
 (* t_s (* y_s (if (<= t_m 5.6e+258) (* t_m (* x y_m)) (* x (* y_m t_m))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
assert(x < y_m && y_m < z && z < t_m);
double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double tmp;
	if (t_m <= 5.6e+258) {
		tmp = t_m * (x * y_m);
	} else {
		tmp = x * (y_m * t_m);
	}
	return t_s * (y_s * tmp);
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
real(8) function code(t_s, y_s, x, y_m, z, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 5.6d+258) then
        tmp = t_m * (x * y_m)
    else
        tmp = x * (y_m * t_m)
    end if
    code = t_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
assert x < y_m && y_m < z && z < t_m;
public static double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double tmp;
	if (t_m <= 5.6e+258) {
		tmp = t_m * (x * y_m);
	} else {
		tmp = x * (y_m * t_m);
	}
	return t_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
[x, y_m, z, t_m] = sort([x, y_m, z, t_m])
def code(t_s, y_s, x, y_m, z, t_m):
	tmp = 0
	if t_m <= 5.6e+258:
		tmp = t_m * (x * y_m)
	else:
		tmp = x * (y_m * t_m)
	return t_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
t\_m = abs(t)
t\_s = copysign(1.0, t)
x, y_m, z, t_m = sort([x, y_m, z, t_m])
function code(t_s, y_s, x, y_m, z, t_m)
	tmp = 0.0
	if (t_m <= 5.6e+258)
		tmp = Float64(t_m * Float64(x * y_m));
	else
		tmp = Float64(x * Float64(y_m * t_m));
	end
	return Float64(t_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
x, y_m, z, t_m = num2cell(sort([x, y_m, z, t_m])){:}
function tmp_2 = code(t_s, y_s, x, y_m, z, t_m)
	tmp = 0.0;
	if (t_m <= 5.6e+258)
		tmp = t_m * (x * y_m);
	else
		tmp = x * (y_m * t_m);
	end
	tmp_2 = t_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
code[t$95$s_, y$95$s_, x_, y$95$m_, z_, t$95$m_] := N[(t$95$s * N[(y$95$s * If[LessEqual[t$95$m, 5.6e+258], N[(t$95$m * N[(x * y$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(y$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.59999999999999964e258

   1. Initial program 90.8%

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

   3. Taylor expanded in x around inf

      \[\leadsto \mathsf{*.f64}\left(\color{blue}{\left(x \cdot y\right)}, t\right) \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot x\right), t\right) \]

      2. *-lowering-*.f64 48.0%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, x\right), t\right) \]

   5. Simplified 48.0%

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

   if 5.59999999999999964e258 < t

   1. Initial program 83.9%

      \[\left(x \cdot y - z \cdot y\right) \cdot t \]
   2. Step-by-step derivation

      1. *-commutative N/A

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

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

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

      8. *-lowering-*.f64 99.9%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\left(x - z\right) \cdot \left(y \cdot t\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf

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

   7. Simplified 70.0%

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

4. Final simplification 49.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 5.6 \cdot 10^{+258}:\\ \;\;\;\;t \cdot \left(x \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 57.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ [x, y_m, z, t_m] = \mathsf{sort}([x, y_m, z, t_m])\\ \\ t\_s \cdot \left(y\_s \cdot \begin{array}{l} \mathbf{if}\;t\_m \leq 5 \cdot 10^{+40}:\\ \;\;\;\;y\_m \cdot \left(x \cdot t\_m\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y\_m \cdot t\_m\right)\\ \end{array}\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
(FPCore (t_s y_s x y_m z t_m)
 :precision binary64
 (* t_s (* y_s (if (<= t_m 5e+40) (* y_m (* x t_m)) (* x (* y_m t_m))))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
assert(x < y_m && y_m < z && z < t_m);
double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double tmp;
	if (t_m <= 5e+40) {
		tmp = y_m * (x * t_m);
	} else {
		tmp = x * (y_m * t_m);
	}
	return t_s * (y_s * tmp);
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
real(8) function code(t_s, y_s, x, y_m, z, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8), intent (in) :: t_m
    real(8) :: tmp
    if (t_m <= 5d+40) then
        tmp = y_m * (x * t_m)
    else
        tmp = x * (y_m * t_m)
    end if
    code = t_s * (y_s * tmp)
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
assert x < y_m && y_m < z && z < t_m;
public static double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	double tmp;
	if (t_m <= 5e+40) {
		tmp = y_m * (x * t_m);
	} else {
		tmp = x * (y_m * t_m);
	}
	return t_s * (y_s * tmp);
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
[x, y_m, z, t_m] = sort([x, y_m, z, t_m])
def code(t_s, y_s, x, y_m, z, t_m):
	tmp = 0
	if t_m <= 5e+40:
		tmp = y_m * (x * t_m)
	else:
		tmp = x * (y_m * t_m)
	return t_s * (y_s * tmp)

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
t\_m = abs(t)
t\_s = copysign(1.0, t)
x, y_m, z, t_m = sort([x, y_m, z, t_m])
function code(t_s, y_s, x, y_m, z, t_m)
	tmp = 0.0
	if (t_m <= 5e+40)
		tmp = Float64(y_m * Float64(x * t_m));
	else
		tmp = Float64(x * Float64(y_m * t_m));
	end
	return Float64(t_s * Float64(y_s * tmp))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
x, y_m, z, t_m = num2cell(sort([x, y_m, z, t_m])){:}
function tmp_2 = code(t_s, y_s, x, y_m, z, t_m)
	tmp = 0.0;
	if (t_m <= 5e+40)
		tmp = y_m * (x * t_m);
	else
		tmp = x * (y_m * t_m);
	end
	tmp_2 = t_s * (y_s * tmp);
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
code[t$95$s_, y$95$s_, x_, y$95$m_, z_, t$95$m_] := N[(t$95$s * N[(y$95$s * If[LessEqual[t$95$m, 5e+40], N[(y$95$m * N[(x * t$95$m), $MachinePrecision]), $MachinePrecision], N[(x * N[(y$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if t < 5.00000000000000003e40

   1. Initial program 89.2%

      \[\left(x \cdot y - z \cdot y\right) \cdot t \]
   2. Step-by-step derivation

      1. *-commutative N/A

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

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

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

      8. *-lowering-*.f64 88.5%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

   3. Simplified 88.5%

      \[\leadsto \color{blue}{\left(x - z\right) \cdot \left(y \cdot t\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

      3. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left(t \cdot x\right)}\right) \]

      4. *-lowering-*.f64 51.5%

         \[\leadsto \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(t, \color{blue}{x}\right)\right) \]

   7. Simplified 51.5%

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

   if 5.00000000000000003e40 < t

   1. Initial program 95.8%

      \[\left(x \cdot y - z \cdot y\right) \cdot t \]
   2. Step-by-step derivation

      1. *-commutative N/A

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

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

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

      3. associate-*r* N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

      6. --lowering--.f64 N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

      7. *-commutative N/A

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

      8. *-lowering-*.f64 96.1%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

   3. Simplified 96.1%

      \[\leadsto \color{blue}{\left(x - z\right) \cdot \left(y \cdot t\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf

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

   7. Simplified 49.8%

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

4. Final simplification 51.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq 5 \cdot 10^{+40}:\\ \;\;\;\;y \cdot \left(x \cdot t\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(y \cdot t\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 54.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} y\_m = \left|y\right| \\ y\_s = \mathsf{copysign}\left(1, y\right) \\ t\_m = \left|t\right| \\ t\_s = \mathsf{copysign}\left(1, t\right) \\ [x, y_m, z, t_m] = \mathsf{sort}([x, y_m, z, t_m])\\ \\ t\_s \cdot \left(y\_s \cdot \left(x \cdot \left(y\_m \cdot t\_m\right)\right)\right) \end{array} \]

FPCore

y\_m = (fabs.f64 y)
y\_s = (copysign.f64 #s(literal 1 binary64) y)
t\_m = (fabs.f64 t)
t\_s = (copysign.f64 #s(literal 1 binary64) t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
(FPCore (t_s y_s x y_m z t_m)
 :precision binary64
 (* t_s (* y_s (* x (* y_m t_m)))))

C

y\_m = fabs(y);
y\_s = copysign(1.0, y);
t\_m = fabs(t);
t\_s = copysign(1.0, t);
assert(x < y_m && y_m < z && z < t_m);
double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	return t_s * (y_s * (x * (y_m * t_m)));
}

Fortran

y\_m = abs(y)
y\_s = copysign(1.0d0, y)
t\_m = abs(t)
t\_s = copysign(1.0d0, t)
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
real(8) function code(t_s, y_s, x, y_m, z, t_m)
    real(8), intent (in) :: t_s
    real(8), intent (in) :: y_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y_m
    real(8), intent (in) :: z
    real(8), intent (in) :: t_m
    code = t_s * (y_s * (x * (y_m * t_m)))
end function

Java

y\_m = Math.abs(y);
y\_s = Math.copySign(1.0, y);
t\_m = Math.abs(t);
t\_s = Math.copySign(1.0, t);
assert x < y_m && y_m < z && z < t_m;
public static double code(double t_s, double y_s, double x, double y_m, double z, double t_m) {
	return t_s * (y_s * (x * (y_m * t_m)));
}

Python

y\_m = math.fabs(y)
y\_s = math.copysign(1.0, y)
t\_m = math.fabs(t)
t\_s = math.copysign(1.0, t)
[x, y_m, z, t_m] = sort([x, y_m, z, t_m])
def code(t_s, y_s, x, y_m, z, t_m):
	return t_s * (y_s * (x * (y_m * t_m)))

Julia

y\_m = abs(y)
y\_s = copysign(1.0, y)
t\_m = abs(t)
t\_s = copysign(1.0, t)
x, y_m, z, t_m = sort([x, y_m, z, t_m])
function code(t_s, y_s, x, y_m, z, t_m)
	return Float64(t_s * Float64(y_s * Float64(x * Float64(y_m * t_m))))
end

MATLAB

y\_m = abs(y);
y\_s = sign(y) * abs(1.0);
t\_m = abs(t);
t\_s = sign(t) * abs(1.0);
x, y_m, z, t_m = num2cell(sort([x, y_m, z, t_m])){:}
function tmp = code(t_s, y_s, x, y_m, z, t_m)
	tmp = t_s * (y_s * (x * (y_m * t_m)));
end

Wolfram

y\_m = N[Abs[y], $MachinePrecision]
y\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[y]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
t\_m = N[Abs[t], $MachinePrecision]
t\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[t]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
NOTE: x, y_m, z, and t_m should be sorted in increasing order before calling this function.
code[t$95$s_, y$95$s_, x_, y$95$m_, z_, t$95$m_] := N[(t$95$s * N[(y$95$s * N[(x * N[(y$95$m * t$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 90.5%

   \[\left(x \cdot y - z \cdot y\right) \cdot t \]
2. Step-by-step derivation

   1. *-commutative N/A

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

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

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

   3. associate-*r* N/A

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

   4. *-commutative N/A

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

   5. *-lowering-*.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\left(x - z\right), \color{blue}{\left(t \cdot y\right)}\right) \]

   6. --lowering--.f64 N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(\color{blue}{t} \cdot y\right)\right) \]

   7. *-commutative N/A

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \left(y \cdot \color{blue}{t}\right)\right) \]

   8. *-lowering-*.f64 90.0%

      \[\leadsto \mathsf{*.f64}\left(\mathsf{\_.f64}\left(x, z\right), \mathsf{*.f64}\left(y, \color{blue}{t}\right)\right) \]

3. Simplified 90.0%

   \[\leadsto \color{blue}{\left(x - z\right) \cdot \left(y \cdot t\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around inf

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

7. Simplified 53.2%

   \[\leadsto \color{blue}{x} \cdot \left(y \cdot t\right) \]
8. Add Preprocessing

Developer Target 1: 95.8% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t < -9.231879582886777 \cdot 10^{-80}:\\ \;\;\;\;\left(y \cdot t\right) \cdot \left(x - z\right)\\ \mathbf{elif}\;t < 2.543067051564877 \cdot 10^{+83}:\\ \;\;\;\;y \cdot \left(t \cdot \left(x - z\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot \left(x - z\right)\right) \cdot t\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (< t -9.231879582886777e-80)
   (* (* y t) (- x z))
   (if (< t 2.543067051564877e+83) (* y (* t (- x z))) (* (* y (- x z)) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (t < -9.231879582886777e-80) {
		tmp = (y * t) * (x - z);
	} else if (t < 2.543067051564877e+83) {
		tmp = y * (t * (x - z));
	} else {
		tmp = (y * (x - z)) * t;
	}
	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) :: tmp
    if (t < (-9.231879582886777d-80)) then
        tmp = (y * t) * (x - z)
    else if (t < 2.543067051564877d+83) then
        tmp = y * (t * (x - z))
    else
        tmp = (y * (x - z)) * t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (t < -9.231879582886777e-80) {
		tmp = (y * t) * (x - z);
	} else if (t < 2.543067051564877e+83) {
		tmp = y * (t * (x - z));
	} else {
		tmp = (y * (x - z)) * t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if t < -9.231879582886777e-80:
		tmp = (y * t) * (x - z)
	elif t < 2.543067051564877e+83:
		tmp = y * (t * (x - z))
	else:
		tmp = (y * (x - z)) * t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (t < -9.231879582886777e-80)
		tmp = Float64(Float64(y * t) * Float64(x - z));
	elseif (t < 2.543067051564877e+83)
		tmp = Float64(y * Float64(t * Float64(x - z)));
	else
		tmp = Float64(Float64(y * Float64(x - z)) * t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (t < -9.231879582886777e-80)
		tmp = (y * t) * (x - z);
	elseif (t < 2.543067051564877e+83)
		tmp = y * (t * (x - z));
	else
		tmp = (y * (x - z)) * t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Less[t, -9.231879582886777e-80], N[(N[(y * t), $MachinePrecision] * N[(x - z), $MachinePrecision]), $MachinePrecision], If[Less[t, 2.543067051564877e+83], N[(y * N[(t * N[(x - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[(y * N[(x - z), $MachinePrecision]), $MachinePrecision] * t), $MachinePrecision]]]

Reproduce

herbie shell --seed 2024139 
(FPCore (x y z t)
  :name "Linear.Projection:inverseInfinitePerspective from linear-1.19.1.3"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< t -9231879582886777/100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) (* (* y t) (- x z)) (if (< t 254306705156487700000000000000000000000000000000000000000000000000000000000000000000) (* y (* t (- x z))) (* (* y (- x z)) t))))

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