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

Percentage Accurate: 100.0% → 100.0%

Time: 8.1s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * (1.0d0 - z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (x + y) * (1.0d0 - z)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = (1.0d0 - z) * (x + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(1 - z\right) \]
2. Add Preprocessing

3. Final simplification 100.0%

   \[\leadsto \left(1 - z\right) \cdot \left(x + y\right) \]
4. Add Preprocessing

Alternative 2: 74.3% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := -y \cdot z\\ \mathbf{if}\;1 - z \leq -1 \cdot 10^{+237}:\\ \;\;\;\;-x \cdot z\\ \mathbf{elif}\;1 - z \leq -2 \cdot 10^{+20}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;1 - z \leq 2:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (* y z))))
   (if (<= (- 1.0 z) -1e+237)
     (- (* x z))
     (if (<= (- 1.0 z) -2e+20) t_0 (if (<= (- 1.0 z) 2.0) (+ x y) t_0)))))

C

double code(double x, double y, double z) {
	double t_0 = -(y * z);
	double tmp;
	if ((1.0 - z) <= -1e+237) {
		tmp = -(x * z);
	} else if ((1.0 - z) <= -2e+20) {
		tmp = t_0;
	} else if ((1.0 - z) <= 2.0) {
		tmp = x + y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = -(y * z)
    if ((1.0d0 - z) <= (-1d+237)) then
        tmp = -(x * z)
    else if ((1.0d0 - z) <= (-2d+20)) then
        tmp = t_0
    else if ((1.0d0 - z) <= 2.0d0) then
        tmp = x + y
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = -(y * z);
	double tmp;
	if ((1.0 - z) <= -1e+237) {
		tmp = -(x * z);
	} else if ((1.0 - z) <= -2e+20) {
		tmp = t_0;
	} else if ((1.0 - z) <= 2.0) {
		tmp = x + y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = -(y * z)
	tmp = 0
	if (1.0 - z) <= -1e+237:
		tmp = -(x * z)
	elif (1.0 - z) <= -2e+20:
		tmp = t_0
	elif (1.0 - z) <= 2.0:
		tmp = x + y
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(-Float64(y * z))
	tmp = 0.0
	if (Float64(1.0 - z) <= -1e+237)
		tmp = Float64(-Float64(x * z));
	elseif (Float64(1.0 - z) <= -2e+20)
		tmp = t_0;
	elseif (Float64(1.0 - z) <= 2.0)
		tmp = Float64(x + y);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -(y * z);
	tmp = 0.0;
	if ((1.0 - z) <= -1e+237)
		tmp = -(x * z);
	elseif ((1.0 - z) <= -2e+20)
		tmp = t_0;
	elseif ((1.0 - z) <= 2.0)
		tmp = x + y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = (-N[(y * z), $MachinePrecision])}, If[LessEqual[N[(1.0 - z), $MachinePrecision], -1e+237], (-N[(x * z), $MachinePrecision]), If[LessEqual[N[(1.0 - z), $MachinePrecision], -2e+20], t$95$0, If[LessEqual[N[(1.0 - z), $MachinePrecision], 2.0], N[(x + y), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if (-.f64 #s(literal 1 binary64) z) < -9.9999999999999994e236

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

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

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

      2. *-rgt-identity N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 46.0

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

   5. Simplified 46.0%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. neg-lowering-neg.f64 46.0

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

   8. Simplified 46.0%

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

   if -9.9999999999999994e236 < (-.f64 #s(literal 1 binary64) z) < -2e20 or 2 < (-.f64 #s(literal 1 binary64) z)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 43.4%

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

   6. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

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

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

      5. mul-1-neg N/A

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

      6. neg-lowering-neg.f64 42.8

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

   8. Simplified 42.8%

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

   if -2e20 < (-.f64 #s(literal 1 binary64) z) < 2

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 98.8

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

   5. Simplified 98.8%

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

4. Final simplification 69.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;1 - z \leq -1 \cdot 10^{+237}:\\ \;\;\;\;-x \cdot z\\ \mathbf{elif}\;1 - z \leq -2 \cdot 10^{+20}:\\ \;\;\;\;-y \cdot z\\ \mathbf{elif}\;1 - z \leq 2:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;-y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 44.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{+66}:\\ \;\;\;\;-x \cdot z\\ \mathbf{elif}\;x + y \leq -1 \cdot 10^{-271}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ x y) -1e+66)
   (- (* x z))
   (if (<= (+ x y) -1e-271) (+ x y) (* y (- 1.0 z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x + y) <= -1e+66) {
		tmp = -(x * z);
	} else if ((x + y) <= -1e-271) {
		tmp = x + y;
	} else {
		tmp = y * (1.0 - z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x + y) <= (-1d+66)) then
        tmp = -(x * z)
    else if ((x + y) <= (-1d-271)) then
        tmp = x + y
    else
        tmp = y * (1.0d0 - z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x + y) <= -1e+66) {
		tmp = -(x * z);
	} else if ((x + y) <= -1e-271) {
		tmp = x + y;
	} else {
		tmp = y * (1.0 - z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x + y) <= -1e+66:
		tmp = -(x * z)
	elif (x + y) <= -1e-271:
		tmp = x + y
	else:
		tmp = y * (1.0 - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x + y) <= -1e+66)
		tmp = Float64(-Float64(x * z));
	elseif (Float64(x + y) <= -1e-271)
		tmp = Float64(x + y);
	else
		tmp = Float64(y * Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x + y) <= -1e+66)
		tmp = -(x * z);
	elseif ((x + y) <= -1e-271)
		tmp = x + y;
	else
		tmp = y * (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e+66], (-N[(x * z), $MachinePrecision]), If[LessEqual[N[(x + y), $MachinePrecision], -1e-271], N[(x + y), $MachinePrecision], N[(y * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.99999999999999945e65

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

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

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

      2. *-rgt-identity N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 56.8

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

   5. Simplified 56.8%

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

   6. Taylor expanded in z around inf

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

      1. associate-*r* N/A

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

      2. *-commutative N/A

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

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

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

      4. mul-1-neg N/A

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

      5. neg-lowering-neg.f64 38.1

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

   8. Simplified 38.1%

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

   if -9.99999999999999945e65 < (+.f64 x y) < -9.99999999999999963e-272

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 58.3

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

   5. Simplified 58.3%

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

   if -9.99999999999999963e-272 < (+.f64 x y)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 46.3%

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

4. Final simplification 46.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{+66}:\\ \;\;\;\;-x \cdot z\\ \mathbf{elif}\;x + y \leq -1 \cdot 10^{-271}:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 75.2% accurate, 0.6× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (- (* y z)))) (if (<= z -320.0) t_0 (if (<= z 1.0) (+ x y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = -(y * z);
	double tmp;
	if (z <= -320.0) {
		tmp = t_0;
	} else if (z <= 1.0) {
		tmp = x + y;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: t_0
    real(8) :: tmp
    t_0 = -(y * z)
    if (z <= (-320.0d0)) then
        tmp = t_0
    else if (z <= 1.0d0) then
        tmp = x + y
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	t_0 = -(y * z)
	tmp = 0
	if z <= -320.0:
		tmp = t_0
	elif z <= 1.0:
		tmp = x + y
	else:
		tmp = t_0
	return tmp

Julia

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

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = -(y * z);
	tmp = 0.0;
	if (z <= -320.0)
		tmp = t_0;
	elseif (z <= 1.0)
		tmp = x + y;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -320 or 1 < z

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 46.0%

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

   6. Taylor expanded in z around inf

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

      1. mul-1-neg N/A

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

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

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

      3. mul-1-neg N/A

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

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

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

      5. mul-1-neg N/A

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

      6. neg-lowering-neg.f64 45.5

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

   8. Simplified 45.5%

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

   if -320 < z < 1

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 98.8

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

   5. Simplified 98.8%

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

4. Final simplification 70.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -320:\\ \;\;\;\;-y \cdot z\\ \mathbf{elif}\;z \leq 1:\\ \;\;\;\;x + y\\ \mathbf{else}:\\ \;\;\;\;-y \cdot z\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 52.4% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x + y \leq -5 \cdot 10^{-283}:\\ \;\;\;\;x - x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ x y) -5e-283) (- x (* x z)) (* y (- 1.0 z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x + y) <= -5e-283) {
		tmp = x - (x * z);
	} else {
		tmp = y * (1.0 - z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x + y) <= (-5d-283)) then
        tmp = x - (x * z)
    else
        tmp = y * (1.0d0 - z)
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x + y) <= -5e-283:
		tmp = x - (x * z)
	else:
		tmp = y * (1.0 - z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x + y) <= -5e-283)
		tmp = Float64(x - Float64(x * z));
	else
		tmp = Float64(y * Float64(1.0 - z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x + y) <= -5e-283)
		tmp = x - (x * z);
	else
		tmp = y * (1.0 - z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[N[(x + y), $MachinePrecision], -5e-283], N[(x - N[(x * z), $MachinePrecision]), $MachinePrecision], N[(y * N[(1.0 - z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

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

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

      2. *-rgt-identity N/A

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

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

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

      4. *-commutative N/A

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

      5. *-lowering-*.f64 53.8

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

   5. Simplified 53.8%

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

   if -5.0000000000000001e-283 < (+.f64 x y)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

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

   5. Simplified 45.9%

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

4. Final simplification 49.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -5 \cdot 10^{-283}:\\ \;\;\;\;x - x \cdot z\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(1 - z\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 26.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(1 - z\right) \cdot \left(x + y\right) \leq -1 \cdot 10^{-271}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (* (- 1.0 z) (+ x y)) -1e-271) x y))

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (((1.0d0 - z) * (x + y)) <= (-1d-271)) then
        tmp = x
    else
        tmp = y
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if ((1.0 - z) * (x + y)) <= -1e-271:
		tmp = x
	else:
		tmp = y
	return tmp

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (*.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) z)) < -9.99999999999999963e-272

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 44.1

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

   5. Simplified 44.1%

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

   6. Taylor expanded in y around 0

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

   8. Simplified 21.6%

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

   if -9.99999999999999963e-272 < (*.f64 (+.f64 x y) (-.f64 #s(literal 1 binary64) z))

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(1 - z\right) \]
   2. Add Preprocessing

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. +-lowering-+.f64 51.6

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

   5. Simplified 51.6%

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

   6. Taylor expanded in y around inf

      \[\leadsto \color{blue}{y} \]
   7. Step-by-step derivation

   8. Simplified 25.5%

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

4. Final simplification 23.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\left(1 - z\right) \cdot \left(x + y\right) \leq -1 \cdot 10^{-271}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 50.7% accurate, 3.0× speedup

Math

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

FPCore

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

C

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

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    code = x + y
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(x + y), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(1 - z\right) \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. +-lowering-+.f64 48.3

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

5. Simplified 48.3%

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

6. Final simplification 48.3%

   \[\leadsto x + y \]
7. Add Preprocessing

Alternative 8: 26.3% accurate, 12.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 100.0%

   \[\left(x + y\right) \cdot \left(1 - z\right) \]
2. Add Preprocessing

3. Taylor expanded in z around 0

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

   1. +-commutative N/A

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

   2. +-lowering-+.f64 48.3

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

5. Simplified 48.3%

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

6. Taylor expanded in y around 0

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

8. Simplified 25.8%

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

Reproduce

herbie shell --seed 2024199 
(FPCore (x y z)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, H"
  :precision binary64
  (* (+ x y) (- 1.0 z)))