Linear.Projection:infinitePerspective from linear-1.19.1.3, A

Percentage Accurate: 88.9% → 97.0%

Time: 3.9s

Alternatives: 8

Speedup: 1.3×

Specification

Math

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

FPCore

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

C

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

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 * 2.0d0) / ((y * z) - (t * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 88.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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 * 2.0d0) / ((y * z) - (t * z))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;z\_m \leq 2 \cdot 10^{-15}:\\ \;\;\;\;\frac{x + x}{\left(y - t\right) \cdot z\_m}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x + x}{z\_m}}{y - t}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (<= z_m 2e-15) (/ (+ x x) (* (- y t) z_m)) (/ (/ (+ x x) z_m) (- y t)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 2e-15) {
		tmp = (x + x) / ((y - t) * z_m);
	} else {
		tmp = ((x + x) / z_m) / (y - t);
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z_m <= 2d-15) then
        tmp = (x + x) / ((y - t) * z_m)
    else
        tmp = ((x + x) / z_m) / (y - t)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (z_m <= 2e-15) {
		tmp = (x + x) / ((y - t) * z_m);
	} else {
		tmp = ((x + x) / z_m) / (y - t);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if z_m <= 2e-15:
		tmp = (x + x) / ((y - t) * z_m)
	else:
		tmp = ((x + x) / z_m) / (y - t)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (z_m <= 2e-15)
		tmp = Float64(Float64(x + x) / Float64(Float64(y - t) * z_m));
	else
		tmp = Float64(Float64(Float64(x + x) / z_m) / Float64(y - t));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (z_m <= 2e-15)
		tmp = (x + x) / ((y - t) * z_m);
	else
		tmp = ((x + x) / z_m) / (y - t);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * If[LessEqual[z$95$m, 2e-15], N[(N[(x + x), $MachinePrecision] / N[(N[(y - t), $MachinePrecision] * z$95$m), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x + x), $MachinePrecision] / z$95$m), $MachinePrecision] / N[(y - t), $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if z < 2.0000000000000002e-15

   1. Initial program 95.8%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 95.8

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

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

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower--.f64 97.1

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

   3. Applied rewrites 97.1%

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

   if 2.0000000000000002e-15 < z

   1. Initial program 82.7%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*r/ N/A

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

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

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

      9. count-2-rev N/A

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

      10. associate-/r* N/A

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

      11. associate-/r* N/A

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

      12. div-add-rev N/A

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

      13. count-2-rev N/A

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

      14. lower-/.f64 N/A

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

      15. associate-*r/ N/A

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

      16. *-commutative N/A

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

      17. lower-/.f64 N/A

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

      18. *-commutative N/A

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

      19. count-2-rev N/A

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

      20. lower-+.f64 N/A

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

      21. lower--.f64 96.9

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

   3. Applied rewrites 96.9%

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

Alternative 2: 91.2% accurate, 1.3× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (* z_s (/ (+ x x) (* (- y t) z_m))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	return z_s * ((x + x) / ((y - t) * z_m));
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    code = z_s * ((x + x) / ((y - t) * z_m))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	return z_s * ((x + x) / ((y - t) * z_m));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	return z_s * ((x + x) / ((y - t) * z_m))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	return Float64(z_s * Float64(Float64(x + x) / Float64(Float64(y - t) * z_m)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m, t)
	tmp = z_s * ((x + x) / ((y - t) * z_m));
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * N[(N[(x + x), $MachinePrecision] / N[(N[(y - t), $MachinePrecision] * z$95$m), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.9%

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

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. count-2-rev N/A

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

   4. lower-+.f64 88.9

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

   5. lift-*.f64 N/A

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

   6. lift-*.f64 N/A

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

   7. lift--.f64 N/A

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

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

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

   9. *-commutative N/A

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

   10. lower-*.f64 N/A

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

   11. lower--.f64 91.2

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

3. Applied rewrites 91.2%

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

Alternative 3: 73.8% accurate, 0.8× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;t \leq -3.7 \cdot 10^{-39}:\\ \;\;\;\;\frac{\frac{x}{t}}{z\_m} \cdot -2\\ \mathbf{elif}\;t \leq 7:\\ \;\;\;\;\frac{x + x}{z\_m \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x + x}{z\_m}}{-t}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (<= t -3.7e-39)
    (* (/ (/ x t) z_m) -2.0)
    (if (<= t 7.0) (/ (+ x x) (* z_m y)) (/ (/ (+ x x) z_m) (- t))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -3.7e-39) {
		tmp = ((x / t) / z_m) * -2.0;
	} else if (t <= 7.0) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = ((x + x) / z_m) / -t;
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-3.7d-39)) then
        tmp = ((x / t) / z_m) * (-2.0d0)
    else if (t <= 7.0d0) then
        tmp = (x + x) / (z_m * y)
    else
        tmp = ((x + x) / z_m) / -t
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -3.7e-39) {
		tmp = ((x / t) / z_m) * -2.0;
	} else if (t <= 7.0) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = ((x + x) / z_m) / -t;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if t <= -3.7e-39:
		tmp = ((x / t) / z_m) * -2.0
	elif t <= 7.0:
		tmp = (x + x) / (z_m * y)
	else:
		tmp = ((x + x) / z_m) / -t
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (t <= -3.7e-39)
		tmp = Float64(Float64(Float64(x / t) / z_m) * -2.0);
	elseif (t <= 7.0)
		tmp = Float64(Float64(x + x) / Float64(z_m * y));
	else
		tmp = Float64(Float64(Float64(x + x) / z_m) / Float64(-t));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (t <= -3.7e-39)
		tmp = ((x / t) / z_m) * -2.0;
	elseif (t <= 7.0)
		tmp = (x + x) / (z_m * y);
	else
		tmp = ((x + x) / z_m) / -t;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * If[LessEqual[t, -3.7e-39], N[(N[(N[(x / t), $MachinePrecision] / z$95$m), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[t, 7.0], N[(N[(x + x), $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(x + x), $MachinePrecision] / z$95$m), $MachinePrecision] / (-t)), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if t < -3.70000000000000015e-39

   1. Initial program 87.1%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 71.3

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

   4. Applied rewrites 71.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   if -3.70000000000000015e-39 < t < 7

   1. Initial program 91.6%

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

   2. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 74.0

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

   4. Applied rewrites 74.0%

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

   if 7 < t

   1. Initial program 85.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. *-commutative N/A

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

      7. associate-*r/ N/A

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

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

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

      9. count-2-rev N/A

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

      10. associate-/r* N/A

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

      11. associate-/r* N/A

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

      12. div-add-rev N/A

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

      13. count-2-rev N/A

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

      14. lower-/.f64 N/A

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

      15. associate-*r/ N/A

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

      16. *-commutative N/A

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

      17. lower-/.f64 N/A

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

      18. *-commutative N/A

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

      19. count-2-rev N/A

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

      20. lower-+.f64 N/A

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

      21. lower--.f64 90.8

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

   3. Applied rewrites 90.8%

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

   4. Taylor expanded in y around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 74.1

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

   6. Applied rewrites 74.1%

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

Alternative 4: 73.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;t \leq -3.7 \cdot 10^{-39}:\\ \;\;\;\;\frac{\frac{x}{t}}{z\_m} \cdot -2\\ \mathbf{elif}\;t \leq 7:\\ \;\;\;\;\frac{x + x}{z\_m \cdot y}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{z\_m} \cdot \frac{-2}{t}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (<= t -3.7e-39)
    (* (/ (/ x t) z_m) -2.0)
    (if (<= t 7.0) (/ (+ x x) (* z_m y)) (* (/ x z_m) (/ -2.0 t))))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -3.7e-39) {
		tmp = ((x / t) / z_m) * -2.0;
	} else if (t <= 7.0) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = (x / z_m) * (-2.0 / t);
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-3.7d-39)) then
        tmp = ((x / t) / z_m) * (-2.0d0)
    else if (t <= 7.0d0) then
        tmp = (x + x) / (z_m * y)
    else
        tmp = (x / z_m) * ((-2.0d0) / t)
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (t <= -3.7e-39) {
		tmp = ((x / t) / z_m) * -2.0;
	} else if (t <= 7.0) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = (x / z_m) * (-2.0 / t);
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if t <= -3.7e-39:
		tmp = ((x / t) / z_m) * -2.0
	elif t <= 7.0:
		tmp = (x + x) / (z_m * y)
	else:
		tmp = (x / z_m) * (-2.0 / t)
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (t <= -3.7e-39)
		tmp = Float64(Float64(Float64(x / t) / z_m) * -2.0);
	elseif (t <= 7.0)
		tmp = Float64(Float64(x + x) / Float64(z_m * y));
	else
		tmp = Float64(Float64(x / z_m) * Float64(-2.0 / t));
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (t <= -3.7e-39)
		tmp = ((x / t) / z_m) * -2.0;
	elseif (t <= 7.0)
		tmp = (x + x) / (z_m * y);
	else
		tmp = (x / z_m) * (-2.0 / t);
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * If[LessEqual[t, -3.7e-39], N[(N[(N[(x / t), $MachinePrecision] / z$95$m), $MachinePrecision] * -2.0), $MachinePrecision], If[LessEqual[t, 7.0], N[(N[(x + x), $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision], N[(N[(x / z$95$m), $MachinePrecision] * N[(-2.0 / t), $MachinePrecision]), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if t < -3.70000000000000015e-39

   1. Initial program 87.1%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 71.3

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

   4. Applied rewrites 71.3%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 73.2

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

   6. Applied rewrites 73.2%

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

   if -3.70000000000000015e-39 < t < 7

   1. Initial program 91.6%

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

   2. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 74.0

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

   4. Applied rewrites 74.0%

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

   if 7 < t

   1. Initial program 85.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

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

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

      7. times-frac N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lower-/.f64 N/A

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

      11. lower--.f64 90.7

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

   3. Applied rewrites 90.7%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 74.0

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

   6. Applied rewrites 74.0%

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

Alternative 5: 73.5% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ \begin{array}{l} t_1 := x \cdot \frac{\frac{2}{y}}{z\_m}\\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -3.1 \cdot 10^{+42}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 1.75 \cdot 10^{-13}:\\ \;\;\;\;\frac{\frac{x}{t}}{z\_m} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (let* ((t_1 (* x (/ (/ 2.0 y) z_m))))
   (*
    z_s
    (if (<= y -3.1e+42)
      t_1
      (if (<= y 1.75e-13) (* (/ (/ x t) z_m) -2.0) t_1)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = x * ((2.0 / y) / z_m);
	double tmp;
	if (y <= -3.1e+42) {
		tmp = t_1;
	} else if (y <= 1.75e-13) {
		tmp = ((x / t) / z_m) * -2.0;
	} else {
		tmp = t_1;
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = x * ((2.0d0 / y) / z_m)
    if (y <= (-3.1d+42)) then
        tmp = t_1
    else if (y <= 1.75d-13) then
        tmp = ((x / t) / z_m) * (-2.0d0)
    else
        tmp = t_1
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = x * ((2.0 / y) / z_m);
	double tmp;
	if (y <= -3.1e+42) {
		tmp = t_1;
	} else if (y <= 1.75e-13) {
		tmp = ((x / t) / z_m) * -2.0;
	} else {
		tmp = t_1;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	t_1 = x * ((2.0 / y) / z_m)
	tmp = 0
	if y <= -3.1e+42:
		tmp = t_1
	elif y <= 1.75e-13:
		tmp = ((x / t) / z_m) * -2.0
	else:
		tmp = t_1
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	t_1 = Float64(x * Float64(Float64(2.0 / y) / z_m))
	tmp = 0.0
	if (y <= -3.1e+42)
		tmp = t_1;
	elseif (y <= 1.75e-13)
		tmp = Float64(Float64(Float64(x / t) / z_m) * -2.0);
	else
		tmp = t_1;
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	t_1 = x * ((2.0 / y) / z_m);
	tmp = 0.0;
	if (y <= -3.1e+42)
		tmp = t_1;
	elseif (y <= 1.75e-13)
		tmp = ((x / t) / z_m) * -2.0;
	else
		tmp = t_1;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := Block[{t$95$1 = N[(x * N[(N[(2.0 / y), $MachinePrecision] / z$95$m), $MachinePrecision]), $MachinePrecision]}, N[(z$95$s * If[LessEqual[y, -3.1e+42], t$95$1, If[LessEqual[y, 1.75e-13], N[(N[(N[(x / t), $MachinePrecision] / z$95$m), $MachinePrecision] * -2.0), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.1000000000000002e42 or 1.7500000000000001e-13 < y

   1. Initial program 86.1%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. lift--.f64 N/A

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

      6. associate-/l* N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

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

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

      10. *-commutative N/A

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

      11. lower-*.f64 N/A

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

      12. lower--.f64 89.4

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

   3. Applied rewrites 89.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 74.4%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 74.9

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

   8. Applied rewrites 74.9%

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

   if -3.1000000000000002e42 < y < 1.7500000000000001e-13

   1. Initial program 91.4%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 71.8

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

   4. Applied rewrites 71.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 72.3

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

   6. Applied rewrites 72.3%

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

Alternative 6: 73.4% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ z\_s \cdot \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{+42}:\\ \;\;\;\;\frac{\frac{x + x}{y}}{z\_m}\\ \mathbf{elif}\;y \leq 1.75 \cdot 10^{-13}:\\ \;\;\;\;\frac{\frac{x}{t}}{z\_m} \cdot -2\\ \mathbf{else}:\\ \;\;\;\;\frac{\frac{x + x}{z\_m}}{y}\\ \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (*
  z_s
  (if (<= y -2.1e+42)
    (/ (/ (+ x x) y) z_m)
    (if (<= y 1.75e-13) (* (/ (/ x t) z_m) -2.0) (/ (/ (+ x x) z_m) y)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (y <= -2.1e+42) {
		tmp = ((x + x) / y) / z_m;
	} else if (y <= 1.75e-13) {
		tmp = ((x / t) / z_m) * -2.0;
	} else {
		tmp = ((x + x) / z_m) / y;
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: tmp
    if (y <= (-2.1d+42)) then
        tmp = ((x + x) / y) / z_m
    else if (y <= 1.75d-13) then
        tmp = ((x / t) / z_m) * (-2.0d0)
    else
        tmp = ((x + x) / z_m) / y
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double tmp;
	if (y <= -2.1e+42) {
		tmp = ((x + x) / y) / z_m;
	} else if (y <= 1.75e-13) {
		tmp = ((x / t) / z_m) * -2.0;
	} else {
		tmp = ((x + x) / z_m) / y;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	tmp = 0
	if y <= -2.1e+42:
		tmp = ((x + x) / y) / z_m
	elif y <= 1.75e-13:
		tmp = ((x / t) / z_m) * -2.0
	else:
		tmp = ((x + x) / z_m) / y
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	tmp = 0.0
	if (y <= -2.1e+42)
		tmp = Float64(Float64(Float64(x + x) / y) / z_m);
	elseif (y <= 1.75e-13)
		tmp = Float64(Float64(Float64(x / t) / z_m) * -2.0);
	else
		tmp = Float64(Float64(Float64(x + x) / z_m) / y);
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	tmp = 0.0;
	if (y <= -2.1e+42)
		tmp = ((x + x) / y) / z_m;
	elseif (y <= 1.75e-13)
		tmp = ((x / t) / z_m) * -2.0;
	else
		tmp = ((x + x) / z_m) / y;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * If[LessEqual[y, -2.1e+42], N[(N[(N[(x + x), $MachinePrecision] / y), $MachinePrecision] / z$95$m), $MachinePrecision], If[LessEqual[y, 1.75e-13], N[(N[(N[(x / t), $MachinePrecision] / z$95$m), $MachinePrecision] * -2.0), $MachinePrecision], N[(N[(N[(x + x), $MachinePrecision] / z$95$m), $MachinePrecision] / y), $MachinePrecision]]]), $MachinePrecision]

Derivation

1. Split input into 3 regimes

2. if y < -2.09999999999999995e42

   1. Initial program 85.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 85.2

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

      5. lift-*.f64 N/A

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

      6. lift-*.f64 N/A

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

      7. lift--.f64 N/A

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

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

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

      9. *-commutative N/A

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

      10. lower-*.f64 N/A

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

      11. lower--.f64 88.6

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

   3. Applied rewrites 88.6%

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

      1. lift-+.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. lift-*.f64 N/A

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

      4. lift--.f64 N/A

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

      5. associate-/r* N/A

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

      6. lower-/.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. lift-+.f64 N/A

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

      9. lift--.f64 90.8

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

   5. Applied rewrites 90.8%

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

   6. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. count-2-rev N/A

         \[\leadsto \frac{\frac{x + x}{y}}{z} \]

      4. lift-+.f64 77.6

         \[\leadsto \frac{\frac{x + x}{y}}{z} \]

   8. Applied rewrites 77.6%

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

   if -2.09999999999999995e42 < y < 1.7500000000000001e-13

   1. Initial program 91.4%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 71.8

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

   4. Applied rewrites 71.8%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 72.3

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

   6. Applied rewrites 72.3%

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

   if 1.7500000000000001e-13 < y

   1. Initial program 86.9%

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

   2. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 72.7

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

   4. Applied rewrites 72.7%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-/r* N/A

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

      5. count-2-rev N/A

         \[\leadsto \frac{\frac{2 \cdot x}{z}}{y} \]

      6. associate-*r/ N/A

         \[\leadsto \frac{2 \cdot \frac{x}{z}}{y} \]

      7. lower-/.f64 N/A

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

      8. associate-*r/ N/A

         \[\leadsto \frac{\frac{2 \cdot x}{z}}{y} \]

      9. count-2-rev N/A

         \[\leadsto \frac{\frac{x + x}{z}}{y} \]

      10. lower-/.f64 N/A

          \[\leadsto \frac{\frac{x + x}{z}}{y} \]

      11. lift-+.f64 72.2

          \[\leadsto \frac{\frac{x + x}{z}}{y} \]

   6. Applied rewrites 72.2%

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

Alternative 7: 72.8% accurate, 0.9× speedup

Math

\[\begin{array}{l} z\_m = \left|z\right| \\ z\_s = \mathsf{copysign}\left(1, z\right) \\ \begin{array}{l} t_1 := \frac{x}{t \cdot z\_m} \cdot -2\\ z\_s \cdot \begin{array}{l} \mathbf{if}\;t \leq -3.7 \cdot 10^{-39}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t \leq 8.6 \cdot 10^{+57}:\\ \;\;\;\;\frac{x + x}{z\_m \cdot y}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \end{array} \]

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t)
 :precision binary64
 (let* ((t_1 (* (/ x (* t z_m)) -2.0)))
   (*
    z_s
    (if (<= t -3.7e-39) t_1 (if (<= t 8.6e+57) (/ (+ x x) (* z_m y)) t_1)))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = (x / (t * z_m)) * -2.0;
	double tmp;
	if (t <= -3.7e-39) {
		tmp = t_1;
	} else if (t <= 8.6e+57) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = t_1;
	}
	return z_s * tmp;
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x / (t * z_m)) * (-2.0d0)
    if (t <= (-3.7d-39)) then
        tmp = t_1
    else if (t <= 8.6d+57) then
        tmp = (x + x) / (z_m * y)
    else
        tmp = t_1
    end if
    code = z_s * tmp
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	double t_1 = (x / (t * z_m)) * -2.0;
	double tmp;
	if (t <= -3.7e-39) {
		tmp = t_1;
	} else if (t <= 8.6e+57) {
		tmp = (x + x) / (z_m * y);
	} else {
		tmp = t_1;
	}
	return z_s * tmp;
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	t_1 = (x / (t * z_m)) * -2.0
	tmp = 0
	if t <= -3.7e-39:
		tmp = t_1
	elif t <= 8.6e+57:
		tmp = (x + x) / (z_m * y)
	else:
		tmp = t_1
	return z_s * tmp

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	t_1 = Float64(Float64(x / Float64(t * z_m)) * -2.0)
	tmp = 0.0
	if (t <= -3.7e-39)
		tmp = t_1;
	elseif (t <= 8.6e+57)
		tmp = Float64(Float64(x + x) / Float64(z_m * y));
	else
		tmp = t_1;
	end
	return Float64(z_s * tmp)
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp_2 = code(z_s, x, y, z_m, t)
	t_1 = (x / (t * z_m)) * -2.0;
	tmp = 0.0;
	if (t <= -3.7e-39)
		tmp = t_1;
	elseif (t <= 8.6e+57)
		tmp = (x + x) / (z_m * y);
	else
		tmp = t_1;
	end
	tmp_2 = z_s * tmp;
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := Block[{t$95$1 = N[(N[(x / N[(t * z$95$m), $MachinePrecision]), $MachinePrecision] * -2.0), $MachinePrecision]}, N[(z$95$s * If[LessEqual[t, -3.7e-39], t$95$1, If[LessEqual[t, 8.6e+57], N[(N[(x + x), $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision], t$95$1]]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if t < -3.70000000000000015e-39 or 8.60000000000000066e57 < t

   1. Initial program 86.0%

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

   2. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lift-*.f64 74.2

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

   4. Applied rewrites 74.2%

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

   if -3.70000000000000015e-39 < t < 8.60000000000000066e57

   1. Initial program 91.6%

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

   2. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. *-commutative N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. count-2-rev N/A

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

      6. lower-+.f64 N/A

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

      7. *-commutative N/A

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

      8. lower-*.f64 71.6

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

   4. Applied rewrites 71.6%

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

Alternative 8: 52.4% accurate, 1.6× speedup

Math

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

FPCore

z\_m = (fabs.f64 z)
z\_s = (copysign.f64 #s(literal 1 binary64) z)
(FPCore (z_s x y z_m t) :precision binary64 (* z_s (/ (+ x x) (* z_m y))))

C

z\_m = fabs(z);
z\_s = copysign(1.0, z);
double code(double z_s, double x, double y, double z_m, double t) {
	return z_s * ((x + x) / (z_m * y));
}

Fortran

z\_m =     private
z\_s =     private
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(z_s, x, y, z_m, t)
use fmin_fmax_functions
    real(8), intent (in) :: z_s
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z_m
    real(8), intent (in) :: t
    code = z_s * ((x + x) / (z_m * y))
end function

Java

z\_m = Math.abs(z);
z\_s = Math.copySign(1.0, z);
public static double code(double z_s, double x, double y, double z_m, double t) {
	return z_s * ((x + x) / (z_m * y));
}

Python

z\_m = math.fabs(z)
z\_s = math.copysign(1.0, z)
def code(z_s, x, y, z_m, t):
	return z_s * ((x + x) / (z_m * y))

Julia

z\_m = abs(z)
z\_s = copysign(1.0, z)
function code(z_s, x, y, z_m, t)
	return Float64(z_s * Float64(Float64(x + x) / Float64(z_m * y)))
end

MATLAB

z\_m = abs(z);
z\_s = sign(z) * abs(1.0);
function tmp = code(z_s, x, y, z_m, t)
	tmp = z_s * ((x + x) / (z_m * y));
end

Wolfram

z\_m = N[Abs[z], $MachinePrecision]
z\_s = N[With[{TMP1 = Abs[1.0], TMP2 = Sign[z]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]
code[z$95$s_, x_, y_, z$95$m_, t_] := N[(z$95$s * N[(N[(x + x), $MachinePrecision] / N[(z$95$m * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 88.9%

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

2. Taylor expanded in y around inf

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

   1. associate-*r/ N/A

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

   2. *-commutative N/A

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

   3. lower-/.f64 N/A

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

   4. *-commutative N/A

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

   5. count-2-rev N/A

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

   6. lower-+.f64 N/A

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

   7. *-commutative N/A

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

   8. lower-*.f64 52.4

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

4. Applied rewrites 52.4%

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

Reproduce

herbie shell --seed 2025112 
(FPCore (x y z t)
  :name "Linear.Projection:infinitePerspective from linear-1.19.1.3, A"
  :precision binary64
  (/ (* x 2.0) (- (* y z) (* t z))))