Optimisation.CirclePacking:place from circle-packing-0.1.0.4, D

Percentage Accurate: 93.2% → 97.9%

Time: 3.5s

Alternatives: 10

Speedup: 1.1×

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

Specification

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 93.2% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 97.9% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.2%

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

   1. +-commutative N/A

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

   2. *-commutative N/A

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

   3. associate-/l* N/A

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

   4. lower-fma.f64 N/A

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

   5. lower--.f64 N/A

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

   6. lower-/.f64 95.8

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

4. Applied rewrites 95.8%

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

Alternative 2: 84.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= t -6.5e-39) (not (<= t 1.4e-93)))
   (fma y (/ z t) x)
   (/ (* (- z x) y) t)))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((t <= -6.5e-39) || !(t <= 1.4e-93)) {
		tmp = fma(y, (z / t), x);
	} else {
		tmp = ((z - x) * y) / t;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((t <= -6.5e-39) || !(t <= 1.4e-93))
		tmp = fma(y, Float64(z / t), x);
	else
		tmp = Float64(Float64(Float64(z - x) * y) / t);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if t < -6.50000000000000027e-39 or 1.39999999999999999e-93 < t

   1. Initial program 92.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 81.5%

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 84.4

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

   7. Applied rewrites 84.4%

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

   if -6.50000000000000027e-39 < t < 1.39999999999999999e-93

   1. Initial program 94.7%

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

   3. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 84.6

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

   5. Applied rewrites 84.6%

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

4. Final simplification 84.5%

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

Alternative 3: 84.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= x -2.2e+36) (not (<= x 48.0)))
   (* (- 1.0 (/ y t)) x)
   (fma y (/ z t) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -2.2e36 or 48 < x

   1. Initial program 93.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 85.1

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

   5. Applied rewrites 85.1%

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

   if -2.2e36 < x < 48

   1. Initial program 93.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 81.9%

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 83.8

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

   7. Applied rewrites 83.8%

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

4. Final simplification 84.4%

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

Alternative 4: 84.0% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -2.2e+36)
   (- x (* x (/ y t)))
   (if (<= x 48.0) (fma y (/ z t) x) (* (- 1.0 (/ y t)) x))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (x <= -2.2e+36) {
		tmp = x - (x * (y / t));
	} else if (x <= 48.0) {
		tmp = fma(y, (z / t), x);
	} else {
		tmp = (1.0 - (y / t)) * x;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -2.2e+36)
		tmp = Float64(x - Float64(x * Float64(y / t)));
	elseif (x <= 48.0)
		tmp = fma(y, Float64(z / t), x);
	else
		tmp = Float64(Float64(1.0 - Float64(y / t)) * x);
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[x, -2.2e+36], N[(x - N[(x * N[(y / t), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 48.0], N[(y * N[(z / t), $MachinePrecision] + x), $MachinePrecision], N[(N[(1.0 - N[(y / t), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.2e36

   1. Initial program 92.0%

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

      1. +-commutative N/A

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

      2. *-commutative N/A

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

      3. associate-/l* N/A

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

      4. lower-fma.f64 N/A

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

      5. lower--.f64 N/A

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

      6. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. associate-*r/ N/A

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

      3. *-commutative N/A

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

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

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

      7. times-frac N/A

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

      8. mul-1-neg N/A

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

      9. mul-1-neg N/A

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

      10. frac-2neg N/A

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

      11. lower--.f64 N/A

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

      12. associate-/l* N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 88.7

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

   7. Applied rewrites 88.7%

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

   if -2.2e36 < x < 48

   1. Initial program 93.0%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 81.9%

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 83.8

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

   7. Applied rewrites 83.8%

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

   if 48 < x

   1. Initial program 95.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 81.5

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

   5. Applied rewrites 81.5%

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

Alternative 5: 54.2% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+49} \lor \neg \left(z \leq 4.4 \cdot 10^{+43}\right):\\ \;\;\;\;\frac{y}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -9e+49) (not (<= z 4.4e+43))) (* (/ y t) z) x))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -9e+49) || !(z <= 4.4e+43)) {
		tmp = (y / t) * 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, t)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z <= (-9d+49)) .or. (.not. (z <= 4.4d+43))) then
        tmp = (y / t) * z
    else
        tmp = x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -9e+49) || !(z <= 4.4e+43)) {
		tmp = (y / t) * z;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (z <= -9e+49) or not (z <= 4.4e+43):
		tmp = (y / t) * z
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -9e+49) || !(z <= 4.4e+43))
		tmp = Float64(Float64(y / t) * z);
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -9e+49) || ~((z <= 4.4e+43)))
		tmp = (y / t) * z;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -8.99999999999999965e49 or 4.40000000000000001e43 < z

   1. Initial program 92.3%

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

   3. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 73.9

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

   5. Applied rewrites 73.9%

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

      1. associate-/l* N/A

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

      2. frac-2neg N/A

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

      3. mul-1-neg N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. frac-times N/A

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

      7. *-commutative N/A

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

      8. frac-times N/A

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

      9. *-commutative N/A

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

      10. mul-1-neg N/A

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

      11. mul-1-neg N/A

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

      12. frac-2neg N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 78.5

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

   7. Applied rewrites 78.5%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 71.4%

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

   if -8.99999999999999965e49 < z < 4.40000000000000001e43

   1. Initial program 93.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 48.4%

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

4. Final simplification 57.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+49} \lor \neg \left(z \leq 4.4 \cdot 10^{+43}\right):\\ \;\;\;\;\frac{y}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 53.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -9 \cdot 10^{+49}:\\ \;\;\;\;\frac{y}{t} \cdot z\\ \mathbf{elif}\;z \leq 4.4 \cdot 10^{+43}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot y}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= z -9e+49) (* (/ y t) z) (if (<= z 4.4e+43) x (/ (* z y) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -9e+49) {
		tmp = (y / t) * z;
	} else if (z <= 4.4e+43) {
		tmp = x;
	} else {
		tmp = (z * y) / t;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (z <= -9e+49) {
		tmp = (y / t) * z;
	} else if (z <= 4.4e+43) {
		tmp = x;
	} else {
		tmp = (z * y) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if z <= -9e+49:
		tmp = (y / t) * z
	elif z <= 4.4e+43:
		tmp = x
	else:
		tmp = (z * y) / t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (z <= -9e+49)
		tmp = Float64(Float64(y / t) * z);
	elseif (z <= 4.4e+43)
		tmp = x;
	else
		tmp = Float64(Float64(z * y) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (z <= -9e+49)
		tmp = (y / t) * z;
	elseif (z <= 4.4e+43)
		tmp = x;
	else
		tmp = (z * y) / t;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := If[LessEqual[z, -9e+49], N[(N[(y / t), $MachinePrecision] * z), $MachinePrecision], If[LessEqual[z, 4.4e+43], x, N[(N[(z * y), $MachinePrecision] / t), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -8.99999999999999965e49

   1. Initial program 90.1%

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

   3. Taylor expanded in y around inf

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

      1. sub-div N/A

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

      2. associate-/l* N/A

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

      3. lower-/.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 73.1

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

   5. Applied rewrites 73.1%

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

      1. associate-/l* N/A

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

      2. frac-2neg N/A

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

      3. mul-1-neg N/A

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

      4. *-commutative N/A

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

      5. mul-1-neg N/A

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

      6. frac-times N/A

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

      7. *-commutative N/A

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

      8. frac-times N/A

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

      9. *-commutative N/A

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

      10. mul-1-neg N/A

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

      11. mul-1-neg N/A

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

      12. frac-2neg N/A

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

      13. lower-*.f64 N/A

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

      14. lower-/.f64 N/A

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

      15. lower--.f64 80.7

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

   7. Applied rewrites 80.7%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 72.9%

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

   if -8.99999999999999965e49 < z < 4.40000000000000001e43

   1. Initial program 93.8%

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

   3. Taylor expanded in y around 0

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

   5. Applied rewrites 48.4%

      \[\leadsto \color{blue}{x} \]

   if 4.40000000000000001e43 < z

   1. Initial program 94.3%

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

   3. Taylor expanded in x around 0

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

      1. lower-/.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 70.7

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

   5. Applied rewrites 70.7%

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

Alternative 7: 72.5% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.4e+266) (* (/ (- y) t) x) (fma y (/ z t) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.40000000000000002e266

   1. Initial program 89.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 78.6

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

   5. Applied rewrites 78.6%

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

   6. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. mul-1-neg N/A

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

      4. lower-neg.f64 78.6

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

   8. Applied rewrites 78.6%

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

   if -2.40000000000000002e266 < y

   1. Initial program 93.3%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 72.7%

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 72.2

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

   7. Applied rewrites 72.2%

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

Alternative 8: 72.3% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2.4e+266) (/ (* (- x) y) t) (fma y (/ z t) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.40000000000000002e266

   1. Initial program 89.5%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. cancel-sign-sub N/A

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

      4. metadata-eval N/A

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

      5. *-lft-identity N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 78.6

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

   5. Applied rewrites 78.6%

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

   6. Taylor expanded in y around inf

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

      1. associate-*r/ N/A

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

      2. lower-/.f64 N/A

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

      3. associate-*r* N/A

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

      4. lower-*.f64 N/A

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

      5. mul-1-neg N/A

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

      6. lower-neg.f64 78.4

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

   8. Applied rewrites 78.4%

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

   if -2.40000000000000002e266 < y

   1. Initial program 93.3%

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

   3. Taylor expanded in x around 0

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

   5. Applied rewrites 72.7%

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

      1. +-commutative N/A

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

      2. associate-/l* N/A

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

      3. lower-fma.f64 N/A

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

      4. lower-/.f64 72.2

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

   7. Applied rewrites 72.2%

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

Alternative 9: 72.6% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 93.2%

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

3. Taylor expanded in x around 0

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

5. Applied rewrites 71.0%

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

   1. +-commutative N/A

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

   2. associate-/l* N/A

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

   3. lower-fma.f64 N/A

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

   4. lower-/.f64 70.1

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

7. Applied rewrites 70.1%

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

Alternative 10: 38.3% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 93.2%

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

3. Taylor expanded in y around 0

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

5. Applied rewrites 37.8%

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

Developer Target 1: 90.9% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

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

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2025044 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, D"
  :precision binary64

  :alt
  (! :herbie-platform default (- x (+ (* x (/ y t)) (* (- z) (/ y t)))))

  (+ x (/ (* y (- z x)) t)))