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

Percentage Accurate: 100.0% → 100.0%

Time: 7.0s

Alternatives: 8

Speedup: 1.0×

• 20.5% 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(z + 1\right) \end{array} \]

FPCore

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

C

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

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) * (z + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

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) * (z + 1.0d0)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return (z + 1.0) * (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 = (z + 1.0d0) * (x + y)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

3. Final simplification 100.0%

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

Alternative 2: 74.5% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z + 1 \leq -5:\\ \;\;\;\;x \cdot z\\ \mathbf{elif}\;z + 1 \leq 2:\\ \;\;\;\;x + y\\ \mathbf{elif}\;z + 1 \leq 2 \cdot 10^{+111}:\\ \;\;\;\;y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ z 1.0) -5.0)
   (* x z)
   (if (<= (+ z 1.0) 2.0) (+ x y) (if (<= (+ z 1.0) 2e+111) (* y z) (* x z)))))

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 z #s(literal 1 binary64)) < -5 or 1.99999999999999991e111 < (+.f64 z #s(literal 1 binary64))

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. accelerator-lowering-fma.f64 51.3

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

   5. Simplified 51.3%

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

   6. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 50.9

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

   8. Simplified 50.9%

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

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

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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.0

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

   5. Simplified 98.0%

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

   if 2 < (+.f64 z #s(literal 1 binary64)) < 1.99999999999999991e111

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{y \cdot z + y \cdot 1} \]

      3. *-rgt-identity N/A

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

      4. accelerator-lowering-fma.f64 51.5

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

   5. Simplified 51.5%

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

   6. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 49.9

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

   8. Simplified 49.9%

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

4. Final simplification 73.2%

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

Alternative 3: 41.5% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ x y) -1e+258)
   (+ x y)
   (if (<= (+ x y) -2e-245) (* x z) (fma y z y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x + y) <= -1e+258) {
		tmp = x + y;
	} else if ((x + y) <= -2e-245) {
		tmp = x * z;
	} else {
		tmp = fma(y, z, y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (Float64(x + y) <= -1e+258)
		tmp = Float64(x + y);
	elseif (Float64(x + y) <= -2e-245)
		tmp = Float64(x * z);
	else
		tmp = fma(y, z, y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -1.00000000000000006e258

   1. Initial program 99.9%

      \[\left(x + y\right) \cdot \left(z + 1\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 71.9

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

   5. Simplified 71.9%

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

   if -1.00000000000000006e258 < (+.f64 x y) < -1.9999999999999999e-245

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. accelerator-lowering-fma.f64 44.5

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

   5. Simplified 44.5%

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

   6. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 25.7

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

   8. Simplified 25.7%

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

   if -1.9999999999999999e-245 < (+.f64 x y)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{y \cdot z + y \cdot 1} \]

      3. *-rgt-identity N/A

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

      4. accelerator-lowering-fma.f64 54.2

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

   5. Simplified 54.2%

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

4. Final simplification 45.3%

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

Alternative 4: 75.1% accurate, 0.5× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= (+ z 1.0) -5.0) (* x z) (if (<= (+ z 1.0) 1000.0) (+ x y) (* x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z + 1.0) <= -5.0) {
		tmp = x * z;
	} else if ((z + 1.0) <= 1000.0) {
		tmp = x + y;
	} else {
		tmp = x * 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 ((z + 1.0d0) <= (-5.0d0)) then
        tmp = x * z
    else if ((z + 1.0d0) <= 1000.0d0) then
        tmp = x + y
    else
        tmp = x * z
    end if
    code = tmp
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 z #s(literal 1 binary64)) < -5 or 1e3 < (+.f64 z #s(literal 1 binary64))

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. accelerator-lowering-fma.f64 50.8

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

   5. Simplified 50.8%

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

   6. Taylor expanded in z around inf

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

      1. *-lowering-*.f64 49.9

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

   8. Simplified 49.9%

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

   if -5 < (+.f64 z #s(literal 1 binary64)) < 1e3

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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 97.3

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

   5. Simplified 97.3%

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

4. Final simplification 72.7%

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

Alternative 5: 26.4% accurate, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	double tmp;
	if (((z + 1.0) * (x + y)) <= -1e-196) {
		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 (((z + 1.0d0) * (x + y)) <= (-1d-196)) 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 (((z + 1.0) * (x + y)) <= -1e-196) {
		tmp = x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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 46.2

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

   5. Simplified 46.2%

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

   6. Taylor expanded in y around 0

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

   8. Simplified 23.3%

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

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

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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.1

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

   5. Simplified 51.1%

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

   6. Taylor expanded in y around inf

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

   8. Simplified 30.7%

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

4. Final simplification 27.2%

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

Alternative 6: 51.9% accurate, 0.7× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

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

   1. Initial program 99.9%

      \[\left(x + y\right) \cdot \left(z + 1\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. +-commutative N/A

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

      2. distribute-rgt-in N/A

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

      3. *-lft-identity N/A

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

      4. accelerator-lowering-fma.f64 45.9

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

   5. Simplified 45.9%

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

   if -1.9999999999999999e-245 < (+.f64 x y)

   1. Initial program 100.0%

      \[\left(x + y\right) \cdot \left(z + 1\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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

         \[\leadsto \color{blue}{y \cdot z + y \cdot 1} \]

      3. *-rgt-identity N/A

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

      4. accelerator-lowering-fma.f64 54.2

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

   5. Simplified 54.2%

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

Alternative 7: 51.5% 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(z + 1\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.8

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

5. Simplified 48.8%

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

6. Final simplification 48.8%

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

Alternative 8: 26.4% 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(z + 1\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.8

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

5. Simplified 48.8%

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

6. Taylor expanded in y around 0

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

8. Simplified 21.8%

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

Reproduce

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