Linear.Projection:infinitePerspective from linear-1.19.1.3, A

Percentage Accurate: 89.6% → 96.1%

Time: 8.8s

Alternatives: 11

Speedup: 1.0×

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: 89.6% 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: 96.1% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= x_m 2.15e+86)
    (/ (/ (+ x_m x_m) z) (- y t))
    (/ (/ (+ x_m x_m) (- y t)) z))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (x_m <= 2.15e+86) {
		tmp = ((x_m + x_m) / z) / (y - t);
	} else {
		tmp = ((x_m + x_m) / (y - t)) / z;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (x_m <= 2.15d+86) then
        tmp = ((x_m + x_m) / z) / (y - t)
    else
        tmp = ((x_m + x_m) / (y - t)) / z
    end if
    code = x_s * tmp
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if x_m <= 2.15e+86:
		tmp = ((x_m + x_m) / z) / (y - t)
	else:
		tmp = ((x_m + x_m) / (y - t)) / z
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (x_m <= 2.15e+86)
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / Float64(y - t));
	else
		tmp = Float64(Float64(Float64(x_m + x_m) / Float64(y - t)) / z);
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (x_m <= 2.15e+86)
		tmp = ((x_m + x_m) / z) / (y - t);
	else
		tmp = ((x_m + x_m) / (y - t)) / z;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 2.1500000000000001e86

   1. Initial program 94.4%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 96.4

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

   3. Applied rewrites 96.4%

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

   if 2.1500000000000001e86 < x

   1. Initial program 81.0%

      \[\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. *-commutative N/A

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

      8. associate-/r* N/A

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

      9. frac-2neg-rev N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-neg-out N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. distribute-lft-out-- N/A

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

      15. lower-/.f64 N/A

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

   3. Applied rewrites 95.5%

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

Alternative 2: 93.8% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= z 2.2e-132)
    (/ (+ x_m x_m) (* (- y t) z))
    (/ (/ (+ x_m x_m) z) (- y t)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (z <= 2.2e-132) {
		tmp = (x_m + x_m) / ((y - t) * z);
	} else {
		tmp = ((x_m + x_m) / z) / (y - t);
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (z <= 2.2d-132) then
        tmp = (x_m + x_m) / ((y - t) * z)
    else
        tmp = ((x_m + x_m) / z) / (y - t)
    end if
    code = x_s * tmp
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if z <= 2.2e-132:
		tmp = (x_m + x_m) / ((y - t) * z)
	else:
		tmp = ((x_m + x_m) / z) / (y - t)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (z <= 2.2e-132)
		tmp = Float64(Float64(x_m + x_m) / Float64(Float64(y - t) * z));
	else
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / Float64(y - t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (z <= 2.2e-132)
		tmp = (x_m + x_m) / ((y - t) * z);
	else
		tmp = ((x_m + x_m) / z) / (y - t);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 2.19999999999999991e-132

   1. Initial program 90.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. *-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 90.7

         \[\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 92.7

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

   3. Applied rewrites 92.7%

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

   if 2.19999999999999991e-132 < z

   1. Initial program 87.6%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 95.9

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

   3. Applied rewrites 95.9%

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

Alternative 3: 90.9% accurate, 1.0× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= t 2.15e+148)
    (/ (+ x_m x_m) (* (- y t) z))
    (/ (/ (+ x_m x_m) z) (- t)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (t <= 2.15e+148) {
		tmp = (x_m + x_m) / ((y - t) * z);
	} else {
		tmp = ((x_m + x_m) / z) / -t;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= 2.15d+148) then
        tmp = (x_m + x_m) / ((y - t) * z)
    else
        tmp = ((x_m + x_m) / z) / -t
    end if
    code = x_s * tmp
end function

Java

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

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if t <= 2.15e+148:
		tmp = (x_m + x_m) / ((y - t) * z)
	else:
		tmp = ((x_m + x_m) / z) / -t
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (t <= 2.15e+148)
		tmp = Float64(Float64(x_m + x_m) / Float64(Float64(y - t) * z));
	else
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / Float64(-t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (t <= 2.15e+148)
		tmp = (x_m + x_m) / ((y - t) * z);
	else
		tmp = ((x_m + x_m) / z) / -t;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < 2.1500000000000001e148

   1. Initial program 90.4%

      \[\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 90.4

         \[\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 92.2

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

   3. Applied rewrites 92.2%

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

   if 2.1500000000000001e148 < t

   1. Initial program 84.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. distribute-rgt-out-- N/A

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

      7. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 89.0

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

   3. Applied rewrites 89.0%

      \[\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. lift-neg.f64 82.1

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

   6. Applied rewrites 82.1%

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

Alternative 4: 74.4% accurate, 0.8× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x_m x_m) z)))
   (*
    x_s
    (if (<= t -2.15e+85)
      (/ (* (/ x_m t) -2.0) z)
      (if (<= t 2.05e+44) (/ t_1 y) (/ t_1 (- t)))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m + x_m) / z;
	double tmp;
	if (t <= -2.15e+85) {
		tmp = ((x_m / t) * -2.0) / z;
	} else if (t <= 2.05e+44) {
		tmp = t_1 / y;
	} else {
		tmp = t_1 / -t;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m + x_m) / z
    if (t <= (-2.15d+85)) then
        tmp = ((x_m / t) * (-2.0d0)) / z
    else if (t <= 2.05d+44) then
        tmp = t_1 / y
    else
        tmp = t_1 / -t
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m + x_m) / z;
	double tmp;
	if (t <= -2.15e+85) {
		tmp = ((x_m / t) * -2.0) / z;
	} else if (t <= 2.05e+44) {
		tmp = t_1 / y;
	} else {
		tmp = t_1 / -t;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (x_m + x_m) / z
	tmp = 0
	if t <= -2.15e+85:
		tmp = ((x_m / t) * -2.0) / z
	elif t <= 2.05e+44:
		tmp = t_1 / y
	else:
		tmp = t_1 / -t
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(x_m + x_m) / z)
	tmp = 0.0
	if (t <= -2.15e+85)
		tmp = Float64(Float64(Float64(x_m / t) * -2.0) / z);
	elseif (t <= 2.05e+44)
		tmp = Float64(t_1 / y);
	else
		tmp = Float64(t_1 / Float64(-t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (x_m + x_m) / z;
	tmp = 0.0;
	if (t <= -2.15e+85)
		tmp = ((x_m / t) * -2.0) / z;
	elseif (t <= 2.05e+44)
		tmp = t_1 / y;
	else
		tmp = t_1 / -t;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -2.15e85

   1. Initial program 84.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. 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. *-commutative N/A

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

      8. associate-/r* N/A

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

      9. frac-2neg-rev N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-neg-out N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. distribute-lft-out-- N/A

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

      15. lower-/.f64 N/A

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

   3. Applied rewrites 90.5%

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

   4. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 80.0

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

   6. Applied rewrites 80.0%

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

   if -2.15e85 < t < 2.04999999999999982e44

   1. Initial program 92.3%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 93.4

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

   3. Applied rewrites 93.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 70.2%

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

   if 2.04999999999999982e44 < t

   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. distribute-rgt-out-- N/A

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

      7. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 90.2

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

   3. Applied rewrites 90.2%

      \[\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. lift-neg.f64 77.2

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

   6. Applied rewrites 77.2%

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

Alternative 5: 74.2% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (*
  x_s
  (if (<= t -2.15e+85)
    (/ (* (/ x_m t) -2.0) z)
    (if (<= t 2.05e+44) (/ (/ (+ x_m x_m) z) y) (* (/ x_m z) (/ -2.0 t))))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (t <= -2.15e+85) {
		tmp = ((x_m / t) * -2.0) / z;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = (x_m / z) * (-2.0 / t);
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if (t <= (-2.15d+85)) then
        tmp = ((x_m / t) * (-2.0d0)) / z
    else if (t <= 2.05d+44) then
        tmp = ((x_m + x_m) / z) / y
    else
        tmp = (x_m / z) * ((-2.0d0) / t)
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double tmp;
	if (t <= -2.15e+85) {
		tmp = ((x_m / t) * -2.0) / z;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = (x_m / z) * (-2.0 / t);
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	tmp = 0
	if t <= -2.15e+85:
		tmp = ((x_m / t) * -2.0) / z
	elif t <= 2.05e+44:
		tmp = ((x_m + x_m) / z) / y
	else:
		tmp = (x_m / z) * (-2.0 / t)
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	tmp = 0.0
	if (t <= -2.15e+85)
		tmp = Float64(Float64(Float64(x_m / t) * -2.0) / z);
	elseif (t <= 2.05e+44)
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / y);
	else
		tmp = Float64(Float64(x_m / z) * Float64(-2.0 / t));
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	tmp = 0.0;
	if (t <= -2.15e+85)
		tmp = ((x_m / t) * -2.0) / z;
	elseif (t <= 2.05e+44)
		tmp = ((x_m + x_m) / z) / y;
	else
		tmp = (x_m / z) * (-2.0 / t);
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if t < -2.15e85

   1. Initial program 84.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. 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. *-commutative N/A

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

      8. associate-/r* N/A

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

      9. frac-2neg-rev N/A

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

      10. *-commutative N/A

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

      11. distribute-lft-neg-out N/A

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

      12. metadata-eval N/A

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

      13. mul-1-neg N/A

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

      14. distribute-lft-out-- N/A

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

      15. lower-/.f64 N/A

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

   3. Applied rewrites 90.5%

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

   4. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 80.0

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

   6. Applied rewrites 80.0%

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

   if -2.15e85 < t < 2.04999999999999982e44

   1. Initial program 92.3%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 93.4

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

   3. Applied rewrites 93.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 70.2%

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

   if 2.04999999999999982e44 < t

   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. 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.3

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

   3. Applied rewrites 90.3%

      \[\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 77.2

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

   6. Applied rewrites 77.2%

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

Alternative 6: 74.2% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (/ x_m z) (/ -2.0 t))))
   (*
    x_s
    (if (<= t -4.9e+36)
      t_1
      (if (<= t 2.05e+44) (/ (/ (+ x_m x_m) z) y) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / z) * (-2.0 / t);
	double tmp;
	if (t <= -4.9e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m / z) * ((-2.0d0) / t)
    if (t <= (-4.9d+36)) then
        tmp = t_1
    else if (t <= 2.05d+44) then
        tmp = ((x_m + x_m) / z) / y
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / z) * (-2.0 / t);
	double tmp;
	if (t <= -4.9e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (x_m / z) * (-2.0 / t)
	tmp = 0
	if t <= -4.9e+36:
		tmp = t_1
	elif t <= 2.05e+44:
		tmp = ((x_m + x_m) / z) / y
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(x_m / z) * Float64(-2.0 / t))
	tmp = 0.0
	if (t <= -4.9e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / y);
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (x_m / z) * (-2.0 / t);
	tmp = 0.0;
	if (t <= -4.9e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = ((x_m + x_m) / z) / y;
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.89999999999999981e36 or 2.04999999999999982e44 < t

   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. 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.0

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

   3. Applied rewrites 90.0%

      \[\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 76.2

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

   6. Applied rewrites 76.2%

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

   if -4.89999999999999981e36 < t < 2.04999999999999982e44

   1. Initial program 92.4%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 93.4

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

   3. Applied rewrites 93.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 72.0%

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

Alternative 7: 73.9% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (/ (/ -2.0 t) z) x_m)))
   (*
    x_s
    (if (<= t -4.8e+36)
      t_1
      (if (<= t 2.05e+44) (/ (/ (+ x_m x_m) z) y) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = ((-2.0 / t) / z) * x_m;
	double tmp;
	if (t <= -4.8e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (((-2.0d0) / t) / z) * x_m
    if (t <= (-4.8d+36)) then
        tmp = t_1
    else if (t <= 2.05d+44) then
        tmp = ((x_m + x_m) / z) / y
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = ((-2.0 / t) / z) * x_m;
	double tmp;
	if (t <= -4.8e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = ((-2.0 / t) / z) * x_m
	tmp = 0
	if t <= -4.8e+36:
		tmp = t_1
	elif t <= 2.05e+44:
		tmp = ((x_m + x_m) / z) / y
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(Float64(-2.0 / t) / z) * x_m)
	tmp = 0.0
	if (t <= -4.8e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / y);
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = ((-2.0 / t) / z) * x_m;
	tmp = 0.0;
	if (t <= -4.8e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = ((x_m + x_m) / z) / y;
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.79999999999999985e36 or 2.04999999999999982e44 < t

   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. *-commutative N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

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

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

      11. *-commutative N/A

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

      12. lower-*.f64 N/A

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

      13. lower--.f64 89.6

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

   3. Applied rewrites 89.6%

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

   4. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower-*.f64 76.9

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

   6. Applied rewrites 76.9%

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

      1. lift-*.f64 N/A

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

      2. lift-/.f64 N/A

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

      3. associate-/r* N/A

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

      4. lower-/.f64 N/A

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

      5. lower-/.f64 77.4

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

   8. Applied rewrites 77.4%

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

   if -4.79999999999999985e36 < t < 2.04999999999999982e44

   1. Initial program 92.4%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 93.4

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

   3. Applied rewrites 93.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 72.0%

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

Alternative 8: 73.6% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (/ x_m (* t z)) -2.0)))
   (*
    x_s
    (if (<= t -4.8e+36)
      t_1
      (if (<= t 2.05e+44) (/ (/ (+ x_m x_m) z) y) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / (t * z)) * -2.0;
	double tmp;
	if (t <= -4.8e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m / (t * z)) * (-2.0d0)
    if (t <= (-4.8d+36)) then
        tmp = t_1
    else if (t <= 2.05d+44) then
        tmp = ((x_m + x_m) / z) / y
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / (t * z)) * -2.0;
	double tmp;
	if (t <= -4.8e+36) {
		tmp = t_1;
	} else if (t <= 2.05e+44) {
		tmp = ((x_m + x_m) / z) / y;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (x_m / (t * z)) * -2.0
	tmp = 0
	if t <= -4.8e+36:
		tmp = t_1
	elif t <= 2.05e+44:
		tmp = ((x_m + x_m) / z) / y
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(x_m / Float64(t * z)) * -2.0)
	tmp = 0.0
	if (t <= -4.8e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = Float64(Float64(Float64(x_m + x_m) / z) / y);
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (x_m / (t * z)) * -2.0;
	tmp = 0.0;
	if (t <= -4.8e+36)
		tmp = t_1;
	elseif (t <= 2.05e+44)
		tmp = ((x_m + x_m) / z) / y;
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -4.79999999999999985e36 or 2.04999999999999982e44 < t

   1. Initial program 86.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 76.9

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

   4. Applied rewrites 76.9%

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

   if -4.79999999999999985e36 < t < 2.04999999999999982e44

   1. Initial program 92.4%

      \[\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. associate-/r* N/A

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

      8. *-commutative N/A

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

      9. associate-*r/ N/A

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

      10. lower-/.f64 N/A

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

      11. associate-*r/ N/A

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

      12. *-commutative N/A

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

      13. lower-/.f64 N/A

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

      14. *-commutative N/A

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

      15. count-2-rev N/A

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

      16. lower-+.f64 N/A

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

      17. lower--.f64 93.4

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

   3. Applied rewrites 93.4%

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

   4. Taylor expanded in y around inf

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

   6. Applied rewrites 72.0%

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

Alternative 9: 73.6% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (* (/ x_m (* t z)) -2.0)))
   (*
    x_s
    (if (<= t -1.5e-58)
      t_1
      (if (<= t 1.56e+44) (/ (/ (+ x_m x_m) y) z) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / (t * z)) * -2.0;
	double tmp;
	if (t <= -1.5e-58) {
		tmp = t_1;
	} else if (t <= 1.56e+44) {
		tmp = ((x_m + x_m) / y) / z;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m / (t * z)) * (-2.0d0)
    if (t <= (-1.5d-58)) then
        tmp = t_1
    else if (t <= 1.56d+44) then
        tmp = ((x_m + x_m) / y) / z
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m / (t * z)) * -2.0;
	double tmp;
	if (t <= -1.5e-58) {
		tmp = t_1;
	} else if (t <= 1.56e+44) {
		tmp = ((x_m + x_m) / y) / z;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (x_m / (t * z)) * -2.0
	tmp = 0
	if t <= -1.5e-58:
		tmp = t_1
	elif t <= 1.56e+44:
		tmp = ((x_m + x_m) / y) / z
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(x_m / Float64(t * z)) * -2.0)
	tmp = 0.0
	if (t <= -1.5e-58)
		tmp = t_1;
	elseif (t <= 1.56e+44)
		tmp = Float64(Float64(Float64(x_m + x_m) / y) / z);
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (x_m / (t * z)) * -2.0;
	tmp = 0.0;
	if (t <= -1.5e-58)
		tmp = t_1;
	elseif (t <= 1.56e+44)
		tmp = ((x_m + x_m) / y) / z;
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -1.50000000000000004e-58 or 1.56e44 < t

   1. Initial program 87.6%

      \[\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 73.7

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

   4. Applied rewrites 73.7%

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

   if -1.50000000000000004e-58 < t < 1.56e44

   1. Initial program 91.8%

      \[\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. div-add N/A

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

      5. *-commutative N/A

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

      6. associate-/r* N/A

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

      7. *-commutative N/A

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

      8. associate-/r* N/A

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

      9. div-add-rev N/A

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

      10. lower-/.f64 N/A

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

      11. div-add-rev N/A

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

      12. lower-/.f64 N/A

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

      13. lift-+.f64 73.2

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

   6. Applied rewrites 73.2%

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

Alternative 10: 73.5% accurate, 0.9× speedup

Math

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

FPCore

x\_m = (fabs.f64 x)
x\_s = (copysign.f64 #s(literal 1 binary64) x)
(FPCore (x_s x_m y z t)
 :precision binary64
 (let* ((t_1 (/ (+ x_m x_m) (* z y))))
   (*
    x_s
    (if (<= y -0.00062)
      t_1
      (if (<= y 1.2e-54) (* (/ x_m (* t z)) -2.0) t_1)))))

C

x\_m = fabs(x);
x\_s = copysign(1.0, x);
double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m + x_m) / (z * y);
	double tmp;
	if (y <= -0.00062) {
		tmp = t_1;
	} else if (y <= 1.2e-54) {
		tmp = (x_m / (t * z)) * -2.0;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Fortran

x\_m =     private
x\_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(x_s, x_m, y, z, t)
use fmin_fmax_functions
    real(8), intent (in) :: x_s
    real(8), intent (in) :: x_m
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (x_m + x_m) / (z * y)
    if (y <= (-0.00062d0)) then
        tmp = t_1
    else if (y <= 1.2d-54) then
        tmp = (x_m / (t * z)) * (-2.0d0)
    else
        tmp = t_1
    end if
    code = x_s * tmp
end function

Java

x\_m = Math.abs(x);
x\_s = Math.copySign(1.0, x);
public static double code(double x_s, double x_m, double y, double z, double t) {
	double t_1 = (x_m + x_m) / (z * y);
	double tmp;
	if (y <= -0.00062) {
		tmp = t_1;
	} else if (y <= 1.2e-54) {
		tmp = (x_m / (t * z)) * -2.0;
	} else {
		tmp = t_1;
	}
	return x_s * tmp;
}

Python

x\_m = math.fabs(x)
x\_s = math.copysign(1.0, x)
def code(x_s, x_m, y, z, t):
	t_1 = (x_m + x_m) / (z * y)
	tmp = 0
	if y <= -0.00062:
		tmp = t_1
	elif y <= 1.2e-54:
		tmp = (x_m / (t * z)) * -2.0
	else:
		tmp = t_1
	return x_s * tmp

Julia

x\_m = abs(x)
x\_s = copysign(1.0, x)
function code(x_s, x_m, y, z, t)
	t_1 = Float64(Float64(x_m + x_m) / Float64(z * y))
	tmp = 0.0
	if (y <= -0.00062)
		tmp = t_1;
	elseif (y <= 1.2e-54)
		tmp = Float64(Float64(x_m / Float64(t * z)) * -2.0);
	else
		tmp = t_1;
	end
	return Float64(x_s * tmp)
end

MATLAB

x\_m = abs(x);
x\_s = sign(x) * abs(1.0);
function tmp_2 = code(x_s, x_m, y, z, t)
	t_1 = (x_m + x_m) / (z * y);
	tmp = 0.0;
	if (y <= -0.00062)
		tmp = t_1;
	elseif (y <= 1.2e-54)
		tmp = (x_m / (t * z)) * -2.0;
	else
		tmp = t_1;
	end
	tmp_2 = x_s * tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -6.2e-4 or 1.20000000000000007e-54 < y

   1. Initial program 88.0%

      \[\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 73.3

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

   4. Applied rewrites 73.3%

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

   if -6.2e-4 < y < 1.20000000000000007e-54

   1. Initial program 91.5%

      \[\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 75.3

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

   4. Applied rewrites 75.3%

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

Alternative 11: 52.8% accurate, 1.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 89.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 52.8

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

4. Applied rewrites 52.8%

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

Reproduce

herbie shell --seed 2025130 
(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))))