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

Percentage Accurate: 97.6% → 97.6%

Time: 3.7s

Alternatives: 11

Speedup: 1.0×

• 24.5% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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.6% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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]

Derivation

1. Initial program 98.4%

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

Alternative 2: 95.0% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -2e14 or 50 < (/.f64 z t)

   1. Initial program 97.6%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 93.5

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

   5. Applied rewrites 93.5%

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

   if -2e14 < (/.f64 z t) < 50

   1. Initial program 99.1%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 97.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 97.7

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

   7. Applied rewrites 97.7%

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

4. Final simplification 95.6%

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

Alternative 3: 94.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z}{t} \leq -2000000000:\\ \;\;\;\;\frac{\left(y - x\right) \cdot z}{t}\\ \mathbf{elif}\;\frac{z}{t} \leq 50:\\ \;\;\;\;x + y \cdot \frac{z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - x}{t} \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ z t) -2000000000.0)
   (/ (* (- y x) z) t)
   (if (<= (/ z t) 50.0) (+ x (* y (/ z t))) (* (/ (- y x) t) z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z / t) <= -2000000000.0) {
		tmp = ((y - x) * z) / t;
	} else if ((z / t) <= 50.0) {
		tmp = x + (y * (z / t));
	} else {
		tmp = ((y - x) / t) * z;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z / t) <= (-2000000000.0d0)) then
        tmp = ((y - x) * z) / t
    else if ((z / t) <= 50.0d0) then
        tmp = x + (y * (z / t))
    else
        tmp = ((y - x) / t) * z
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z, t):
	tmp = 0
	if (z / t) <= -2000000000.0:
		tmp = ((y - x) * z) / t
	elif (z / t) <= 50.0:
		tmp = x + (y * (z / t))
	else:
		tmp = ((y - x) / t) * z
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 z t) < -2e9

   1. Initial program 98.4%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-*.f64 90.0

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

   5. Applied rewrites 90.0%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 89.1

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

   8. Applied rewrites 89.1%

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

   if -2e9 < (/.f64 z t) < 50

   1. Initial program 99.1%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.1%

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

   if 50 < (/.f64 z t)

   1. Initial program 96.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 96.3

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

   5. Applied rewrites 96.3%

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

Alternative 4: 94.9% accurate, 0.4× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (/ z t) -2000000000.0)
   (/ (* (- y x) z) t)
   (if (<= (/ z t) 50.0) (fma (/ z t) y x) (* (/ (- y x) t) z))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z / t) <= -2000000000.0) {
		tmp = ((y - x) * z) / t;
	} else if ((z / t) <= 50.0) {
		tmp = fma((z / t), y, x);
	} else {
		tmp = ((y - x) / t) * z;
	}
	return tmp;
}

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 z t) < -2e9

   1. Initial program 98.4%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-*.f64 90.0

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

   5. Applied rewrites 90.0%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 89.1

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

   8. Applied rewrites 89.1%

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

   if -2e9 < (/.f64 z t) < 50

   1. Initial program 99.1%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 99.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 99.1

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

   7. Applied rewrites 99.1%

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

   if 50 < (/.f64 z t)

   1. Initial program 96.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. sub-div N/A

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

      4. lower-/.f64 N/A

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

      5. lift--.f64 96.3

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

   5. Applied rewrites 96.3%

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

Alternative 5: 75.8% accurate, 0.4× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (/.f64 z t) < -4.99999999999999989e122

   1. Initial program 97.7%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-*.f64 99.9

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

   5. Applied rewrites 99.9%

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

   6. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 74.3

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

   8. Applied rewrites 74.3%

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

   if -4.99999999999999989e122 < (/.f64 z t) < -2e9

   1. Initial program 99.6%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \left(1 - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{z}{t}\right) \cdot x \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 76.8

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

   5. Applied rewrites 76.8%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 74.0

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

   8. Applied rewrites 74.0%

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

   if -2e9 < (/.f64 z t)

   1. Initial program 98.4%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 83.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 83.7

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

   7. Applied rewrites 83.7%

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

Alternative 6: 63.9% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\frac{z}{t} \leq -4 \cdot 10^{-7} \lor \neg \left(\frac{z}{t} \leq 2 \cdot 10^{-127}\right):\\ \;\;\;\;\frac{z}{t} \cdot y\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= (/ z t) -4e-7) (not (<= (/ z t) 2e-127))) (* (/ z t) y) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (((z / t) <= -4e-7) || !((z / t) <= 2e-127)) {
		tmp = (z / t) * y;
	} else {
		tmp = x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (((z / t) <= (-4d-7)) .or. (.not. ((z / t) <= 2d-127))) then
        tmp = (z / t) * y
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (((z / t) <= -4e-7) || !((z / t) <= 2e-127)) {
		tmp = (z / t) * y;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if ((z / t) <= -4e-7) or not ((z / t) <= 2e-127):
		tmp = (z / t) * y
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((Float64(z / t) <= -4e-7) || !(Float64(z / t) <= 2e-127))
		tmp = Float64(Float64(z / t) * y);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (((z / t) <= -4e-7) || ~(((z / t) <= 2e-127)))
		tmp = (z / t) * y;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[N[(z / t), $MachinePrecision], -4e-7], N[Not[LessEqual[N[(z / t), $MachinePrecision], 2e-127]], $MachinePrecision]], N[(N[(z / t), $MachinePrecision] * y), $MachinePrecision], x]

Derivation

1. Split input into 2 regimes

2. if (/.f64 z t) < -3.9999999999999998e-7 or 2.0000000000000001e-127 < (/.f64 z t)

   1. Initial program 97.9%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 57.9

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

   5. Applied rewrites 57.9%

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

   if -3.9999999999999998e-7 < (/.f64 z t) < 2.0000000000000001e-127

   1. Initial program 99.0%

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

   3. Taylor expanded in z around 0

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

   5. Applied rewrites 83.0%

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

4. Final simplification 68.2%

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

Alternative 7: 93.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -4.8 \cdot 10^{-125} \lor \neg \left(t \leq 2.8 \cdot 10^{-242}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{y - x}{t}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(y - x\right) \cdot z}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -4.8e-125) (not (<= t 2.8e-242)))
   (fma (/ (- y x) t) z x)
   (/ (* (- y x) z) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -4.8e-125) || !(t <= 2.8e-242)) {
		tmp = fma(((y - x) / t), z, x);
	} else {
		tmp = ((y - x) * z) / t;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -4.8e-125) || !(t <= 2.8e-242))
		tmp = fma(Float64(Float64(y - x) / t), z, x);
	else
		tmp = Float64(Float64(Float64(y - x) * z) / t);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -4.8e-125], N[Not[LessEqual[t, 2.8e-242]], $MachinePrecision]], N[(N[(N[(y - x), $MachinePrecision] / t), $MachinePrecision] * z + x), $MachinePrecision], N[(N[(N[(y - x), $MachinePrecision] * z), $MachinePrecision] / t), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -4.8000000000000003e-125 or 2.79999999999999983e-242 < t

   1. Initial program 98.9%

      \[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. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r/ N/A

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

      7. associate-*l/ N/A

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

      8. sub-div N/A

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

      9. lower-fma.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 96.7

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

   4. Applied rewrites 96.7%

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

   if -4.8000000000000003e-125 < t < 2.79999999999999983e-242

   1. Initial program 95.6%

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

   3. Taylor expanded in t around 0

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

      1. lower-/.f64 N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. lift--.f64 N/A

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

      6. lower-*.f64 96.6

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

   5. Applied rewrites 96.6%

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

   6. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lift--.f64 93.8

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

   8. Applied rewrites 93.8%

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

4. Final simplification 96.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -4.8 \cdot 10^{-125} \lor \neg \left(t \leq 2.8 \cdot 10^{-242}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{y - x}{t}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(y - x\right) \cdot z}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 86.2% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -1.15e+59) (not (<= x 580000000.0)))
   (* (- 1.0 (/ z t)) x)
   (fma (/ z t) y x)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x <= -1.15e+59) || !(x <= 580000000.0)) {
		tmp = (1.0 - (z / t)) * x;
	} else {
		tmp = fma((z / t), y, x);
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((x <= -1.15e+59) || !(x <= 580000000.0))
		tmp = Float64(Float64(1.0 - Float64(z / t)) * x);
	else
		tmp = fma(Float64(z / t), y, x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[x, -1.15e+59], N[Not[LessEqual[x, 580000000.0]], $MachinePrecision]], N[(N[(1.0 - N[(z / t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.15000000000000004e59 or 5.8e8 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. fp-cancel-sign-sub-inv N/A

         \[\leadsto \left(1 - \left(\mathsf{neg}\left(-1\right)\right) \cdot \frac{z}{t}\right) \cdot x \]

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lift-/.f64 91.0

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

   5. Applied rewrites 91.0%

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

   if -1.15000000000000004e59 < x < 5.8e8

   1. Initial program 97.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 85.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. *-commutative N/A

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

      6. lower-fma.f64 N/A

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

      7. lift-/.f64 85.6

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

   7. Applied rewrites 85.6%

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

4. Final simplification 88.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.15 \cdot 10^{+59} \lor \neg \left(x \leq 580000000\right):\\ \;\;\;\;\left(1 - \frac{z}{t}\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 74.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;t \leq -8.6 \cdot 10^{-182} \lor \neg \left(t \leq 5.8 \cdot 10^{-237}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{t}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{t} \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -8.6e-182) (not (<= t 5.8e-237)))
   (fma (/ y t) z x)
   (* (/ z t) y)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -8.6e-182) || !(t <= 5.8e-237)) {
		tmp = fma((y / t), z, x);
	} else {
		tmp = (z / t) * y;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -8.6e-182) || !(t <= 5.8e-237))
		tmp = fma(Float64(y / t), z, x);
	else
		tmp = Float64(Float64(z / t) * y);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[Or[LessEqual[t, -8.6e-182], N[Not[LessEqual[t, 5.8e-237]], $MachinePrecision]], N[(N[(y / t), $MachinePrecision] * z + x), $MachinePrecision], N[(N[(z / t), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -8.6e-182 or 5.80000000000000022e-237 < t

   1. Initial program 98.1%

      \[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. lift--.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-/.f64 N/A

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

      5. +-commutative N/A

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

      6. associate-*r/ N/A

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

      7. associate-*l/ N/A

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

      8. sub-div N/A

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

      9. lower-fma.f64 N/A

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

      10. sub-div N/A

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

      11. lower-/.f64 N/A

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

      12. lift--.f64 95.7

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

   4. Applied rewrites 95.7%

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

   5. Taylor expanded in x around 0

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

      1. lower-/.f64 77.7

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

   7. Applied rewrites 77.7%

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

   if -8.6e-182 < t < 5.80000000000000022e-237

   1. Initial program 99.7%

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

   3. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. lower-*.f64 N/A

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

      4. lift-/.f64 69.4

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

   5. Applied rewrites 69.4%

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

4. Final simplification 76.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;t \leq -8.6 \cdot 10^{-182} \lor \neg \left(t \leq 5.8 \cdot 10^{-237}\right):\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{t}, z, x\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{z}{t} \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 76.9% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 98.4%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 77.4%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. lift-/.f64 N/A

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

   5. *-commutative N/A

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

   6. lower-fma.f64 N/A

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

   7. lift-/.f64 77.4

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

7. Applied rewrites 77.4%

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

Alternative 11: 38.9% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

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

Java

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

Python

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

Julia

function code(x, y, z, t)
	return x
end

MATLAB

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

Wolfram

code[x_, y_, z_, t_] := x

Derivation

1. Initial program 98.4%

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

3. Taylor expanded in z around 0

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

5. Applied rewrites 38.0%

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

Developer Target 1: 97.4% 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

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x, y, z, t)
use fmin_fmax_functions
    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 2025064 
(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))))