Graphics.Rendering.Plot.Render.Plot.Axis:tickPosition from plot-0.2.3.4

Percentage Accurate: 97.7% → 97.7%

Time: 6.9s

Alternatives: 9

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 97.7% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.7% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 97.5

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

4. Applied rewrites 97.5%

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

Alternative 2: 96.6% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- y x) (/ z t))))
   (if (<= (/ z t) -500000000.0)
     t_1
     (if (<= (/ z t) 5e-7) (+ (* y (/ z t)) x) t_1))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -5e8 or 4.99999999999999977e-7 < (/.f64 z t)

   1. Initial program 97.4%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 91.3

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

   5. Applied rewrites 91.3%

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

   7. Applied rewrites 96.5%

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

   if -5e8 < (/.f64 z t) < 4.99999999999999977e-7

   1. Initial program 97.5%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. clear-num N/A

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

      4. un-div-inv N/A

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

      5. lower-/.f64 N/A

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

      6. lower-/.f64 97.2

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

   4. Applied rewrites 97.2%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 97.2

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

   7. Applied rewrites 97.2%

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

4. Final simplification 96.9%

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

Alternative 3: 94.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- y x) (/ z t))))
   (if (<= (/ z t) -5e-15)
     t_1
     (if (<= (/ z t) 5e-23) (+ (* (/ y t) z) x) t_1))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -4.99999999999999999e-15 or 5.0000000000000002e-23 < (/.f64 z t)

   1. Initial program 97.5%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 90.8

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

   5. Applied rewrites 90.8%

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

   7. Applied rewrites 95.8%

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

   if -4.99999999999999999e-15 < (/.f64 z t) < 5.0000000000000002e-23

   1. Initial program 97.5%

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

   3. Taylor expanded in y around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 96.3

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

   5. Applied rewrites 96.3%

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

4. Final simplification 96.1%

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

Alternative 4: 84.4% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- y x) (/ z t))))
   (if (<= (/ z t) -2e-71)
     t_1
     (if (<= (/ z t) 5e-24) (- x (* (/ x t) z)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y - x) * (z / t);
	double tmp;
	if ((z / t) <= -2e-71) {
		tmp = t_1;
	} else if ((z / t) <= 5e-24) {
		tmp = x - ((x / t) * z);
	} 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 = (y - x) * (z / t)
    if ((z / t) <= (-2d-71)) then
        tmp = t_1
    else if ((z / t) <= 5d-24) then
        tmp = x - ((x / t) * z)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -1.9999999999999998e-71 or 4.9999999999999998e-24 < (/.f64 z t)

   1. Initial program 97.8%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 86.9

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

   5. Applied rewrites 86.9%

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

   7. Applied rewrites 92.1%

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

   if -1.9999999999999998e-71 < (/.f64 z t) < 4.9999999999999998e-24

   1. Initial program 97.2%

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

   3. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. unsub-neg N/A

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

      3. lower--.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 72.7

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

   5. Applied rewrites 72.7%

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

4. Final simplification 83.0%

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

Alternative 5: 37.6% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ (* (- y x) (/ z t)) x) -5e-208) (* (/ y t) z) (/ (* y z) t)))

C

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

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (((y - x) * (z / t)) + x) <= -5e-208:
		tmp = (y / t) * z
	else:
		tmp = (y * z) / t
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((((y - x) * (z / t)) + x) <= -5e-208)
		tmp = (y / t) * z;
	else
		tmp = (y * z) / t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (*.f64 (-.f64 y x) (/.f64 z t))) < -4.99999999999999963e-208

   1. Initial program 98.8%

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

   3. Taylor expanded in y around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 39.8

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

   5. Applied rewrites 39.8%

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

   if -4.99999999999999963e-208 < (+.f64 x (*.f64 (-.f64 y x) (/.f64 z t)))

   1. Initial program 96.1%

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

   3. Taylor expanded in y around inf

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

      1. associate-*l/ N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 38.2

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

   5. Applied rewrites 38.2%

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

   7. Applied rewrites 42.9%

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

4. Final simplification 41.3%

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

Alternative 6: 48.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{-x}{t} \cdot z\\ \mathbf{if}\;x \leq -2.2 \cdot 10^{+20}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+61}:\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	double t_1 = (-x / t) * z;
	double tmp;
	if (x <= -2.2e+20) {
		tmp = t_1;
	} else if (x <= 8e+61) {
		tmp = y * (z / 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 / t) * z
    if (x <= (-2.2d+20)) then
        tmp = t_1
    else if (x <= 8d+61) then
        tmp = y * (z / 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 / t) * z;
	double tmp;
	if (x <= -2.2e+20) {
		tmp = t_1;
	} else if (x <= 8e+61) {
		tmp = y * (z / t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.2e20 or 7.9999999999999996e61 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. lower--.f64 47.3

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

   5. Applied rewrites 47.3%

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

   6. Taylor expanded in y around 0

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

   8. Applied rewrites 42.5%

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

   if -2.2e20 < x < 7.9999999999999996e61

   1. Initial program 95.4%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. clear-num N/A

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

      6. un-div-inv N/A

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

      7. lift--.f64 N/A

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

      8. flip-- N/A

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

      9. div-inv N/A

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

      10. div-inv N/A

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

      11. times-frac N/A

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

      12. lower-fma.f64 N/A

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

   4. Applied rewrites 69.8%

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

   5. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lower-/.f64 62.2

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

   7. Applied rewrites 62.2%

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

4. Final simplification 53.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.2 \cdot 10^{+20}:\\ \;\;\;\;\frac{-x}{t} \cdot z\\ \mathbf{elif}\;x \leq 8 \cdot 10^{+61}:\\ \;\;\;\;y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{-x}{t} \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 61.2% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

3. Taylor expanded in t around 0

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

   1. lower-/.f64 N/A

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

   2. *-commutative N/A

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

   3. lower-*.f64 N/A

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

   4. lower--.f64 57.7

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

5. Applied rewrites 57.7%

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

7. Applied rewrites 60.8%

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

8. Final simplification 60.8%

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

Alternative 8: 40.7% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. clear-num N/A

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

   6. un-div-inv N/A

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

   7. lift--.f64 N/A

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

   8. flip-- N/A

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

   9. div-inv N/A

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

   10. div-inv N/A

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

   11. times-frac N/A

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

   12. lower-fma.f64 N/A

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

4. Applied rewrites 56.3%

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

5. Taylor expanded in y around inf

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

   1. *-commutative N/A

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

   2. associate-*l/ N/A

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

   3. lower-*.f64 N/A

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

   4. lower-/.f64 42.1

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

7. Applied rewrites 42.1%

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

8. Final simplification 42.1%

   \[\leadsto y \cdot \frac{z}{t} \]
9. Add Preprocessing

Alternative 9: 37.3% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 97.5%

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

3. Taylor expanded in y around inf

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

   1. associate-*l/ N/A

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

   2. lower-*.f64 N/A

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

   3. lower-/.f64 39.0

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

5. Applied rewrites 39.0%

   \[\leadsto \color{blue}{\frac{y}{t} \cdot z} \]
6. Add Preprocessing

Developer Target 1: 97.6% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \left(y - x\right) \cdot \frac{z}{t}\\ t_2 := x + \frac{y - x}{\frac{t}{z}}\\ \mathbf{if}\;t\_1 < -1013646692435.8867:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 < 0:\\ \;\;\;\;x + \frac{\left(y - x\right) \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* (- y x) (/ z t))) (t_2 (+ x (/ (- y x) (/ t z)))))
   (if (< t_1 -1013646692435.8867)
     t_2
     (if (< t_1 0.0) (+ x (/ (* (- y x) z) t)) t_2))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (y - x) * (z / t);
	double t_2 = x + ((y - x) / (t / z));
	double tmp;
	if (t_1 < -1013646692435.8867) {
		tmp = t_2;
	} else if (t_1 < 0.0) {
		tmp = x + (((y - x) * z) / t);
	} else {
		tmp = t_2;
	}
	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) :: t_2
    real(8) :: tmp
    t_1 = (y - x) * (z / t)
    t_2 = x + ((y - x) / (t / z))
    if (t_1 < (-1013646692435.8867d0)) then
        tmp = t_2
    else if (t_1 < 0.0d0) then
        tmp = x + (((y - x) * z) / t)
    else
        tmp = t_2
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = (y - x) * (z / t);
	double t_2 = x + ((y - x) / (t / z));
	double tmp;
	if (t_1 < -1013646692435.8867) {
		tmp = t_2;
	} else if (t_1 < 0.0) {
		tmp = x + (((y - x) * z) / t);
	} else {
		tmp = t_2;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (y - x) * (z / t)
	t_2 = x + ((y - x) / (t / z))
	tmp = 0
	if t_1 < -1013646692435.8867:
		tmp = t_2
	elif t_1 < 0.0:
		tmp = x + (((y - x) * z) / t)
	else:
		tmp = t_2
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2024270 
(FPCore (x y z t)
  :name "Graphics.Rendering.Plot.Render.Plot.Axis:tickPosition from plot-0.2.3.4"
  :precision binary64

  :alt
  (! :herbie-platform default (if (< (* (- y x) (/ z t)) -10136466924358867/10000) (+ x (/ (- y x) (/ t z))) (if (< (* (- y x) (/ z t)) 0) (+ x (/ (* (- y x) z) t)) (+ x (/ (- y x) (/ t z))))))

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