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

Percentage Accurate: 100.0% → 100.0%

Time: 9.1s

Alternatives: 9

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

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) / (t * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) / (t * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) / (t * 2.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

Alternative 2: 48.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{elif}\;x + y \leq 5000000:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot 0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-31)
   (/ (* x 0.5) t)
   (if (<= (+ x y) 5000000.0) (/ (* z -0.5) t) (/ (* y 0.5) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else if ((x + y) <= 5000000.0) {
		tmp = (z * -0.5) / t;
	} else {
		tmp = (y * 0.5) / t;
	}
	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) :: tmp
    if ((x + y) <= (-2d-31)) then
        tmp = (x * 0.5d0) / t
    else if ((x + y) <= 5000000.0d0) then
        tmp = (z * (-0.5d0)) / t
    else
        tmp = (y * 0.5d0) / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else if ((x + y) <= 5000000.0) {
		tmp = (z * -0.5) / t;
	} else {
		tmp = (y * 0.5) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-31:
		tmp = (x * 0.5) / t
	elif (x + y) <= 5000000.0:
		tmp = (z * -0.5) / t
	else:
		tmp = (y * 0.5) / t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e-31)
		tmp = Float64(Float64(x * 0.5) / t);
	elseif (Float64(x + y) <= 5000000.0)
		tmp = Float64(Float64(z * -0.5) / t);
	else
		tmp = Float64(Float64(y * 0.5) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-31)
		tmp = (x * 0.5) / t;
	elseif ((x + y) <= 5000000.0)
		tmp = (z * -0.5) / t;
	else
		tmp = (y * 0.5) / t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -2e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 42.4

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

   5. Simplified 42.4%

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

   if -2e-31 < (+.f64 x y) < 5e6

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 80.0

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

   5. Simplified 80.0%

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

   if 5e6 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 40.4

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

   5. Simplified 40.4%

      \[\leadsto \color{blue}{\frac{0.5 \cdot y}{t}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 50.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{elif}\;x + y \leq 5000000:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot 0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 48.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{elif}\;x + y \leq 5000000:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot 0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-31)
   (/ (* x 0.5) t)
   (if (<= (+ x y) 5000000.0) (* z (/ -0.5 t)) (/ (* y 0.5) t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else if ((x + y) <= 5000000.0) {
		tmp = z * (-0.5 / t);
	} else {
		tmp = (y * 0.5) / t;
	}
	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) :: tmp
    if ((x + y) <= (-2d-31)) then
        tmp = (x * 0.5d0) / t
    else if ((x + y) <= 5000000.0d0) then
        tmp = z * ((-0.5d0) / t)
    else
        tmp = (y * 0.5d0) / t
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else if ((x + y) <= 5000000.0) {
		tmp = z * (-0.5 / t);
	} else {
		tmp = (y * 0.5) / t;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-31:
		tmp = (x * 0.5) / t
	elif (x + y) <= 5000000.0:
		tmp = z * (-0.5 / t)
	else:
		tmp = (y * 0.5) / t
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -2e-31)
		tmp = Float64(Float64(x * 0.5) / t);
	elseif (Float64(x + y) <= 5000000.0)
		tmp = Float64(z * Float64(-0.5 / t));
	else
		tmp = Float64(Float64(y * 0.5) / t);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-31)
		tmp = (x * 0.5) / t;
	elseif ((x + y) <= 5000000.0)
		tmp = z * (-0.5 / t);
	else
		tmp = (y * 0.5) / t;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -2e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 42.4

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

   5. Simplified 42.4%

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

   if -2e-31 < (+.f64 x y) < 5e6

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 80.0

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

   5. Simplified 80.0%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. clear-num N/A

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

      4. div-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

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

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

      8. *-lowering-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. div-inv N/A

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

      13. clear-num N/A

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

      14. /-lowering-/.f64 79.6

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

   7. Applied egg-rr 79.6%

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

   if 5e6 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in y around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 40.4

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

   5. Simplified 40.4%

      \[\leadsto \color{blue}{\frac{0.5 \cdot y}{t}} \]
3. Recombined 3 regimes into one program.

4. Final simplification 50.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{elif}\;x + y \leq 5000000:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y \cdot 0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 82.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_1 := \frac{z \cdot -0.5}{t}\\ \mathbf{if}\;z \leq -1.02 \cdot 10^{+89}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+79}:\\ \;\;\;\;\frac{x + y}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (let* ((t_1 (/ (* z -0.5) t)))
   (if (<= z -1.02e+89) t_1 (if (<= z 2.4e+79) (/ (+ x y) (* t 2.0)) t_1))))

C

double code(double x, double y, double z, double t) {
	double t_1 = (z * -0.5) / t;
	double tmp;
	if (z <= -1.02e+89) {
		tmp = t_1;
	} else if (z <= 2.4e+79) {
		tmp = (x + y) / (t * 2.0);
	} 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 = (z * (-0.5d0)) / t
    if (z <= (-1.02d+89)) then
        tmp = t_1
    else if (z <= 2.4d+79) then
        tmp = (x + y) / (t * 2.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 t_1 = (z * -0.5) / t;
	double tmp;
	if (z <= -1.02e+89) {
		tmp = t_1;
	} else if (z <= 2.4e+79) {
		tmp = (x + y) / (t * 2.0);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Python

def code(x, y, z, t):
	t_1 = (z * -0.5) / t
	tmp = 0
	if z <= -1.02e+89:
		tmp = t_1
	elif z <= 2.4e+79:
		tmp = (x + y) / (t * 2.0)
	else:
		tmp = t_1
	return tmp

Julia

function code(x, y, z, t)
	t_1 = Float64(Float64(z * -0.5) / t)
	tmp = 0.0
	if (z <= -1.02e+89)
		tmp = t_1;
	elseif (z <= 2.4e+79)
		tmp = Float64(Float64(x + y) / Float64(t * 2.0));
	else
		tmp = t_1;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	t_1 = (z * -0.5) / t;
	tmp = 0.0;
	if (z <= -1.02e+89)
		tmp = t_1;
	elseif (z <= 2.4e+79)
		tmp = (x + y) / (t * 2.0);
	else
		tmp = t_1;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_, t_] := Block[{t$95$1 = N[(N[(z * -0.5), $MachinePrecision] / t), $MachinePrecision]}, If[LessEqual[z, -1.02e+89], t$95$1, If[LessEqual[z, 2.4e+79], N[(N[(x + y), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], t$95$1]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.0199999999999999e89 or 2.39999999999999986e79 < z

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 75.8

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

   5. Simplified 75.8%

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

   if -1.0199999999999999e89 < z < 2.39999999999999986e79

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 85.7

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

   5. Simplified 85.7%

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

4. Final simplification 81.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.02 \cdot 10^{+89}:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \mathbf{elif}\;z \leq 2.4 \cdot 10^{+79}:\\ \;\;\;\;\frac{x + y}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{z \cdot -0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 68.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-201}:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - z}{t \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-201) (/ (- x z) (* t 2.0)) (/ (- y z) (* t 2.0))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-201) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (y - z) / (t * 2.0);
	}
	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) :: tmp
    if ((x + y) <= (-2d-201)) then
        tmp = (x - z) / (t * 2.0d0)
    else
        tmp = (y - z) / (t * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-201) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (y - z) / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-201:
		tmp = (x - z) / (t * 2.0)
	else:
		tmp = (y - z) / (t * 2.0)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-201)
		tmp = (x - z) / (t * 2.0);
	else
		tmp = (y - z) / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -1.99999999999999989e-201

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. --lowering--.f64 68.5

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

   5. Simplified 68.5%

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

   if -1.99999999999999989e-201 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

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

      1. --lowering--.f64 71.8

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

   5. Simplified 71.8%

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

Alternative 6: 77.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq 60000000:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x + y}{t \cdot 2}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= y 60000000.0) (/ (- x z) (* t 2.0)) (/ (+ x y) (* t 2.0))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 60000000.0) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (x + y) / (t * 2.0);
	}
	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) :: tmp
    if (y <= 60000000.0d0) then
        tmp = (x - z) / (t * 2.0d0)
    else
        tmp = (x + y) / (t * 2.0d0)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if (y <= 60000000.0) {
		tmp = (x - z) / (t * 2.0);
	} else {
		tmp = (x + y) / (t * 2.0);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if y <= 60000000.0:
		tmp = (x - z) / (t * 2.0)
	else:
		tmp = (x + y) / (t * 2.0)
	return tmp

Julia

function code(x, y, z, t)
	tmp = 0.0
	if (y <= 60000000.0)
		tmp = Float64(Float64(x - z) / Float64(t * 2.0));
	else
		tmp = Float64(Float64(x + y) / Float64(t * 2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if (y <= 60000000.0)
		tmp = (x - z) / (t * 2.0);
	else
		tmp = (x + y) / (t * 2.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 6e7

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. --lowering--.f64 79.1

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

   5. Simplified 79.1%

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

   if 6e7 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 84.0

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

   5. Simplified 84.0%

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

4. Final simplification 80.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq 60000000:\\ \;\;\;\;\frac{x - z}{t \cdot 2}\\ \mathbf{else}:\\ \;\;\;\;\frac{x + y}{t \cdot 2}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 42.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-31) (/ (* x 0.5) t) (* z (/ -0.5 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else {
		tmp = z * (-0.5 / t);
	}
	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) :: tmp
    if ((x + y) <= (-2d-31)) then
        tmp = (x * 0.5d0) / t
    else
        tmp = z * ((-0.5d0) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = (x * 0.5) / t;
	} else {
		tmp = z * (-0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-31:
		tmp = (x * 0.5) / t
	else:
		tmp = z * (-0.5 / t)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-31)
		tmp = (x * 0.5) / t;
	else
		tmp = z * (-0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -2e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 42.4

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

   5. Simplified 42.4%

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

   if -2e-31 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 50.6

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

   5. Simplified 50.6%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. clear-num N/A

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

      4. div-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

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

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

      8. *-lowering-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. div-inv N/A

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

      13. clear-num N/A

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

      14. /-lowering-/.f64 50.4

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

   7. Applied egg-rr 50.4%

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

4. Final simplification 47.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;\frac{x \cdot 0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 42.0% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -2e-31) (* x (/ 0.5 t)) (* z (/ -0.5 t))))

C

double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = x * (0.5 / t);
	} else {
		tmp = z * (-0.5 / t);
	}
	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) :: tmp
    if ((x + y) <= (-2d-31)) then
        tmp = x * (0.5d0 / t)
    else
        tmp = z * ((-0.5d0) / t)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -2e-31) {
		tmp = x * (0.5 / t);
	} else {
		tmp = z * (-0.5 / t);
	}
	return tmp;
}

Python

def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -2e-31:
		tmp = x * (0.5 / t)
	else:
		tmp = z * (-0.5 / t)
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -2e-31)
		tmp = x * (0.5 / t);
	else
		tmp = z * (-0.5 / t);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -2e-31

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

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

      1. *-commutative N/A

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

      2. associate-*l/ N/A

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

      3. /-lowering-/.f64 N/A

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 42.4

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

   5. Simplified 42.4%

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

      1. *-commutative N/A

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

      2. associate-/l* N/A

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

      3. *-lowering-*.f64 N/A

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

      4. /-lowering-/.f64 42.3

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

   7. Applied egg-rr 42.3%

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

   if -2e-31 < (+.f64 x y)

   1. Initial program 100.0%

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

   3. Taylor expanded in z around inf

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

      1. associate-*r/ N/A

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

      2. /-lowering-/.f64 N/A

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

      3. *-commutative N/A

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

      4. *-lowering-*.f64 50.6

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

   5. Simplified 50.6%

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

      1. associate-/l* N/A

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

      2. *-commutative N/A

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

      3. clear-num N/A

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

      4. div-inv N/A

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

      5. metadata-eval N/A

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

      6. metadata-eval N/A

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

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

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

      8. *-lowering-*.f64 N/A

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

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

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

      10. metadata-eval N/A

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

      11. metadata-eval N/A

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

      12. div-inv N/A

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

      13. clear-num N/A

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

      14. /-lowering-/.f64 50.4

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

   7. Applied egg-rr 50.4%

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

4. Final simplification 47.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -2 \cdot 10^{-31}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;z \cdot \frac{-0.5}{t}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 37.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ x \cdot \frac{0.5}{t} \end{array} \]

FPCore

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

C

double code(double x, double y, double z, double t) {
	return x * (0.5 / 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 * (0.5d0 / t)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf

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

   1. *-commutative N/A

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

   2. associate-*l/ N/A

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

   3. /-lowering-/.f64 N/A

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

   4. *-commutative N/A

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

   5. *-lowering-*.f64 36.4

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

5. Simplified 36.4%

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

   1. *-commutative N/A

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

   2. associate-/l* N/A

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

   3. *-lowering-*.f64 N/A

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

   4. /-lowering-/.f64 36.3

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

7. Applied egg-rr 36.3%

   \[\leadsto \color{blue}{x \cdot \frac{0.5}{t}} \]
8. Add Preprocessing

Reproduce

herbie shell --seed 2024204 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2.0)))