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

Percentage Accurate: 92.7% → 95.1%

Time: 9.2s

Alternatives: 10

Speedup: 1.1×

• 25.2% 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

real(8) function code(x, y, z, t)
    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: 92.7% 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

real(8) function code(x, y, z, t)
    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: 95.1% accurate, 0.8× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < 1e-107

   1. Initial program 97.6%

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

   if 1e-107 < x

   1. Initial program 93.5%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

Alternative 2: 82.7% accurate, 0.7× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= x -3.5e+22)
   (- x (/ (* x y) t))
   (if (<= x 4e+79) (+ x (/ (* y z) t)) (fma (/ y t) (- x) x))))

C

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

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (x <= -3.5e+22)
		tmp = Float64(x - Float64(Float64(x * y) / t));
	elseif (x <= 4e+79)
		tmp = Float64(x + Float64(Float64(y * z) / t));
	else
		tmp = fma(Float64(y / t), Float64(-x), x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -3.5e22

   1. Initial program 98.2%

      \[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. mul-1-neg N/A

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

      2. unsub-neg N/A

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

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

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

      4. *-rgt-identity N/A

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

      5. associate-/l* N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 88.5

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

   5. Applied rewrites 88.5%

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

   if -3.5e22 < x < 3.99999999999999987e79

   1. Initial program 96.7%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 86.6

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

   5. Applied rewrites 86.6%

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

   if 3.99999999999999987e79 < x

   1. Initial program 92.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in z around 0

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

      1. mul-1-neg N/A

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

      2. lower-neg.f64 98.2

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

   7. Applied rewrites 98.2%

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

4. Final simplification 89.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -3.5 \cdot 10^{+22}:\\ \;\;\;\;x - \frac{x \cdot y}{t}\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+79}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{y}{t}, -x, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 84.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \frac{z - x}{t}\\ \mathbf{if}\;y \leq -4.6 \cdot 10^{+63}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 2.45 \cdot 10^{+65}:\\ \;\;\;\;x + \frac{y \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* y (/ (- z x) t))))
   (if (<= y -4.6e+63) t_1 (if (<= y 2.45e+65) (+ x (/ (* y z) t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = y * ((z - x) / t);
	double tmp;
	if (y <= -4.6e+63) {
		tmp = t_1;
	} else if (y <= 2.45e+65) {
		tmp = x + ((y * z) / t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: t_1
    real(8) :: tmp
    t_1 = y * ((z - x) / t)
    if (y <= (-4.6d+63)) then
        tmp = t_1
    else if (y <= 2.45d+65) then
        tmp = x + ((y * z) / t)
    else
        tmp = t_1
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double t_1 = y * ((z - x) / t);
	double tmp;
	if (y <= -4.6e+63) {
		tmp = t_1;
	} else if (y <= 2.45e+65) {
		tmp = x + ((y * z) / t);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = y * ((z - x) / t)
	tmp = 0
	if y <= -4.6e+63:
		tmp = t_1
	elif y <= 2.45e+65:
		tmp = x + ((y * z) / t)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(y * Float64(Float64(z - x) / t))
	tmp = 0.0
	if (y <= -4.6e+63)
		tmp = t_1;
	elseif (y <= 2.45e+65)
		tmp = Float64(x + Float64(Float64(y * z) / t));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = y * ((z - x) / t);
	tmp = 0.0;
	if (y <= -4.6e+63)
		tmp = t_1;
	elseif (y <= 2.45e+65)
		tmp = x + ((y * z) / t);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * N[(N[(z - x), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.6e+63], t$95$1, If[LessEqual[y, 2.45e+65], N[(x + N[(N[(y * z), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.59999999999999986e63 or 2.44999999999999978e65 < y

   1. Initial program 92.8%

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

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 92.9

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

   5. Applied rewrites 92.9%

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

   if -4.59999999999999986e63 < y < 2.44999999999999978e65

   1. Initial program 98.5%

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

   3. Taylor expanded in z around inf

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

      1. lower-*.f64 86.4

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

   5. Applied rewrites 86.4%

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

Alternative 4: 81.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := y \cdot \frac{z - x}{t}\\ \mathbf{if}\;y \leq -4.1 \cdot 10^{+69}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;y \leq 3 \cdot 10^{+65}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (* y (/ (- z x) t))))
   (if (<= y -4.1e+69) t_1 (if (<= y 3e+65) (fma (/ z t) y x) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = y * ((z - x) / t);
	double tmp;
	if (y <= -4.1e+69) {
		tmp = t_1;
	} else if (y <= 3e+65) {
		tmp = fma((z / t), y, x);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = Float64(y * Float64(Float64(z - x) / t))
	tmp = 0.0
	if (y <= -4.1e+69)
		tmp = t_1;
	elseif (y <= 3e+65)
		tmp = fma(Float64(z / t), y, x);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(y * N[(N[(z - x), $MachinePrecision] / t), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -4.1e+69], t$95$1, If[LessEqual[y, 3e+65], N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if y < -4.0999999999999999e69 or 3.0000000000000002e65 < y

   1. Initial program 92.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. div-sub N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 92.8

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

   5. Applied rewrites 92.8%

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

   if -4.0999999999999999e69 < y < 3.0000000000000002e65

   1. Initial program 98.6%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 88.1

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

   4. Applied rewrites 88.1%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 82.9

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

   7. Applied rewrites 82.9%

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

Alternative 5: 73.1% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \mathbf{if}\;z \leq -8 \cdot 10^{-246}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-246}:\\ \;\;\;\;\frac{y}{t} \cdot \left(-x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma (/ z t) y x)))
   (if (<= z -8e-246) t_1 (if (<= z 1.9e-246) (* (/ y t) (- x)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma((z / t), y, x);
	double tmp;
	if (z <= -8e-246) {
		tmp = t_1;
	} else if (z <= 1.9e-246) {
		tmp = (y / t) * -x;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(Float64(z / t), y, x)
	tmp = 0.0
	if (z <= -8e-246)
		tmp = t_1;
	elseif (z <= 1.9e-246)
		tmp = Float64(Float64(y / t) * Float64(-x));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[z, -8e-246], t$95$1, If[LessEqual[z, 1.9e-246], N[(N[(y / t), $MachinePrecision] * (-x)), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -7.99999999999999965e-246 or 1.89999999999999988e-246 < z

   1. Initial program 96.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 92.4

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

   4. Applied rewrites 92.4%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 77.5

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

   7. Applied rewrites 77.5%

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

   if -7.99999999999999965e-246 < z < 1.89999999999999988e-246

   1. Initial program 87.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. div-sub N/A

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

      2. lower-*.f64 N/A

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

      3. lower-/.f64 N/A

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

      4. lower--.f64 70.0

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

   5. Applied rewrites 70.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 69.1%

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

   10. Applied rewrites 85.9%

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

Alternative 6: 73.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \mathbf{if}\;z \leq -8 \cdot 10^{-246}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-246}:\\ \;\;\;\;\frac{x \cdot y}{-t}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (fma (/ z t) y x)))
   (if (<= z -8e-246) t_1 (if (<= z 1.9e-246) (/ (* x y) (- t)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = fma((z / t), y, x);
	double tmp;
	if (z <= -8e-246) {
		tmp = t_1;
	} else if (z <= 1.9e-246) {
		tmp = (x * y) / -t;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(x, y, z, t)
	t_1 = fma(Float64(z / t), y, x)
	tmp = 0.0
	if (z <= -8e-246)
		tmp = t_1;
	elseif (z <= 1.9e-246)
		tmp = Float64(Float64(x * y) / Float64(-t));
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z / t), $MachinePrecision] * y + x), $MachinePrecision]}, If[LessEqual[z, -8e-246], t$95$1, If[LessEqual[z, 1.9e-246], N[(N[(x * y), $MachinePrecision] / (-t)), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -7.99999999999999965e-246 or 1.89999999999999988e-246 < z

   1. Initial program 96.7%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 92.4

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

   4. Applied rewrites 92.4%

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

   5. Taylor expanded in z around inf

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

      1. lower-/.f64 77.5

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

   7. Applied rewrites 77.5%

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

   if -7.99999999999999965e-246 < z < 1.89999999999999988e-246

   1. Initial program 87.3%

      \[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. mul-1-neg N/A

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

      2. unsub-neg N/A

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

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

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

      4. *-rgt-identity N/A

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

      5. associate-/l* N/A

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

      6. lower--.f64 N/A

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

      7. lower-/.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 87.3

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

   5. Applied rewrites 87.3%

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

   6. Taylor expanded in y around inf

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

   8. Applied rewrites 74.1%

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

4. Final simplification 77.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8 \cdot 10^{-246}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \mathbf{elif}\;z \leq 1.9 \cdot 10^{-246}:\\ \;\;\;\;\frac{x \cdot y}{-t}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\frac{z}{t}, y, x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.0% accurate, 0.9× speedup

Math

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

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y -2e+55) (fma (/ (- z x) t) y x) (fma (/ y t) (- z x) x)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -2.00000000000000002e55

   1. Initial program 92.8%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. associate-/l* N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. lower-/.f64 99.8

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

   4. Applied rewrites 99.8%

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

   if -2.00000000000000002e55 < y

   1. Initial program 97.1%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-/.f64 N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. associate-/l* N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. lower-/.f64 97.6

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

   4. Applied rewrites 97.6%

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

Alternative 8: 97.6% accurate, 1.1× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 96.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. *-commutative N/A

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

   6. associate-/l* N/A

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

   7. *-commutative N/A

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

   8. lower-fma.f64 N/A

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

   9. lower-/.f64 96.3

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

4. Applied rewrites 96.3%

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

Alternative 9: 73.7% accurate, 1.3× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 96.2%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-/.f64 N/A

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

   4. lift-*.f64 N/A

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

   5. associate-/l* N/A

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

   6. *-commutative N/A

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

   7. lower-fma.f64 N/A

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

   8. lower-/.f64 91.5

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

4. Applied rewrites 91.5%

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

5. Taylor expanded in z around inf

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

   1. lower-/.f64 73.7

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

7. Applied rewrites 73.7%

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

Alternative 10: 41.2% accurate, 1.4× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 96.2%

   \[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 \color{blue}{\frac{y \cdot z}{t}} \]

   2. lower-*.f64 39.6

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

5. Applied rewrites 39.6%

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

7. Applied rewrites 40.2%

   \[\leadsto \color{blue}{z \cdot \frac{y}{t}} \]
8. 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

real(8) function code(x, y, z, t)
    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 2024238 
(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)))