Development.Shake.Progress:decay from shake-0.15.5

Percentage Accurate: 65.9% → 93.8%

Time: 6.1s

Alternatives: 10

Speedup: 0.9×

Specification

Math

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

FPCore

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

C

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

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, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x * y) + (z * (t - a))) / (y + (z * (b - y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 65.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = ((x * y) + (z * (t - a))) / (y + (z * (b - y)))
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 93.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ t_2 := \mathsf{fma}\left(b - y, z, y\right)\\ t_3 := z \cdot \left(t - a\right)\\ t_4 := x \cdot y + t\_3\\ t_5 := \frac{t\_4}{y + z \cdot \left(b - y\right)}\\ t_6 := \mathsf{fma}\left(\frac{t - a}{t\_2}, z, \frac{x}{t\_2} \cdot y\right)\\ \mathbf{if}\;t\_5 \leq -\infty:\\ \;\;\;\;t\_6\\ \mathbf{elif}\;t\_5 \leq -2 \cdot 10^{-285}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, y, t\_3\right)}{\mathsf{fma}\left(z, b - y, y\right)}\\ \mathbf{elif}\;t\_5 \leq 0:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_5 \leq 2 \cdot 10^{+277}:\\ \;\;\;\;\frac{t\_4}{\mathsf{fma}\left(b, z, y\right) - z \cdot y}\\ \mathbf{elif}\;t\_5 \leq \infty:\\ \;\;\;\;t\_6\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y)))
        (t_2 (fma (- b y) z y))
        (t_3 (* z (- t a)))
        (t_4 (+ (* x y) t_3))
        (t_5 (/ t_4 (+ y (* z (- b y)))))
        (t_6 (fma (/ (- t a) t_2) z (* (/ x t_2) y))))
   (if (<= t_5 (- INFINITY))
     t_6
     (if (<= t_5 -2e-285)
       (/ (fma x y t_3) (fma z (- b y) y))
       (if (<= t_5 0.0)
         t_1
         (if (<= t_5 2e+277)
           (/ t_4 (- (fma b z y) (* z y)))
           (if (<= t_5 INFINITY) t_6 t_1)))))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double t_2 = fma((b - y), z, y);
	double t_3 = z * (t - a);
	double t_4 = (x * y) + t_3;
	double t_5 = t_4 / (y + (z * (b - y)));
	double t_6 = fma(((t - a) / t_2), z, ((x / t_2) * y));
	double tmp;
	if (t_5 <= -((double) INFINITY)) {
		tmp = t_6;
	} else if (t_5 <= -2e-285) {
		tmp = fma(x, y, t_3) / fma(z, (b - y), y);
	} else if (t_5 <= 0.0) {
		tmp = t_1;
	} else if (t_5 <= 2e+277) {
		tmp = t_4 / (fma(b, z, y) - (z * y));
	} else if (t_5 <= ((double) INFINITY)) {
		tmp = t_6;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	t_2 = fma(Float64(b - y), z, y)
	t_3 = Float64(z * Float64(t - a))
	t_4 = Float64(Float64(x * y) + t_3)
	t_5 = Float64(t_4 / Float64(y + Float64(z * Float64(b - y))))
	t_6 = fma(Float64(Float64(t - a) / t_2), z, Float64(Float64(x / t_2) * y))
	tmp = 0.0
	if (t_5 <= Float64(-Inf))
		tmp = t_6;
	elseif (t_5 <= -2e-285)
		tmp = Float64(fma(x, y, t_3) / fma(z, Float64(b - y), y));
	elseif (t_5 <= 0.0)
		tmp = t_1;
	elseif (t_5 <= 2e+277)
		tmp = Float64(t_4 / Float64(fma(b, z, y) - Float64(z * y)));
	elseif (t_5 <= Inf)
		tmp = t_6;
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[(b - y), $MachinePrecision] * z + y), $MachinePrecision]}, Block[{t$95$3 = N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$4 = N[(N[(x * y), $MachinePrecision] + t$95$3), $MachinePrecision]}, Block[{t$95$5 = N[(t$95$4 / N[(y + N[(z * N[(b - y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$6 = N[(N[(N[(t - a), $MachinePrecision] / t$95$2), $MachinePrecision] * z + N[(N[(x / t$95$2), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$5, (-Infinity)], t$95$6, If[LessEqual[t$95$5, -2e-285], N[(N[(x * y + t$95$3), $MachinePrecision] / N[(z * N[(b - y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, 0.0], t$95$1, If[LessEqual[t$95$5, 2e+277], N[(t$95$4 / N[(N[(b * z + y), $MachinePrecision] - N[(z * y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$5, Infinity], t$95$6, t$95$1]]]]]]]]]]]

Derivation

1. Split input into 4 regimes

2. if (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -inf.0 or 2.00000000000000001e277 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < +inf.0

   1. Initial program 65.9%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. associate-*r/ N/A

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

      4. *-rgt-identity N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

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

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

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

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

      10. div-add N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

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

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

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

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

      16. distribute-lft-neg-in N/A

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

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

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

      18. remove-double-neg N/A

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

      19. lift-*.f64 N/A

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

      20. *-rgt-identity N/A

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

   3. Applied rewrites 69.5%

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

   if -inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -2.00000000000000015e-285

   1. Initial program 65.9%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. associate-*r/ N/A

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

      4. *-rgt-identity N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

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

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

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

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

      10. div-add N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

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

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

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

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

      16. distribute-lft-neg-in N/A

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

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

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

      18. remove-double-neg N/A

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

      19. lift-*.f64 N/A

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

      20. *-rgt-identity N/A

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

   3. Applied rewrites 69.5%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lift-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-*l/ N/A

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

      8. div-add-rev N/A

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

      9. +-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift--.f64 N/A

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

      13. lower-/.f64 N/A

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

   5. Applied rewrites 65.9%

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

   if -2.00000000000000015e-285 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < -0.0 or +inf.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y))))

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -0.0 < (/.f64 (+.f64 (*.f64 x y) (*.f64 z (-.f64 t a))) (+.f64 y (*.f64 z (-.f64 b y)))) < 2.00000000000000001e277

   1. Initial program 65.9%

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

      1. lift-+.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

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

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

      5. distribute-lft-neg-in N/A

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

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

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

      7. *-commutative N/A

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

      8. lift--.f64 N/A

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

      9. sub-flip N/A

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

      10. distribute-rgt-in N/A

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

      11. associate--r+ N/A

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

      12. *-commutative N/A

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

      13. lower--.f64 N/A

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

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

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

      15. add-flip-rev N/A

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

      16. +-commutative N/A

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

      17. lower-fma.f64 N/A

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

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

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

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

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

      20. remove-double-neg N/A

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

      21. lower-*.f64 65.7

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

   3. Applied rewrites 65.7%

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

Alternative 2: 84.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -2.55 \cdot 10^{+29}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.5 \cdot 10^{+49}:\\ \;\;\;\;\frac{\mathsf{fma}\left(x, y, z \cdot \left(t - a\right)\right)}{\mathsf{fma}\left(z, b - y, y\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -2.55e+29)
     t_1
     (if (<= z 2.5e+49) (/ (fma x y (* z (- t a))) (fma z (- b y) y)) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -2.55e+29) {
		tmp = t_1;
	} else if (z <= 2.5e+49) {
		tmp = fma(x, y, (z * (t - a))) / fma(z, (b - y), y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -2.55e+29)
		tmp = t_1;
	elseif (z <= 2.5e+49)
		tmp = Float64(fma(x, y, Float64(z * Float64(t - a))) / fma(z, Float64(b - y), y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.55e+29], t$95$1, If[LessEqual[z, 2.5e+49], N[(N[(x * y + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(z * N[(b - y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -2.55e29 or 2.5000000000000002e49 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -2.55e29 < z < 2.5000000000000002e49

   1. Initial program 65.9%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. associate-*r/ N/A

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

      4. *-rgt-identity N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. lift-*.f64 N/A

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

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

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

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

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

      10. div-add N/A

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

      11. lift-*.f64 N/A

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

      12. associate-/l* N/A

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

      13. *-commutative N/A

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

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

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

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

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

      16. distribute-lft-neg-in N/A

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

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

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

      18. remove-double-neg N/A

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

      19. lift-*.f64 N/A

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

      20. *-rgt-identity N/A

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

   3. Applied rewrites 69.5%

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

      1. lift-fma.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. lift-/.f64 N/A

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

      4. associate-*l/ N/A

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

      5. lift-*.f64 N/A

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

      6. lift-/.f64 N/A

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

      7. associate-*l/ N/A

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

      8. div-add-rev N/A

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

      9. +-commutative N/A

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

      10. lift-*.f64 N/A

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

      11. *-commutative N/A

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

      12. lift--.f64 N/A

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

      13. lower-/.f64 N/A

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

   5. Applied rewrites 65.9%

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

Alternative 3: 83.3% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -6700000000:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.9:\\ \;\;\;\;\frac{x \cdot y + z \cdot \left(t - a\right)}{y + z \cdot b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -6700000000.0)
     t_1
     (if (<= z 2.9) (/ (+ (* x y) (* z (- t a))) (+ y (* z b))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -6700000000.0) {
		tmp = t_1;
	} else if (z <= 2.9) {
		tmp = ((x * y) + (z * (t - a))) / (y + (z * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -6700000000.0) {
		tmp = t_1;
	} else if (z <= 2.9) {
		tmp = ((x * y) + (z * (t - a))) / (y + (z * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / (b - y)
	tmp = 0
	if z <= -6700000000.0:
		tmp = t_1
	elif z <= 2.9:
		tmp = ((x * y) + (z * (t - a))) / (y + (z * b))
	else:
		tmp = t_1
	return tmp

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -6700000000.0], t$95$1, If[LessEqual[z, 2.9], N[(N[(N[(x * y), $MachinePrecision] + N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -6.7e9 or 2.89999999999999991 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -6.7e9 < z < 2.89999999999999991

   1. Initial program 65.9%

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

   2. Taylor expanded in y around 0

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

   4. Applied rewrites 56.2%

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

Alternative 4: 70.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -2.4 \cdot 10^{-21}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 10^{-149}:\\ \;\;\;\;\mathsf{fma}\left(t - a, z, y \cdot x\right) \cdot \frac{1}{y}\\ \mathbf{elif}\;z \leq 3.3 \cdot 10^{+15}:\\ \;\;\;\;\frac{z \cdot \left(t - a\right)}{\mathsf{fma}\left(z, b - y, y\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -2.4e-21)
     t_1
     (if (<= z 1e-149)
       (* (fma (- t a) z (* y x)) (/ 1.0 y))
       (if (<= z 3.3e+15) (/ (* z (- t a)) (fma z (- b y) y)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -2.4e-21) {
		tmp = t_1;
	} else if (z <= 1e-149) {
		tmp = fma((t - a), z, (y * x)) * (1.0 / y);
	} else if (z <= 3.3e+15) {
		tmp = (z * (t - a)) / fma(z, (b - y), y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -2.4e-21)
		tmp = t_1;
	elseif (z <= 1e-149)
		tmp = Float64(fma(Float64(t - a), z, Float64(y * x)) * Float64(1.0 / y));
	elseif (z <= 3.3e+15)
		tmp = Float64(Float64(z * Float64(t - a)) / fma(z, Float64(b - y), y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -2.4e-21], t$95$1, If[LessEqual[z, 1e-149], N[(N[(N[(t - a), $MachinePrecision] * z + N[(y * x), $MachinePrecision]), $MachinePrecision] * N[(1.0 / y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.3e+15], N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(z * N[(b - y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.3999999999999999e-21 or 3.3e15 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -2.3999999999999999e-21 < z < 9.99999999999999979e-150

   1. Initial program 65.9%

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

      1. lift-/.f64 N/A

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

      2. mult-flip N/A

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

      3. lower-*.f64 N/A

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

      4. *-lft-identity N/A

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

      5. lift-+.f64 N/A

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

      6. +-commutative N/A

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

      7. distribute-rgt-in N/A

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

      8. *-rgt-identity N/A

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

      9. remove-double-neg N/A

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

      10. remove-double-neg N/A

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

      11. *-rgt-identity N/A

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

      12. lift-*.f64 N/A

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

      13. *-commutative N/A

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

      14. lower-fma.f64 N/A

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

      15. lift-*.f64 N/A

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

      16. *-commutative N/A

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

      17. lower-*.f64 N/A

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

      18. lower-/.f64 65.8

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

      19. lift-+.f64 N/A

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

      20. +-commutative N/A

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

      21. add-flip N/A

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

      22. sub-flip N/A

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

      23. lift-*.f64 N/A

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

      24. *-commutative N/A

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

      25. remove-double-neg N/A

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

   3. Applied rewrites 65.8%

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

   4. Taylor expanded in z around 0

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

      1. lower-/.f64 32.2

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

   6. Applied rewrites 32.2%

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

   if 9.99999999999999979e-150 < z < 3.3e15

   1. Initial program 65.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 41.6

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

   4. Applied rewrites 41.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-fma.f64 41.6

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

   6. Applied rewrites 41.6%

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

Alternative 5: 66.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -7.8 \cdot 10^{-14}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{-153}:\\ \;\;\;\;-1 \cdot \frac{x}{z - 1}\\ \mathbf{elif}\;z \leq 3.3 \cdot 10^{+15}:\\ \;\;\;\;\frac{z \cdot \left(t - a\right)}{\mathsf{fma}\left(z, b - y, y\right)}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -7.8e-14)
     t_1
     (if (<= z 2.7e-153)
       (* -1.0 (/ x (- z 1.0)))
       (if (<= z 3.3e+15) (/ (* z (- t a)) (fma z (- b y) y)) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -7.8e-14) {
		tmp = t_1;
	} else if (z <= 2.7e-153) {
		tmp = -1.0 * (x / (z - 1.0));
	} else if (z <= 3.3e+15) {
		tmp = (z * (t - a)) / fma(z, (b - y), y);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -7.8e-14)
		tmp = t_1;
	elseif (z <= 2.7e-153)
		tmp = Float64(-1.0 * Float64(x / Float64(z - 1.0)));
	elseif (z <= 3.3e+15)
		tmp = Float64(Float64(z * Float64(t - a)) / fma(z, Float64(b - y), y));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -7.8e-14], t$95$1, If[LessEqual[z, 2.7e-153], N[(-1.0 * N[(x / N[(z - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 3.3e+15], N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(z * N[(b - y), $MachinePrecision] + y), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -7.7999999999999996e-14 or 3.3e15 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -7.7999999999999996e-14 < z < 2.70000000000000009e-153

   1. Initial program 65.9%

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

   2. Taylor expanded in y around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 33.1

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

   4. Applied rewrites 33.1%

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

   if 2.70000000000000009e-153 < z < 3.3e15

   1. Initial program 65.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 41.6

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

   4. Applied rewrites 41.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. lift-fma.f64 41.6

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

   6. Applied rewrites 41.6%

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

Alternative 6: 66.6% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -7.8 \cdot 10^{-14}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.7 \cdot 10^{-153}:\\ \;\;\;\;-1 \cdot \frac{x}{z - 1}\\ \mathbf{elif}\;z \leq 6.5:\\ \;\;\;\;\frac{z \cdot \left(t - a\right)}{y + z \cdot b}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -7.8e-14)
     t_1
     (if (<= z 2.7e-153)
       (* -1.0 (/ x (- z 1.0)))
       (if (<= z 6.5) (/ (* z (- t a)) (+ y (* z b))) t_1)))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -7.8e-14) {
		tmp = t_1;
	} else if (z <= 2.7e-153) {
		tmp = -1.0 * (x / (z - 1.0));
	} else if (z <= 6.5) {
		tmp = (z * (t - a)) / (y + (z * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t - a) / (b - y)
    if (z <= (-7.8d-14)) then
        tmp = t_1
    else if (z <= 2.7d-153) then
        tmp = (-1.0d0) * (x / (z - 1.0d0))
    else if (z <= 6.5d0) then
        tmp = (z * (t - a)) / (y + (z * b))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -7.8e-14) {
		tmp = t_1;
	} else if (z <= 2.7e-153) {
		tmp = -1.0 * (x / (z - 1.0));
	} else if (z <= 6.5) {
		tmp = (z * (t - a)) / (y + (z * b));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / (b - y)
	tmp = 0
	if z <= -7.8e-14:
		tmp = t_1
	elif z <= 2.7e-153:
		tmp = -1.0 * (x / (z - 1.0))
	elif z <= 6.5:
		tmp = (z * (t - a)) / (y + (z * b))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -7.8e-14)
		tmp = t_1;
	elseif (z <= 2.7e-153)
		tmp = Float64(-1.0 * Float64(x / Float64(z - 1.0)));
	elseif (z <= 6.5)
		tmp = Float64(Float64(z * Float64(t - a)) / Float64(y + Float64(z * b)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -7.8e-14)
		tmp = t_1;
	elseif (z <= 2.7e-153)
		tmp = -1.0 * (x / (z - 1.0));
	elseif (z <= 6.5)
		tmp = (z * (t - a)) / (y + (z * b));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -7.8e-14], t$95$1, If[LessEqual[z, 2.7e-153], N[(-1.0 * N[(x / N[(z - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 6.5], N[(N[(z * N[(t - a), $MachinePrecision]), $MachinePrecision] / N[(y + N[(z * b), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]]

Derivation

1. Split input into 3 regimes

2. if z < -7.7999999999999996e-14 or 6.5 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -7.7999999999999996e-14 < z < 2.70000000000000009e-153

   1. Initial program 65.9%

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

   2. Taylor expanded in y around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 33.1

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

   4. Applied rewrites 33.1%

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

   if 2.70000000000000009e-153 < z < 6.5

   1. Initial program 65.9%

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

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

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

      2. lower--.f64 41.6

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

   4. Applied rewrites 41.6%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 34.2%

      \[\leadsto \frac{z \cdot \left(t - a\right)}{y + z \cdot \color{blue}{b}} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 7: 64.6% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{t - a}{b - y}\\ \mathbf{if}\;z \leq -7.8 \cdot 10^{-14}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 3.5 \cdot 10^{-119}:\\ \;\;\;\;-1 \cdot \frac{x}{z - 1}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t a b)
 :precision binary64
 (let* ((t_1 (/ (- t a) (- b y))))
   (if (<= z -7.8e-14) t_1 (if (<= z 3.5e-119) (* -1.0 (/ x (- z 1.0))) t_1))))

C

double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -7.8e-14) {
		tmp = t_1;
	} else if (z <= 3.5e-119) {
		tmp = -1.0 * (x / (z - 1.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

real(8) function code(x, y, z, t, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: t_1
    real(8) :: tmp
    t_1 = (t - a) / (b - y)
    if (z <= (-7.8d-14)) then
        tmp = t_1
    else if (z <= 3.5d-119) then
        tmp = (-1.0d0) * (x / (z - 1.0d0))
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t, double a, double b) {
	double t_1 = (t - a) / (b - y);
	double tmp;
	if (z <= -7.8e-14) {
		tmp = t_1;
	} else if (z <= 3.5e-119) {
		tmp = -1.0 * (x / (z - 1.0));
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t, a, b):
	t_1 = (t - a) / (b - y)
	tmp = 0
	if z <= -7.8e-14:
		tmp = t_1
	elif z <= 3.5e-119:
		tmp = -1.0 * (x / (z - 1.0))
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t, a, b)
	t_1 = Float64(Float64(t - a) / Float64(b - y))
	tmp = 0.0
	if (z <= -7.8e-14)
		tmp = t_1;
	elseif (z <= 3.5e-119)
		tmp = Float64(-1.0 * Float64(x / Float64(z - 1.0)));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t, a, b)
	t_1 = (t - a) / (b - y);
	tmp = 0.0;
	if (z <= -7.8e-14)
		tmp = t_1;
	elseif (z <= 3.5e-119)
		tmp = -1.0 * (x / (z - 1.0));
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_, a_, b_] := Block[{t$95$1 = N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -7.8e-14], t$95$1, If[LessEqual[z, 3.5e-119], N[(-1.0 * N[(x / N[(z - 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -7.7999999999999996e-14 or 3.5e-119 < z

   1. Initial program 65.9%

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

   2. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
   3. Step-by-step derivation

      1. lower-/.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

      2. lower--.f64 N/A

         \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

      3. lower--.f64 52.0

         \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

   4. Applied rewrites 52.0%

      \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]

   if -7.7999999999999996e-14 < z < 3.5e-119

   1. Initial program 65.9%

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

   2. Taylor expanded in y around -inf

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

      1. lower-*.f64 N/A

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

      2. lower-/.f64 N/A

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

      3. lower--.f64 33.1

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

   4. Applied rewrites 33.1%

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

Alternative 8: 52.0% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \frac{t - a}{b - y} \end{array} \]

FPCore

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

C

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

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, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (t - a) / (b - y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(t - a), $MachinePrecision] / N[(b - y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 65.9%

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

2. Taylor expanded in z around inf

   \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{t - a}{\color{blue}{b - y}} \]

   2. lower--.f64 N/A

      \[\leadsto \frac{t - a}{\color{blue}{b} - y} \]

   3. lower--.f64 52.0

      \[\leadsto \frac{t - a}{b - \color{blue}{y}} \]

4. Applied rewrites 52.0%

   \[\leadsto \color{blue}{\frac{t - a}{b - y}} \]
5. Add Preprocessing

Alternative 9: 34.8% accurate, 3.4× speedup

Math

\[\begin{array}{l} \\ \frac{t - a}{b} \end{array} \]

FPCore

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

C

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

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, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (t - a) / b
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(N[(t - a), $MachinePrecision] / b), $MachinePrecision]

Derivation

1. Initial program 65.9%

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

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{t - a}{b}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{t - a}{\color{blue}{b}} \]

   2. lower--.f64 34.8

      \[\leadsto \frac{t - a}{b} \]

4. Applied rewrites 34.8%

   \[\leadsto \color{blue}{\frac{t - a}{b}} \]
5. Add Preprocessing

Alternative 10: 20.1% accurate, 5.5× speedup

Math

\[\begin{array}{l} \\ \frac{t}{b} \end{array} \]

FPCore

(FPCore (x y z t a b) :precision binary64 (/ t b))

C

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

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, a, b)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = t / b
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_, t_, a_, b_] := N[(t / b), $MachinePrecision]

Derivation

1. Initial program 65.9%

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

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{\frac{t - a}{b}} \]
3. Step-by-step derivation

   1. lower-/.f64 N/A

      \[\leadsto \frac{t - a}{\color{blue}{b}} \]

   2. lower--.f64 34.8

      \[\leadsto \frac{t - a}{b} \]

4. Applied rewrites 34.8%

   \[\leadsto \color{blue}{\frac{t - a}{b}} \]

5. Taylor expanded in t around inf

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

   1. lower-/.f64 20.1

      \[\leadsto \frac{t}{b} \]

7. Applied rewrites 20.1%

   \[\leadsto \frac{t}{\color{blue}{b}} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2025154 
(FPCore (x y z t a b)
  :name "Development.Shake.Progress:decay from shake-0.15.5"
  :precision binary64
  (/ (+ (* x y) (* z (- t a))) (+ y (* z (- b y)))))