Diagrams.TwoD.Segment.Bernstein:evaluateBernstein from diagrams-lib-1.3.0.3

Percentage Accurate: 87.5% → 99.8%

Time: 35.1s

Alternatives: 12

Speedup: 0.7×

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

Specification

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * ((y - z) + 1.0)) / 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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * ((y - z) + 1.0d0)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 87.5% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (x * ((y - z) + 1.0)) / 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)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x * ((y - z) + 1.0d0)) / z
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_0 := \frac{\left(y - z\right) - -1}{z} \cdot x\\ \mathbf{if}\;z \leq -12000000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq \frac{8711228593176025}{43556142965880123323311949751266331066368}:\\ \;\;\;\;\frac{x \cdot \left(1 + y\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (let* ((t_0 (* (/ (- (- y z) -1) z) x)))
  (if (<= z -12000000000000)
    t_0
    (if (<=
         z
         8711228593176025/43556142965880123323311949751266331066368)
      (/ (* x (+ 1 y)) z)
      t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (((y - z) - -1.0) / z) * x;
	double tmp;
	if (z <= -12000000000000.0) {
		tmp = t_0;
	} else if (z <= 2e-25) {
		tmp = (x * (1.0 + y)) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (((y - z) - (-1.0d0)) / z) * x
    if (z <= (-12000000000000.0d0)) then
        tmp = t_0
    else if (z <= 2d-25) then
        tmp = (x * (1.0d0 + y)) / z
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (((y - z) - -1.0) / z) * x;
	double tmp;
	if (z <= -12000000000000.0) {
		tmp = t_0;
	} else if (z <= 2e-25) {
		tmp = (x * (1.0 + y)) / z;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (((y - z) - -1.0) / z) * x
	tmp = 0
	if z <= -12000000000000.0:
		tmp = t_0
	elif z <= 2e-25:
		tmp = (x * (1.0 + y)) / z
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(Float64(Float64(y - z) - -1.0) / z) * x)
	tmp = 0.0
	if (z <= -12000000000000.0)
		tmp = t_0;
	elseif (z <= 2e-25)
		tmp = Float64(Float64(x * Float64(1.0 + y)) / z);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (((y - z) - -1.0) / z) * x;
	tmp = 0.0;
	if (z <= -12000000000000.0)
		tmp = t_0;
	elseif (z <= 2e-25)
		tmp = (x * (1.0 + y)) / z;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[(N[(y - z), $MachinePrecision] - -1), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]}, If[LessEqual[z, -12000000000000], t$95$0, If[LessEqual[z, 8711228593176025/43556142965880123323311949751266331066368], N[(N[(x * N[(1 + y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.2e13 or 2.0000000000000001e-25 < z

   1. Initial program 87.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 96.0%

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

      7. lift-+.f64 N/A

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

      8. add-flip N/A

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

      9. lower--.f64 N/A

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

      10. metadata-eval 96.0%

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

   3. Applied rewrites 96.0%

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

   if -1.2e13 < z < 2.0000000000000001e-25

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

Alternative 2: 99.7% accurate, 0.2× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq \frac{8711228593176025}{87112285931760246646623899502532662132736}:\\ \;\;\;\;\frac{\left|x\right| \cdot \left(\left(y - z\right) + 1\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{\left(y - z\right) - -1}{z} \cdot \left|x\right|\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<=
      (fabs x)
      8711228593176025/87112285931760246646623899502532662132736)
   (/ (* (fabs x) (+ (- y z) 1)) z)
   (* (/ (- (- y z) -1) z) (fabs x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (fabs(x) <= 1e-25) {
		tmp = (fabs(x) * ((y - z) + 1.0)) / z;
	} else {
		tmp = (((y - z) - -1.0) / z) * fabs(x);
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (Math.abs(x) <= 1e-25) {
		tmp = (Math.abs(x) * ((y - z) + 1.0)) / z;
	} else {
		tmp = (((y - z) - -1.0) / z) * Math.abs(x);
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if math.fabs(x) <= 1e-25:
		tmp = (math.fabs(x) * ((y - z) + 1.0)) / z
	else:
		tmp = (((y - z) - -1.0) / z) * math.fabs(x)
	return math.copysign(1.0, x) * tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (abs(x) <= 1e-25)
		tmp = Float64(Float64(abs(x) * Float64(Float64(y - z) + 1.0)) / z);
	else
		tmp = Float64(Float64(Float64(Float64(y - z) - -1.0) / z) * abs(x));
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (abs(x) <= 1e-25)
		tmp = (abs(x) * ((y - z) + 1.0)) / z;
	else
		tmp = (((y - z) - -1.0) / z) * abs(x);
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_, y_, z_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 8711228593176025/87112285931760246646623899502532662132736], N[(N[(N[Abs[x], $MachinePrecision] * N[(N[(y - z), $MachinePrecision] + 1), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(N[(y - z), $MachinePrecision] - -1), $MachinePrecision] / z), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 1e-25

   1. Initial program 87.5%

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

   if 1e-25 < x

   1. Initial program 87.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. associate-/l* N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-/.f64 96.0%

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

      7. lift-+.f64 N/A

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

      8. add-flip N/A

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

      9. lower--.f64 N/A

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

      10. metadata-eval 96.0%

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

   3. Applied rewrites 96.0%

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

Alternative 3: 99.7% accurate, 0.2× speedup

Math

\[\mathsf{134\_z0z1z2z3z4}\left(\left({z}^{-1}\right), \left(y - z\right), x, x, -1\right) \]

FPCore

(FPCore (x y z)
  :precision binary64
  (134-z0z1z2z3z4 (pow z -1) (- y z) x x -1))

Derivation

1. Initial program 87.5%

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

   1. lift-/.f64 N/A

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

   2. mult-flip N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. distribute-lft-in N/A

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

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

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

   8. *-commutative N/A

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

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

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

   10. distribute-rgt-neg-in N/A

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

   11. lower-134-z0z1z2z3z4 N/A

       \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, \left(\mathsf{neg}\left(1\right)\right)\right)} \]

   12. lower-/.f64 N/A

       \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left(\frac{1}{z}\right)}, \left(y - z\right), x, x, \left(\mathsf{neg}\left(1\right)\right)\right) \]

   13. metadata-eval 99.7%

       \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, \color{blue}{-1}\right) \]

3. Applied rewrites 99.7%

   \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, -1\right)} \]
4. Step-by-step derivation

   1. lift-/.f64 N/A

      \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left(\frac{1}{z}\right)}, \left(y - z\right), x, x, -1\right) \]

   2. inv-pow N/A

      \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left({z}^{-1}\right)}, \left(y - z\right), x, x, -1\right) \]

   3. lower-pow.f64 99.7%

      \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left({z}^{-1}\right)}, \left(y - z\right), x, x, -1\right) \]

5. Applied rewrites 99.7%

   \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left({z}^{-1}\right)}, \left(y - z\right), x, x, -1\right) \]
6. Add Preprocessing

Alternative 4: 99.1% accurate, 0.7× speedup

Math

\[\mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, -1\right) \]

FPCore

(FPCore (x y z)
  :precision binary64
  (134-z0z1z2z3z4 (/ 1 z) (- y z) x x -1))

Derivation

1. Initial program 87.5%

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

   1. lift-/.f64 N/A

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

   2. mult-flip N/A

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

   3. *-commutative N/A

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

   4. lift-*.f64 N/A

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

   5. lift-+.f64 N/A

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

   6. distribute-lft-in N/A

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

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

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

   8. *-commutative N/A

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

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

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

   10. distribute-rgt-neg-in N/A

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

   11. lower-134-z0z1z2z3z4 N/A

       \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, \left(\mathsf{neg}\left(1\right)\right)\right)} \]

   12. lower-/.f64 N/A

       \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\color{blue}{\left(\frac{1}{z}\right)}, \left(y - z\right), x, x, \left(\mathsf{neg}\left(1\right)\right)\right) \]

   13. metadata-eval 99.7%

       \[\leadsto \mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, \color{blue}{-1}\right) \]

3. Applied rewrites 99.7%

   \[\leadsto \color{blue}{\mathsf{134\_z0z1z2z3z4}\left(\left(\frac{1}{z}\right), \left(y - z\right), x, x, -1\right)} \]
4. Add Preprocessing

Alternative 5: 95.7% accurate, 0.1× speedup

Math

\[\begin{array}{l} t_0 := \frac{\left|x\right|}{z} \cdot \left(\left(y - z\right) - -1\right)\\ t_1 := \frac{\left|x\right| \cdot \left(\left(y - z\right) + 1\right)}{z}\\ \mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;t\_1 \leq \frac{-2404907604760405}{4809815209520810450717656262224562232065397860164239095208531909697964083434718092213655548692006303809402830848}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq \frac{-4825645764048353}{24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248}:\\ \;\;\;\;\frac{1 - z}{z} \cdot \left|x\right|\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (let* ((t_0 (* (/ (fabs x) z) (- (- y z) -1)))
       (t_1 (/ (* (fabs x) (+ (- y z) 1)) z)))
  (*
   (copysign 1 x)
   (if (<=
        t_1
        -2404907604760405/4809815209520810450717656262224562232065397860164239095208531909697964083434718092213655548692006303809402830848)
     t_0
     (if (<=
          t_1
          -4825645764048353/24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248)
       (* (/ (- 1 z) z) (fabs x))
       t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = (fabs(x) / z) * ((y - z) - -1.0);
	double t_1 = (fabs(x) * ((y - z) + 1.0)) / z;
	double tmp;
	if (t_1 <= -5e-97) {
		tmp = t_0;
	} else if (t_1 <= -2e-301) {
		tmp = ((1.0 - z) / z) * fabs(x);
	} else {
		tmp = t_0;
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x, double y, double z) {
	double t_0 = (Math.abs(x) / z) * ((y - z) - -1.0);
	double t_1 = (Math.abs(x) * ((y - z) + 1.0)) / z;
	double tmp;
	if (t_1 <= -5e-97) {
		tmp = t_0;
	} else if (t_1 <= -2e-301) {
		tmp = ((1.0 - z) / z) * Math.abs(x);
	} else {
		tmp = t_0;
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x, y, z):
	t_0 = (math.fabs(x) / z) * ((y - z) - -1.0)
	t_1 = (math.fabs(x) * ((y - z) + 1.0)) / z
	tmp = 0
	if t_1 <= -5e-97:
		tmp = t_0
	elif t_1 <= -2e-301:
		tmp = ((1.0 - z) / z) * math.fabs(x)
	else:
		tmp = t_0
	return math.copysign(1.0, x) * tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(abs(x) / z) * Float64(Float64(y - z) - -1.0))
	t_1 = Float64(Float64(abs(x) * Float64(Float64(y - z) + 1.0)) / z)
	tmp = 0.0
	if (t_1 <= -5e-97)
		tmp = t_0;
	elseif (t_1 <= -2e-301)
		tmp = Float64(Float64(Float64(1.0 - z) / z) * abs(x));
	else
		tmp = t_0;
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (abs(x) / z) * ((y - z) - -1.0);
	t_1 = (abs(x) * ((y - z) + 1.0)) / z;
	tmp = 0.0;
	if (t_1 <= -5e-97)
		tmp = t_0;
	elseif (t_1 <= -2e-301)
		tmp = ((1.0 - z) / z) * abs(x);
	else
		tmp = t_0;
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(N[Abs[x], $MachinePrecision] / z), $MachinePrecision] * N[(N[(y - z), $MachinePrecision] - -1), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[(N[Abs[x], $MachinePrecision] * N[(N[(y - z), $MachinePrecision] + 1), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision]}, N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[t$95$1, -2404907604760405/4809815209520810450717656262224562232065397860164239095208531909697964083434718092213655548692006303809402830848], t$95$0, If[LessEqual[t$95$1, -4825645764048353/24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248], N[(N[(N[(1 - z), $MachinePrecision] / z), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision], t$95$0]]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (+.f64 (-.f64 y z) #s(literal 1 binary64))) z) < -4.9999999999999995e-97 or -2.0000000000000001e-301 < (/.f64 (*.f64 x (+.f64 (-.f64 y z) #s(literal 1 binary64))) z)

   1. Initial program 87.5%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. associate-/l* N/A

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

      5. *-commutative N/A

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

      6. lower-*.f64 N/A

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

      7. lower-/.f64 88.2%

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

      8. lift-+.f64 N/A

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

      9. add-flip N/A

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

      10. lower--.f64 N/A

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

      11. metadata-eval 88.2%

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

   3. Applied rewrites 88.2%

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

   if -4.9999999999999995e-97 < (/.f64 (*.f64 x (+.f64 (-.f64 y z) #s(literal 1 binary64))) z) < -2.0000000000000001e-301

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 66.5%

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

   9. Applied rewrites 66.5%

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

Alternative 6: 85.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -3150000000000000000000:\\ \;\;\;\;-x\\ \mathbf{elif}\;z \leq \frac{4918143584404189}{1329227995784915872903807060280344576}:\\ \;\;\;\;\frac{x \cdot \left(1 + y\right)}{z}\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - z}{z} \cdot x\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (if (<= z -3150000000000000000000)
  (- x)
  (if (<= z 4918143584404189/1329227995784915872903807060280344576)
    (/ (* x (+ 1 y)) z)
    (* (/ (- 1 z) z) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 3.7e-21) {
		tmp = (x * (1.0 + y)) / z;
	} else {
		tmp = ((1.0 - z) / z) * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.15d+21)) then
        tmp = -x
    else if (z <= 3.7d-21) then
        tmp = (x * (1.0d0 + y)) / z
    else
        tmp = ((1.0d0 - z) / z) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 3.7e-21) {
		tmp = (x * (1.0 + y)) / z;
	} else {
		tmp = ((1.0 - z) / z) * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.15e+21:
		tmp = -x
	elif z <= 3.7e-21:
		tmp = (x * (1.0 + y)) / z
	else:
		tmp = ((1.0 - z) / z) * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.15e+21)
		tmp = Float64(-x);
	elseif (z <= 3.7e-21)
		tmp = Float64(Float64(x * Float64(1.0 + y)) / z);
	else
		tmp = Float64(Float64(Float64(1.0 - z) / z) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.15e+21)
		tmp = -x;
	elseif (z <= 3.7e-21)
		tmp = (x * (1.0 + y)) / z;
	else
		tmp = ((1.0 - z) / z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3150000000000000000000], (-x), If[LessEqual[z, 4918143584404189/1329227995784915872903807060280344576], N[(N[(x * N[(1 + y), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], N[(N[(N[(1 - z), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.15e21

   1. Initial program 87.5%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot x} \]
   3. Step-by-step derivation

      1. lower-*.f64 40.2%

         \[\leadsto -1 \cdot \color{blue}{x} \]

   4. Applied rewrites 40.2%

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

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto x \cdot \color{blue}{-1} \]

      3. remove-double-neg N/A

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

      4. lower-neg.f64 N/A

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

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

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

      6. metadata-eval N/A

         \[\leadsto -x \cdot 1 \]

      7. *-rgt-identity 40.2%

         \[\leadsto -x \]

   6. Applied rewrites 40.2%

      \[\leadsto -x \]

   if -3.15e21 < z < 3.7000000000000002e-21

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

   if 3.7000000000000002e-21 < z

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 66.5%

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

   9. Applied rewrites 66.5%

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

Alternative 7: 85.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -3150000000000000000000:\\ \;\;\;\;-x\\ \mathbf{elif}\;z \leq \frac{4918143584404189}{1329227995784915872903807060280344576}:\\ \;\;\;\;\frac{x}{z} \cdot \left(y - -1\right)\\ \mathbf{else}:\\ \;\;\;\;\frac{1 - z}{z} \cdot x\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (if (<= z -3150000000000000000000)
  (- x)
  (if (<= z 4918143584404189/1329227995784915872903807060280344576)
    (* (/ x z) (- y -1))
    (* (/ (- 1 z) z) x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 3.7e-21) {
		tmp = (x / z) * (y - -1.0);
	} else {
		tmp = ((1.0 - z) / z) * x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.15d+21)) then
        tmp = -x
    else if (z <= 3.7d-21) then
        tmp = (x / z) * (y - (-1.0d0))
    else
        tmp = ((1.0d0 - z) / z) * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 3.7e-21) {
		tmp = (x / z) * (y - -1.0);
	} else {
		tmp = ((1.0 - z) / z) * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.15e+21:
		tmp = -x
	elif z <= 3.7e-21:
		tmp = (x / z) * (y - -1.0)
	else:
		tmp = ((1.0 - z) / z) * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.15e+21)
		tmp = Float64(-x);
	elseif (z <= 3.7e-21)
		tmp = Float64(Float64(x / z) * Float64(y - -1.0));
	else
		tmp = Float64(Float64(Float64(1.0 - z) / z) * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.15e+21)
		tmp = -x;
	elseif (z <= 3.7e-21)
		tmp = (x / z) * (y - -1.0);
	else
		tmp = ((1.0 - z) / z) * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3150000000000000000000], (-x), If[LessEqual[z, 4918143584404189/1329227995784915872903807060280344576], N[(N[(x / z), $MachinePrecision] * N[(y - -1), $MachinePrecision]), $MachinePrecision], N[(N[(N[(1 - z), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.15e21

   1. Initial program 87.5%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot x} \]
   3. Step-by-step derivation

      1. lower-*.f64 40.2%

         \[\leadsto -1 \cdot \color{blue}{x} \]

   4. Applied rewrites 40.2%

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

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto x \cdot \color{blue}{-1} \]

      3. remove-double-neg N/A

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

      4. lower-neg.f64 N/A

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

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

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

      6. metadata-eval N/A

         \[\leadsto -x \cdot 1 \]

      7. *-rgt-identity 40.2%

         \[\leadsto -x \]

   6. Applied rewrites 40.2%

      \[\leadsto -x \]

   if -3.15e21 < z < 3.7000000000000002e-21

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

      1. *-rgt-identity N/A

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

      2. lower-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-*.f64 N/A

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

      8. lower-/.f64 N/A

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

      9. *-rgt-identity 59.8%

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

   8. Applied rewrites 59.8%

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

   if 3.7000000000000002e-21 < z

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 66.5%

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

   9. Applied rewrites 66.5%

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

Alternative 8: 83.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} t_0 := \frac{x \cdot y}{z}\\ \mathbf{if}\;y \leq -3300000000000000000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2200000000000000189688286884999471526568915431292882527929869723886775865828164117820624103549535503822869474291922439496983092451729859489061879010552451619328872153088:\\ \;\;\;\;\frac{1 - z}{z} \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (let* ((t_0 (/ (* x y) z)))
  (if (<= y -3300000000000000000)
    t_0
    (if (<=
         y
         2200000000000000189688286884999471526568915431292882527929869723886775865828164117820624103549535503822869474291922439496983092451729859489061879010552451619328872153088)
      (* (/ (- 1 z) z) x)
      t_0))))

C

double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if (y <= -3.3e+18) {
		tmp = t_0;
	} else if (y <= 2.2e+168) {
		tmp = ((1.0 - z) / z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = (x * y) / z
    if (y <= (-3.3d+18)) then
        tmp = t_0
    else if (y <= 2.2d+168) then
        tmp = ((1.0d0 - z) / z) * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = (x * y) / z;
	double tmp;
	if (y <= -3.3e+18) {
		tmp = t_0;
	} else if (y <= 2.2e+168) {
		tmp = ((1.0 - z) / z) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = (x * y) / z
	tmp = 0
	if y <= -3.3e+18:
		tmp = t_0
	elif y <= 2.2e+168:
		tmp = ((1.0 - z) / z) * x
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(Float64(x * y) / z)
	tmp = 0.0
	if (y <= -3.3e+18)
		tmp = t_0;
	elseif (y <= 2.2e+168)
		tmp = Float64(Float64(Float64(1.0 - z) / z) * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = (x * y) / z;
	tmp = 0.0;
	if (y <= -3.3e+18)
		tmp = t_0;
	elseif (y <= 2.2e+168)
		tmp = ((1.0 - z) / z) * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision]}, If[LessEqual[y, -3300000000000000000], t$95$0, If[LessEqual[y, 2200000000000000189688286884999471526568915431292882527929869723886775865828164117820624103549535503822869474291922439496983092451729859489061879010552451619328872153088], N[(N[(N[(1 - z), $MachinePrecision] / z), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.3e18 or 2.2000000000000002e168 < y

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 37.5%

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

   7. Applied rewrites 37.5%

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

   if -3.3e18 < y < 2.2000000000000002e168

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

   7. Taylor expanded in y around 0

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

      1. lower-/.f64 N/A

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

      2. lower--.f64 66.5%

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

   9. Applied rewrites 66.5%

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

Alternative 9: 64.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -3150000000000000000000:\\ \;\;\;\;-x\\ \mathbf{elif}\;z \leq \frac{3399725348521233}{790633801981682102939434948120770730662330663141180149831645929794649763937481823796720248833738767559324522907487546528866440380413255769011771093518509804380927438580337349079948858367551626332967842494034160424070341732127705853976966233004529516956289283251401443563802400840744150516352841830648461966045733363646464}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{elif}\;z \leq \frac{3486039150627631}{79228162514264337593543950336}:\\ \;\;\;\;\frac{x \cdot 1}{z}\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (if (<= z -3150000000000000000000)
  (- x)
  (if (<=
       z
       3399725348521233/790633801981682102939434948120770730662330663141180149831645929794649763937481823796720248833738767559324522907487546528866440380413255769011771093518509804380927438580337349079948858367551626332967842494034160424070341732127705853976966233004529516956289283251401443563802400840744150516352841830648461966045733363646464)
    (/ (* x y) z)
    (if (<= z 3486039150627631/79228162514264337593543950336)
      (/ (* x 1) z)
      (- x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 4.3e-306) {
		tmp = (x * y) / z;
	} else if (z <= 4.4e-14) {
		tmp = (x * 1.0) / z;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.15d+21)) then
        tmp = -x
    else if (z <= 4.3d-306) then
        tmp = (x * y) / z
    else if (z <= 4.4d-14) then
        tmp = (x * 1.0d0) / z
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 4.3e-306) {
		tmp = (x * y) / z;
	} else if (z <= 4.4e-14) {
		tmp = (x * 1.0) / z;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.15e+21:
		tmp = -x
	elif z <= 4.3e-306:
		tmp = (x * y) / z
	elif z <= 4.4e-14:
		tmp = (x * 1.0) / z
	else:
		tmp = -x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.15e+21)
		tmp = Float64(-x);
	elseif (z <= 4.3e-306)
		tmp = Float64(Float64(x * y) / z);
	elseif (z <= 4.4e-14)
		tmp = Float64(Float64(x * 1.0) / z);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.15e+21)
		tmp = -x;
	elseif (z <= 4.3e-306)
		tmp = (x * y) / z;
	elseif (z <= 4.4e-14)
		tmp = (x * 1.0) / z;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3150000000000000000000], (-x), If[LessEqual[z, 3399725348521233/790633801981682102939434948120770730662330663141180149831645929794649763937481823796720248833738767559324522907487546528866440380413255769011771093518509804380927438580337349079948858367551626332967842494034160424070341732127705853976966233004529516956289283251401443563802400840744150516352841830648461966045733363646464], N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision], If[LessEqual[z, 3486039150627631/79228162514264337593543950336], N[(N[(x * 1), $MachinePrecision] / z), $MachinePrecision], (-x)]]]

Derivation

1. Split input into 3 regimes

2. if z < -3.15e21 or 4.4000000000000002e-14 < z

   1. Initial program 87.5%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot x} \]
   3. Step-by-step derivation

      1. lower-*.f64 40.2%

         \[\leadsto -1 \cdot \color{blue}{x} \]

   4. Applied rewrites 40.2%

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

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto x \cdot \color{blue}{-1} \]

      3. remove-double-neg N/A

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

      4. lower-neg.f64 N/A

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

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

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

      6. metadata-eval N/A

         \[\leadsto -x \cdot 1 \]

      7. *-rgt-identity 40.2%

         \[\leadsto -x \]

   6. Applied rewrites 40.2%

      \[\leadsto -x \]

   if -3.15e21 < z < 4.2999999999999999e-306

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 37.5%

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

   7. Applied rewrites 37.5%

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

   if 4.2999999999999999e-306 < z < 4.4000000000000002e-14

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

   5. Taylor expanded in y around 0

      \[\leadsto \frac{x \cdot 1}{z} \]
   6. Step-by-step derivation

   7. Applied rewrites 29.1%

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

Alternative 10: 63.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \mathbf{if}\;z \leq -3150000000000000000000:\\ \;\;\;\;-x\\ \mathbf{elif}\;z \leq \frac{3486039150627631}{79228162514264337593543950336}:\\ \;\;\;\;\frac{x \cdot y}{z}\\ \mathbf{else}:\\ \;\;\;\;-x\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (if (<= z -3150000000000000000000)
  (- x)
  (if (<= z 3486039150627631/79228162514264337593543950336)
    (/ (* x y) z)
    (- x))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 4.4e-14) {
		tmp = (x * y) / z;
	} else {
		tmp = -x;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= (-3.15d+21)) then
        tmp = -x
    else if (z <= 4.4d-14) then
        tmp = (x * y) / z
    else
        tmp = -x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= -3.15e+21) {
		tmp = -x;
	} else if (z <= 4.4e-14) {
		tmp = (x * y) / z;
	} else {
		tmp = -x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= -3.15e+21:
		tmp = -x
	elif z <= 4.4e-14:
		tmp = (x * y) / z
	else:
		tmp = -x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -3.15e+21)
		tmp = Float64(-x);
	elseif (z <= 4.4e-14)
		tmp = Float64(Float64(x * y) / z);
	else
		tmp = Float64(-x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= -3.15e+21)
		tmp = -x;
	elseif (z <= 4.4e-14)
		tmp = (x * y) / z;
	else
		tmp = -x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -3150000000000000000000], (-x), If[LessEqual[z, 3486039150627631/79228162514264337593543950336], N[(N[(x * y), $MachinePrecision] / z), $MachinePrecision], (-x)]]

Derivation

1. Split input into 2 regimes

2. if z < -3.15e21 or 4.4000000000000002e-14 < z

   1. Initial program 87.5%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot x} \]
   3. Step-by-step derivation

      1. lower-*.f64 40.2%

         \[\leadsto -1 \cdot \color{blue}{x} \]

   4. Applied rewrites 40.2%

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

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto x \cdot \color{blue}{-1} \]

      3. remove-double-neg N/A

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

      4. lower-neg.f64 N/A

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

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

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

      6. metadata-eval N/A

         \[\leadsto -x \cdot 1 \]

      7. *-rgt-identity 40.2%

         \[\leadsto -x \]

   6. Applied rewrites 40.2%

      \[\leadsto -x \]

   if -3.15e21 < z < 4.4000000000000002e-14

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

   5. Taylor expanded in y around inf

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

      1. lower-*.f64 37.5%

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

   7. Applied rewrites 37.5%

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

Alternative 11: 56.4% accurate, 0.1× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\frac{\left|x\right| \cdot \left(\left(y - z\right) + 1\right)}{z} \leq \frac{-4825645764048353}{24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248}:\\ \;\;\;\;-\left|x\right|\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{z} \cdot \left|x\right|\\ \end{array} \]

FPCore

(FPCore (x y z)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<=
      (/ (* (fabs x) (+ (- y z) 1)) z)
      -4825645764048353/24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248)
   (- (fabs x))
   (* (/ y z) (fabs x)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (((fabs(x) * ((y - z) + 1.0)) / z) <= -2e-301) {
		tmp = -fabs(x);
	} else {
		tmp = (y / z) * fabs(x);
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (((Math.abs(x) * ((y - z) + 1.0)) / z) <= -2e-301) {
		tmp = -Math.abs(x);
	} else {
		tmp = (y / z) * Math.abs(x);
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if ((math.fabs(x) * ((y - z) + 1.0)) / z) <= -2e-301:
		tmp = -math.fabs(x)
	else:
		tmp = (y / z) * math.fabs(x)
	return math.copysign(1.0, x) * tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(Float64(abs(x) * Float64(Float64(y - z) + 1.0)) / z) <= -2e-301)
		tmp = Float64(-abs(x));
	else
		tmp = Float64(Float64(y / z) * abs(x));
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (((abs(x) * ((y - z) + 1.0)) / z) <= -2e-301)
		tmp = -abs(x);
	else
		tmp = (y / z) * abs(x);
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_, y_, z_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[(N[(N[Abs[x], $MachinePrecision] * N[(N[(y - z), $MachinePrecision] + 1), $MachinePrecision]), $MachinePrecision] / z), $MachinePrecision], -4825645764048353/24128228820241763395368498172630942708201009006994023127186460259846489377974909173483894312553062974832901700057603348659254161999916252716423678391067804088773420366831584139402736156236316721587153396424382337160349784305655085875761908966202683012582070411724897569696118189719975296519556940632582457459891765248], (-N[Abs[x], $MachinePrecision]), N[(N[(y / z), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (*.f64 x (+.f64 (-.f64 y z) #s(literal 1 binary64))) z) < -2.0000000000000001e-301

   1. Initial program 87.5%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{-1 \cdot x} \]
   3. Step-by-step derivation

      1. lower-*.f64 40.2%

         \[\leadsto -1 \cdot \color{blue}{x} \]

   4. Applied rewrites 40.2%

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

      1. lift-*.f64 N/A

         \[\leadsto -1 \cdot \color{blue}{x} \]

      2. *-commutative N/A

         \[\leadsto x \cdot \color{blue}{-1} \]

      3. remove-double-neg N/A

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

      4. lower-neg.f64 N/A

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

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

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

      6. metadata-eval N/A

         \[\leadsto -x \cdot 1 \]

      7. *-rgt-identity 40.2%

         \[\leadsto -x \]

   6. Applied rewrites 40.2%

      \[\leadsto -x \]

   if -2.0000000000000001e-301 < (/.f64 (*.f64 x (+.f64 (-.f64 y z) #s(literal 1 binary64))) z)

   1. Initial program 87.5%

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

   2. Taylor expanded in z around 0

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

      1. lower-+.f64 59.6%

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

   4. Applied rewrites 59.6%

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

      1. lift-/.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. *-rgt-identity N/A

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

      5. metadata-eval N/A

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

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

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

      7. associate-*l/ N/A

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

      8. lower-*.f64 N/A

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

      9. lower-/.f64 N/A

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

      10. lift-+.f64 N/A

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

      11. +-commutative N/A

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

      12. add-flip N/A

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

      13. metadata-eval N/A

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

      14. lower--.f64 N/A

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

      15. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite<=}\left(distribute-rgt-neg-out, \left(x \cdot \left(\mathsf{neg}\left(-1\right)\right)\right)\right) \]

      16. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \left(x \cdot \mathsf{Rewrite=>}\left(metadata-eval, 1\right)\right) \]

      17. lower--.f64 N/A

          \[\leadsto \frac{y - \color{blue}{-1}}{z} \cdot \mathsf{Rewrite=>}\left(*-rgt-identity, x\right) \]

   6. Applied rewrites 57.7%

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

   7. Taylor expanded in y around inf

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

      1. lower-/.f64 35.7%

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

   9. Applied rewrites 35.7%

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

Alternative 12: 40.2% accurate, 7.7× speedup

Math

\[-x \]

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := (-x)

Derivation

1. Initial program 87.5%

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

2. Taylor expanded in z around inf

   \[\leadsto \color{blue}{-1 \cdot x} \]
3. Step-by-step derivation

   1. lower-*.f64 40.2%

      \[\leadsto -1 \cdot \color{blue}{x} \]

4. Applied rewrites 40.2%

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

   1. lift-*.f64 N/A

      \[\leadsto -1 \cdot \color{blue}{x} \]

   2. *-commutative N/A

      \[\leadsto x \cdot \color{blue}{-1} \]

   3. remove-double-neg N/A

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

   4. lower-neg.f64 N/A

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

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

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

   6. metadata-eval N/A

      \[\leadsto -x \cdot 1 \]

   7. *-rgt-identity 40.2%

      \[\leadsto -x \]

6. Applied rewrites 40.2%

   \[\leadsto -x \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2025271 -o generate:evaluate
(FPCore (x y z)
  :name "Diagrams.TwoD.Segment.Bernstein:evaluateBernstein from diagrams-lib-1.3.0.3"
  :precision binary64
  (/ (* x (+ (- y z) 1)) z))