Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4

Percentage Accurate: 99.9% → 100.0%

Time: 6.5s

Alternatives: 11

Speedup: 1.2×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (- z (fma x -3.0 (* y -2.0))))

C

double code(double x, double y, double z) {
	return z - fma(x, -3.0, (y * -2.0));
}

Julia

function code(x, y, z)
	return Float64(z - fma(x, -3.0, Float64(y * -2.0)))
end

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
2. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. associate-+l+ 99.9%

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

   3. remove-double-neg 99.9%

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

   4. unsub-neg 99.9%

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

   5. +-commutative 99.9%

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

   6. +-commutative 99.9%

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

   7. associate-+l+ 99.9%

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

   8. associate-+r+ 99.9%

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

   9. associate-+r+ 99.9%

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

   10. distribute-neg-in 99.9%

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

   11. distribute-neg-out 99.9%

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

   12. distribute-neg-out 99.9%

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

   13. neg-mul-1 99.9%

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

   14. count-2 99.9%

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

   15. distribute-lft-neg-in 99.9%

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

   16. metadata-eval 99.9%

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

   17. metadata-eval 99.9%

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

   18. distribute-rgt-out 99.9%

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

   19. fma-def 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
4. Add Preprocessing

5. Final simplification 100.0%

   \[\leadsto z - \mathsf{fma}\left(x, -3, y \cdot -2\right) \]
6. Add Preprocessing

Alternative 2: 50.8% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.7 \cdot 10^{+19}:\\ \;\;\;\;y \cdot 2\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{-247}:\\ \;\;\;\;x \cdot 3\\ \mathbf{elif}\;y \leq 1.45 \cdot 10^{-210}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-59}:\\ \;\;\;\;x \cdot 3\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-9}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+149}:\\ \;\;\;\;x \cdot 3\\ \mathbf{else}:\\ \;\;\;\;y \cdot 2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.7e+19)
   (* y 2.0)
   (if (<= y 5.2e-247)
     (* x 3.0)
     (if (<= y 1.45e-210)
       z
       (if (<= y 8.5e-59)
         (* x 3.0)
         (if (<= y 1.2e-9) z (if (<= y 3.8e+149) (* x 3.0) (* y 2.0))))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.7e+19) {
		tmp = y * 2.0;
	} else if (y <= 5.2e-247) {
		tmp = x * 3.0;
	} else if (y <= 1.45e-210) {
		tmp = z;
	} else if (y <= 8.5e-59) {
		tmp = x * 3.0;
	} else if (y <= 1.2e-9) {
		tmp = z;
	} else if (y <= 3.8e+149) {
		tmp = x * 3.0;
	} else {
		tmp = y * 2.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) :: tmp
    if (y <= (-1.7d+19)) then
        tmp = y * 2.0d0
    else if (y <= 5.2d-247) then
        tmp = x * 3.0d0
    else if (y <= 1.45d-210) then
        tmp = z
    else if (y <= 8.5d-59) then
        tmp = x * 3.0d0
    else if (y <= 1.2d-9) then
        tmp = z
    else if (y <= 3.8d+149) then
        tmp = x * 3.0d0
    else
        tmp = y * 2.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.7e+19) {
		tmp = y * 2.0;
	} else if (y <= 5.2e-247) {
		tmp = x * 3.0;
	} else if (y <= 1.45e-210) {
		tmp = z;
	} else if (y <= 8.5e-59) {
		tmp = x * 3.0;
	} else if (y <= 1.2e-9) {
		tmp = z;
	} else if (y <= 3.8e+149) {
		tmp = x * 3.0;
	} else {
		tmp = y * 2.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.7e+19:
		tmp = y * 2.0
	elif y <= 5.2e-247:
		tmp = x * 3.0
	elif y <= 1.45e-210:
		tmp = z
	elif y <= 8.5e-59:
		tmp = x * 3.0
	elif y <= 1.2e-9:
		tmp = z
	elif y <= 3.8e+149:
		tmp = x * 3.0
	else:
		tmp = y * 2.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.7e+19)
		tmp = Float64(y * 2.0);
	elseif (y <= 5.2e-247)
		tmp = Float64(x * 3.0);
	elseif (y <= 1.45e-210)
		tmp = z;
	elseif (y <= 8.5e-59)
		tmp = Float64(x * 3.0);
	elseif (y <= 1.2e-9)
		tmp = z;
	elseif (y <= 3.8e+149)
		tmp = Float64(x * 3.0);
	else
		tmp = Float64(y * 2.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.7e+19)
		tmp = y * 2.0;
	elseif (y <= 5.2e-247)
		tmp = x * 3.0;
	elseif (y <= 1.45e-210)
		tmp = z;
	elseif (y <= 8.5e-59)
		tmp = x * 3.0;
	elseif (y <= 1.2e-9)
		tmp = z;
	elseif (y <= 3.8e+149)
		tmp = x * 3.0;
	else
		tmp = y * 2.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.7e+19], N[(y * 2.0), $MachinePrecision], If[LessEqual[y, 5.2e-247], N[(x * 3.0), $MachinePrecision], If[LessEqual[y, 1.45e-210], z, If[LessEqual[y, 8.5e-59], N[(x * 3.0), $MachinePrecision], If[LessEqual[y, 1.2e-9], z, If[LessEqual[y, 3.8e+149], N[(x * 3.0), $MachinePrecision], N[(y * 2.0), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.7e19 or 3.8000000000000001e149 < y

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 70.8%

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

   if -1.7e19 < y < 5.2e-247 or 1.45000000000000003e-210 < y < 8.49999999999999933e-59 or 1.2e-9 < y < 3.8000000000000001e149

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.8%

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

      2. associate-+l+ 99.8%

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

      3. +-commutative 99.8%

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

      4. count-2 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 58.4%

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

   if 5.2e-247 < y < 1.45000000000000003e-210 or 8.49999999999999933e-59 < y < 1.2e-9

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 79.9%

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

4. Final simplification 64.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.7 \cdot 10^{+19}:\\ \;\;\;\;y \cdot 2\\ \mathbf{elif}\;y \leq 5.2 \cdot 10^{-247}:\\ \;\;\;\;x \cdot 3\\ \mathbf{elif}\;y \leq 1.45 \cdot 10^{-210}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 8.5 \cdot 10^{-59}:\\ \;\;\;\;x \cdot 3\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-9}:\\ \;\;\;\;z\\ \mathbf{elif}\;y \leq 3.8 \cdot 10^{+149}:\\ \;\;\;\;x \cdot 3\\ \mathbf{else}:\\ \;\;\;\;y \cdot 2\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 81.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + 2 \cdot \left(x + y\right)\\ \mathbf{if}\;y \leq -1.15 \cdot 10^{-66}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{-8}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{+41}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+149}:\\ \;\;\;\;x + \left(z + x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (* 2.0 (+ x y)))))
   (if (<= y -1.15e-66)
     t_0
     (if (<= y 6.5e-8)
       (- z (* x -3.0))
       (if (<= y 6.5e+41)
         t_0
         (if (<= y 3.5e+149) (+ x (+ z (* x 2.0))) (- z (* y -2.0))))))))

C

double code(double x, double y, double z) {
	double t_0 = x + (2.0 * (x + y));
	double tmp;
	if (y <= -1.15e-66) {
		tmp = t_0;
	} else if (y <= 6.5e-8) {
		tmp = z - (x * -3.0);
	} else if (y <= 6.5e+41) {
		tmp = t_0;
	} else if (y <= 3.5e+149) {
		tmp = x + (z + (x * 2.0));
	} else {
		tmp = z - (y * -2.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 = x + (2.0d0 * (x + y))
    if (y <= (-1.15d-66)) then
        tmp = t_0
    else if (y <= 6.5d-8) then
        tmp = z - (x * (-3.0d0))
    else if (y <= 6.5d+41) then
        tmp = t_0
    else if (y <= 3.5d+149) then
        tmp = x + (z + (x * 2.0d0))
    else
        tmp = z - (y * (-2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x + (2.0 * (x + y));
	double tmp;
	if (y <= -1.15e-66) {
		tmp = t_0;
	} else if (y <= 6.5e-8) {
		tmp = z - (x * -3.0);
	} else if (y <= 6.5e+41) {
		tmp = t_0;
	} else if (y <= 3.5e+149) {
		tmp = x + (z + (x * 2.0));
	} else {
		tmp = z - (y * -2.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x + (2.0 * (x + y))
	tmp = 0
	if y <= -1.15e-66:
		tmp = t_0
	elif y <= 6.5e-8:
		tmp = z - (x * -3.0)
	elif y <= 6.5e+41:
		tmp = t_0
	elif y <= 3.5e+149:
		tmp = x + (z + (x * 2.0))
	else:
		tmp = z - (y * -2.0)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(2.0 * Float64(x + y)))
	tmp = 0.0
	if (y <= -1.15e-66)
		tmp = t_0;
	elseif (y <= 6.5e-8)
		tmp = Float64(z - Float64(x * -3.0));
	elseif (y <= 6.5e+41)
		tmp = t_0;
	elseif (y <= 3.5e+149)
		tmp = Float64(x + Float64(z + Float64(x * 2.0)));
	else
		tmp = Float64(z - Float64(y * -2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (2.0 * (x + y));
	tmp = 0.0;
	if (y <= -1.15e-66)
		tmp = t_0;
	elseif (y <= 6.5e-8)
		tmp = z - (x * -3.0);
	elseif (y <= 6.5e+41)
		tmp = t_0;
	elseif (y <= 3.5e+149)
		tmp = x + (z + (x * 2.0));
	else
		tmp = z - (y * -2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(2.0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.15e-66], t$95$0, If[LessEqual[y, 6.5e-8], N[(z - N[(x * -3.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 6.5e+41], t$95$0, If[LessEqual[y, 3.5e+149], N[(x + N[(z + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z - N[(y * -2.0), $MachinePrecision]), $MachinePrecision]]]]]]

Derivation

1. Split input into 4 regimes

2. if y < -1.14999999999999996e-66 or 6.49999999999999997e-8 < y < 6.49999999999999975e41

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 90.0%

      \[\leadsto \color{blue}{x + 2 \cdot \left(x + y\right)} \]

   if -1.14999999999999996e-66 < y < 6.49999999999999997e-8

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-+l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. unsub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-+r+ 99.8%

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

      9. associate-+r+ 99.8%

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

      10. distribute-neg-in 99.8%

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

      11. distribute-neg-out 99.8%

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

      12. distribute-neg-out 99.8%

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

      13. neg-mul-1 99.8%

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

      14. count-2 99.8%

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

      15. distribute-lft-neg-in 99.8%

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

      16. metadata-eval 99.8%

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

      17. metadata-eval 99.8%

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

      18. distribute-rgt-out 99.8%

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

      19. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 96.3%

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

   if 6.49999999999999975e41 < y < 3.50000000000000011e149

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 76.1%

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

   if 3.50000000000000011e149 < y

   1. Initial program 100.0%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. associate-+l+ 100.0%

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

      3. remove-double-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. +-commutative 100.0%

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

      7. associate-+l+ 100.0%

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

      8. associate-+r+ 100.0%

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

      9. associate-+r+ 100.0%

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

      10. distribute-neg-in 100.0%

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

      11. distribute-neg-out 100.0%

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

      12. distribute-neg-out 100.0%

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

      13. neg-mul-1 100.0%

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

      14. count-2 100.0%

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

      15. distribute-lft-neg-in 100.0%

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

      16. metadata-eval 100.0%

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

      17. metadata-eval 100.0%

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

      18. distribute-rgt-out 100.0%

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

      19. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 91.2%

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

4. Final simplification 91.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.15 \cdot 10^{-66}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{-8}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{elif}\;y \leq 6.5 \cdot 10^{+41}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 3.5 \cdot 10^{+149}:\\ \;\;\;\;x + \left(z + x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.9% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.82 \cdot 10^{-66}:\\ \;\;\;\;x \cdot 3 - y \cdot -2\\ \mathbf{elif}\;y \leq 1.6 \cdot 10^{-9}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+41}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+149}:\\ \;\;\;\;x + \left(z + x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.82e-66)
   (- (* x 3.0) (* y -2.0))
   (if (<= y 1.6e-9)
     (- z (* x -3.0))
     (if (<= y 2.4e+41)
       (+ x (* 2.0 (+ x y)))
       (if (<= y 1.55e+149) (+ x (+ z (* x 2.0))) (- z (* y -2.0)))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.82e-66) {
		tmp = (x * 3.0) - (y * -2.0);
	} else if (y <= 1.6e-9) {
		tmp = z - (x * -3.0);
	} else if (y <= 2.4e+41) {
		tmp = x + (2.0 * (x + y));
	} else if (y <= 1.55e+149) {
		tmp = x + (z + (x * 2.0));
	} else {
		tmp = z - (y * -2.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) :: tmp
    if (y <= (-1.82d-66)) then
        tmp = (x * 3.0d0) - (y * (-2.0d0))
    else if (y <= 1.6d-9) then
        tmp = z - (x * (-3.0d0))
    else if (y <= 2.4d+41) then
        tmp = x + (2.0d0 * (x + y))
    else if (y <= 1.55d+149) then
        tmp = x + (z + (x * 2.0d0))
    else
        tmp = z - (y * (-2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.82e-66) {
		tmp = (x * 3.0) - (y * -2.0);
	} else if (y <= 1.6e-9) {
		tmp = z - (x * -3.0);
	} else if (y <= 2.4e+41) {
		tmp = x + (2.0 * (x + y));
	} else if (y <= 1.55e+149) {
		tmp = x + (z + (x * 2.0));
	} else {
		tmp = z - (y * -2.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -1.82e-66:
		tmp = (x * 3.0) - (y * -2.0)
	elif y <= 1.6e-9:
		tmp = z - (x * -3.0)
	elif y <= 2.4e+41:
		tmp = x + (2.0 * (x + y))
	elif y <= 1.55e+149:
		tmp = x + (z + (x * 2.0))
	else:
		tmp = z - (y * -2.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.82e-66)
		tmp = Float64(Float64(x * 3.0) - Float64(y * -2.0));
	elseif (y <= 1.6e-9)
		tmp = Float64(z - Float64(x * -3.0));
	elseif (y <= 2.4e+41)
		tmp = Float64(x + Float64(2.0 * Float64(x + y)));
	elseif (y <= 1.55e+149)
		tmp = Float64(x + Float64(z + Float64(x * 2.0)));
	else
		tmp = Float64(z - Float64(y * -2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -1.82e-66)
		tmp = (x * 3.0) - (y * -2.0);
	elseif (y <= 1.6e-9)
		tmp = z - (x * -3.0);
	elseif (y <= 2.4e+41)
		tmp = x + (2.0 * (x + y));
	elseif (y <= 1.55e+149)
		tmp = x + (z + (x * 2.0));
	else
		tmp = z - (y * -2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -1.82e-66], N[(N[(x * 3.0), $MachinePrecision] - N[(y * -2.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.6e-9], N[(z - N[(x * -3.0), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 2.4e+41], N[(x + N[(2.0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[y, 1.55e+149], N[(x + N[(z + N[(x * 2.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z - N[(y * -2.0), $MachinePrecision]), $MachinePrecision]]]]]

Derivation

1. Split input into 5 regimes

2. if y < -1.8199999999999999e-66

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate-+l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. unsub-neg 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

      7. associate-+l+ 99.9%

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

      8. associate-+r+ 99.9%

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

      9. associate-+r+ 99.9%

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

      10. distribute-neg-in 99.9%

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

      11. distribute-neg-out 99.9%

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

      12. distribute-neg-out 99.9%

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

      13. neg-mul-1 99.9%

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

      14. count-2 99.9%

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

      15. distribute-lft-neg-in 99.9%

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

      16. metadata-eval 99.9%

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

      17. metadata-eval 99.9%

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

      18. distribute-rgt-out 99.9%

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

      19. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.9%

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

   6. Taylor expanded in z around 0 90.5%

      \[\leadsto \color{blue}{3 \cdot x} - -2 \cdot y \]

   if -1.8199999999999999e-66 < y < 1.60000000000000006e-9

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-+l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. unsub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-+r+ 99.8%

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

      9. associate-+r+ 99.8%

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

      10. distribute-neg-in 99.8%

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

      11. distribute-neg-out 99.8%

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

      12. distribute-neg-out 99.8%

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

      13. neg-mul-1 99.8%

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

      14. count-2 99.8%

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

      15. distribute-lft-neg-in 99.8%

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

      16. metadata-eval 99.8%

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

      17. metadata-eval 99.8%

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

      18. distribute-rgt-out 99.8%

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

      19. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 96.3%

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

   if 1.60000000000000006e-9 < y < 2.4000000000000002e41

   1. Initial program 99.7%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.7%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 86.9%

      \[\leadsto \color{blue}{x + 2 \cdot \left(x + y\right)} \]

   if 2.4000000000000002e41 < y < 1.54999999999999993e149

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 76.1%

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

   if 1.54999999999999993e149 < y

   1. Initial program 100.0%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. associate-+l+ 100.0%

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

      3. remove-double-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. +-commutative 100.0%

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

      7. associate-+l+ 100.0%

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

      8. associate-+r+ 100.0%

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

      9. associate-+r+ 100.0%

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

      10. distribute-neg-in 100.0%

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

      11. distribute-neg-out 100.0%

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

      12. distribute-neg-out 100.0%

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

      13. neg-mul-1 100.0%

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

      14. count-2 100.0%

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

      15. distribute-lft-neg-in 100.0%

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

      16. metadata-eval 100.0%

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

      17. metadata-eval 100.0%

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

      18. distribute-rgt-out 100.0%

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

      19. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 91.2%

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

4. Final simplification 91.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.82 \cdot 10^{-66}:\\ \;\;\;\;x \cdot 3 - y \cdot -2\\ \mathbf{elif}\;y \leq 1.6 \cdot 10^{-9}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{elif}\;y \leq 2.4 \cdot 10^{+41}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 1.55 \cdot 10^{+149}:\\ \;\;\;\;x + \left(z + x \cdot 2\right)\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 82.0% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + 2 \cdot \left(x + y\right)\\ t_1 := z - x \cdot -3\\ \mathbf{if}\;y \leq -9 \cdot 10^{-66}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{-7}:\\ \;\;\;\;t_1\\ \mathbf{elif}\;y \leq 2.05 \cdot 10^{+41}:\\ \;\;\;\;t_0\\ \mathbf{elif}\;y \leq 1.85 \cdot 10^{+149}:\\ \;\;\;\;t_1\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (* 2.0 (+ x y)))) (t_1 (- z (* x -3.0))))
   (if (<= y -9e-66)
     t_0
     (if (<= y 5.5e-7)
       t_1
       (if (<= y 2.05e+41) t_0 (if (<= y 1.85e+149) t_1 (- z (* y -2.0))))))))

C

double code(double x, double y, double z) {
	double t_0 = x + (2.0 * (x + y));
	double t_1 = z - (x * -3.0);
	double tmp;
	if (y <= -9e-66) {
		tmp = t_0;
	} else if (y <= 5.5e-7) {
		tmp = t_1;
	} else if (y <= 2.05e+41) {
		tmp = t_0;
	} else if (y <= 1.85e+149) {
		tmp = t_1;
	} else {
		tmp = z - (y * -2.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) :: t_1
    real(8) :: tmp
    t_0 = x + (2.0d0 * (x + y))
    t_1 = z - (x * (-3.0d0))
    if (y <= (-9d-66)) then
        tmp = t_0
    else if (y <= 5.5d-7) then
        tmp = t_1
    else if (y <= 2.05d+41) then
        tmp = t_0
    else if (y <= 1.85d+149) then
        tmp = t_1
    else
        tmp = z - (y * (-2.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = x + (2.0 * (x + y));
	double t_1 = z - (x * -3.0);
	double tmp;
	if (y <= -9e-66) {
		tmp = t_0;
	} else if (y <= 5.5e-7) {
		tmp = t_1;
	} else if (y <= 2.05e+41) {
		tmp = t_0;
	} else if (y <= 1.85e+149) {
		tmp = t_1;
	} else {
		tmp = z - (y * -2.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = x + (2.0 * (x + y))
	t_1 = z - (x * -3.0)
	tmp = 0
	if y <= -9e-66:
		tmp = t_0
	elif y <= 5.5e-7:
		tmp = t_1
	elif y <= 2.05e+41:
		tmp = t_0
	elif y <= 1.85e+149:
		tmp = t_1
	else:
		tmp = z - (y * -2.0)
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(x + Float64(2.0 * Float64(x + y)))
	t_1 = Float64(z - Float64(x * -3.0))
	tmp = 0.0
	if (y <= -9e-66)
		tmp = t_0;
	elseif (y <= 5.5e-7)
		tmp = t_1;
	elseif (y <= 2.05e+41)
		tmp = t_0;
	elseif (y <= 1.85e+149)
		tmp = t_1;
	else
		tmp = Float64(z - Float64(y * -2.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = x + (2.0 * (x + y));
	t_1 = z - (x * -3.0);
	tmp = 0.0;
	if (y <= -9e-66)
		tmp = t_0;
	elseif (y <= 5.5e-7)
		tmp = t_1;
	elseif (y <= 2.05e+41)
		tmp = t_0;
	elseif (y <= 1.85e+149)
		tmp = t_1;
	else
		tmp = z - (y * -2.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[(2.0 * N[(x + y), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(z - N[(x * -3.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -9e-66], t$95$0, If[LessEqual[y, 5.5e-7], t$95$1, If[LessEqual[y, 2.05e+41], t$95$0, If[LessEqual[y, 1.85e+149], t$95$1, N[(z - N[(y * -2.0), $MachinePrecision]), $MachinePrecision]]]]]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.9999999999999995e-66 or 5.5000000000000003e-7 < y < 2.0500000000000002e41

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 90.0%

      \[\leadsto \color{blue}{x + 2 \cdot \left(x + y\right)} \]

   if -8.9999999999999995e-66 < y < 5.5000000000000003e-7 or 2.0500000000000002e41 < y < 1.84999999999999989e149

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-+l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. unsub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-+r+ 99.8%

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

      9. associate-+r+ 99.8%

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

      10. distribute-neg-in 99.8%

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

      11. distribute-neg-out 99.8%

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

      12. distribute-neg-out 99.8%

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

      13. neg-mul-1 99.8%

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

      14. count-2 99.8%

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

      15. distribute-lft-neg-in 99.8%

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

      16. metadata-eval 99.8%

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

      17. metadata-eval 99.8%

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

      18. distribute-rgt-out 99.8%

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

      19. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 92.8%

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

   if 1.84999999999999989e149 < y

   1. Initial program 100.0%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 100.0%

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

      2. associate-+l+ 100.0%

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

      3. remove-double-neg 100.0%

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

      4. unsub-neg 100.0%

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

      5. +-commutative 100.0%

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

      6. +-commutative 100.0%

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

      7. associate-+l+ 100.0%

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

      8. associate-+r+ 100.0%

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

      9. associate-+r+ 100.0%

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

      10. distribute-neg-in 100.0%

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

      11. distribute-neg-out 100.0%

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

      12. distribute-neg-out 100.0%

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

      13. neg-mul-1 100.0%

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

      14. count-2 100.0%

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

      15. distribute-lft-neg-in 100.0%

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

      16. metadata-eval 100.0%

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

      17. metadata-eval 100.0%

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

      18. distribute-rgt-out 100.0%

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

      19. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 91.2%

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

4. Final simplification 91.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -9 \cdot 10^{-66}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 5.5 \cdot 10^{-7}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{elif}\;y \leq 2.05 \cdot 10^{+41}:\\ \;\;\;\;x + 2 \cdot \left(x + y\right)\\ \mathbf{elif}\;y \leq 1.85 \cdot 10^{+149}:\\ \;\;\;\;z - x \cdot -3\\ \mathbf{else}:\\ \;\;\;\;z - y \cdot -2\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 79.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+146} \lor \neg \left(y \leq 2.05 \cdot 10^{+164}\right):\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z - x \cdot -3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -7e+146) (not (<= y 2.05e+164))) (* y 2.0) (- z (* x -3.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7e+146) || !(y <= 2.05e+164)) {
		tmp = y * 2.0;
	} else {
		tmp = z - (x * -3.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) :: tmp
    if ((y <= (-7d+146)) .or. (.not. (y <= 2.05d+164))) then
        tmp = y * 2.0d0
    else
        tmp = z - (x * (-3.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7e+146) || !(y <= 2.05e+164)) {
		tmp = y * 2.0;
	} else {
		tmp = z - (x * -3.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -7e+146) or not (y <= 2.05e+164):
		tmp = y * 2.0
	else:
		tmp = z - (x * -3.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -7e+146) || !(y <= 2.05e+164))
		tmp = Float64(y * 2.0);
	else
		tmp = Float64(z - Float64(x * -3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -7e+146) || ~((y <= 2.05e+164)))
		tmp = y * 2.0;
	else
		tmp = z - (x * -3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -7e+146], N[Not[LessEqual[y, 2.05e+164]], $MachinePrecision]], N[(y * 2.0), $MachinePrecision], N[(z - N[(x * -3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.0000000000000002e146 or 2.05000000000000008e164 < y

   1. Initial program 100.0%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 100.0%

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

      2. associate-+l+ 100.0%

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

      3. +-commutative 100.0%

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

      4. count-2 100.0%

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

      5. +-commutative 100.0%

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

      6. +-commutative 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 83.9%

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

   if -7.0000000000000002e146 < y < 2.05000000000000008e164

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-+l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. unsub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-+r+ 99.8%

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

      9. associate-+r+ 99.8%

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

      10. distribute-neg-in 99.8%

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

      11. distribute-neg-out 99.8%

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

      12. distribute-neg-out 99.8%

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

      13. neg-mul-1 99.8%

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

      14. count-2 99.8%

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

      15. distribute-lft-neg-in 99.8%

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

      16. metadata-eval 99.8%

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

      17. metadata-eval 99.8%

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

      18. distribute-rgt-out 99.8%

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

      19. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 86.1%

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

4. Final simplification 85.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -7 \cdot 10^{+146} \lor \neg \left(y \leq 2.05 \cdot 10^{+164}\right):\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z - x \cdot -3\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 84.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{+19} \lor \neg \left(y \leq 1.55 \cdot 10^{+149}\right):\\ \;\;\;\;z - y \cdot -2\\ \mathbf{else}:\\ \;\;\;\;z - x \cdot -3\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.2e+19) (not (<= y 1.55e+149)))
   (- z (* y -2.0))
   (- z (* x -3.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.2e+19) || !(y <= 1.55e+149)) {
		tmp = z - (y * -2.0);
	} else {
		tmp = z - (x * -3.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) :: tmp
    if ((y <= (-2.2d+19)) .or. (.not. (y <= 1.55d+149))) then
        tmp = z - (y * (-2.0d0))
    else
        tmp = z - (x * (-3.0d0))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.2e+19) || !(y <= 1.55e+149)) {
		tmp = z - (y * -2.0);
	} else {
		tmp = z - (x * -3.0);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.2e+19) or not (y <= 1.55e+149):
		tmp = z - (y * -2.0)
	else:
		tmp = z - (x * -3.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.2e+19) || !(y <= 1.55e+149))
		tmp = Float64(z - Float64(y * -2.0));
	else
		tmp = Float64(z - Float64(x * -3.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.2e+19) || ~((y <= 1.55e+149)))
		tmp = z - (y * -2.0);
	else
		tmp = z - (x * -3.0);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.2e+19], N[Not[LessEqual[y, 1.55e+149]], $MachinePrecision]], N[(z - N[(y * -2.0), $MachinePrecision]), $MachinePrecision], N[(z - N[(x * -3.0), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.2e19 or 1.54999999999999993e149 < y

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.9%

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

      2. associate-+l+ 99.9%

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

      3. remove-double-neg 99.9%

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

      4. unsub-neg 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

      7. associate-+l+ 99.9%

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

      8. associate-+r+ 99.9%

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

      9. associate-+r+ 100.0%

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

      10. distribute-neg-in 100.0%

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

      11. distribute-neg-out 100.0%

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

      12. distribute-neg-out 100.0%

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

      13. neg-mul-1 100.0%

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

      14. count-2 100.0%

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

      15. distribute-lft-neg-in 100.0%

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

      16. metadata-eval 100.0%

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

      17. metadata-eval 100.0%

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

      18. distribute-rgt-out 100.0%

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

      19. fma-def 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 84.7%

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

   if -2.2e19 < y < 1.54999999999999993e149

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. +-commutative 99.8%

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

      2. associate-+l+ 99.8%

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

      3. remove-double-neg 99.8%

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

      4. unsub-neg 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

      7. associate-+l+ 99.8%

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

      8. associate-+r+ 99.8%

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

      9. associate-+r+ 99.8%

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

      10. distribute-neg-in 99.8%

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

      11. distribute-neg-out 99.8%

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

      12. distribute-neg-out 99.8%

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

      13. neg-mul-1 99.8%

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

      14. count-2 99.8%

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

      15. distribute-lft-neg-in 99.8%

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

      16. metadata-eval 99.8%

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

      17. metadata-eval 99.8%

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

      18. distribute-rgt-out 99.8%

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

      19. fma-def 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 88.8%

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

4. Final simplification 87.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.2 \cdot 10^{+19} \lor \neg \left(y \leq 1.55 \cdot 10^{+149}\right):\\ \;\;\;\;z - y \cdot -2\\ \mathbf{else}:\\ \;\;\;\;z - x \cdot -3\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 51.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-78} \lor \neg \left(y \leq 0.0092\right):\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -6e-78) (not (<= y 0.0092))) (* y 2.0) z))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-78) || !(y <= 0.0092)) {
		tmp = y * 2.0;
	} else {
		tmp = 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 ((y <= (-6d-78)) .or. (.not. (y <= 0.0092d0))) then
        tmp = y * 2.0d0
    else
        tmp = z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -6e-78) || !(y <= 0.0092)) {
		tmp = y * 2.0;
	} else {
		tmp = z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -6e-78) or not (y <= 0.0092):
		tmp = y * 2.0
	else:
		tmp = z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -6e-78) || !(y <= 0.0092))
		tmp = Float64(y * 2.0);
	else
		tmp = z;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -6e-78) || ~((y <= 0.0092)))
		tmp = y * 2.0;
	else
		tmp = z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -6e-78], N[Not[LessEqual[y, 0.0092]], $MachinePrecision]], N[(y * 2.0), $MachinePrecision], z]

Derivation

1. Split input into 2 regimes

2. if y < -5.99999999999999975e-78 or 0.0091999999999999998 < y

   1. Initial program 99.9%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.9%

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

      2. associate-+l+ 99.9%

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

      3. +-commutative 99.9%

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

      4. count-2 99.9%

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

      5. +-commutative 99.9%

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

      6. +-commutative 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around inf 54.8%

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

   if -5.99999999999999975e-78 < y < 0.0091999999999999998

   1. Initial program 99.8%

      \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
   2. Step-by-step derivation

      1. associate-+l+ 99.8%

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

      2. associate-+l+ 99.8%

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

      3. +-commutative 99.8%

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

      4. count-2 99.8%

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

      5. +-commutative 99.8%

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

      6. +-commutative 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 44.9%

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

4. Final simplification 50.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{-78} \lor \neg \left(y \leq 0.0092\right):\\ \;\;\;\;y \cdot 2\\ \mathbf{else}:\\ \;\;\;\;z\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 99.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
2. Step-by-step derivation

   1. associate-+l+ 99.9%

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

   2. associate-+l+ 99.9%

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

   3. +-commutative 99.9%

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

   4. count-2 99.9%

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

   5. +-commutative 99.9%

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

   6. +-commutative 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
4. Add Preprocessing

5. Final simplification 99.9%

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

Alternative 10: 99.9% accurate, 1.2× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
2. Step-by-step derivation

   1. +-commutative 99.9%

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

   2. associate-+l+ 99.9%

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

   3. remove-double-neg 99.9%

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

   4. unsub-neg 99.9%

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

   5. +-commutative 99.9%

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

   6. +-commutative 99.9%

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

   7. associate-+l+ 99.9%

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

   8. associate-+r+ 99.9%

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

   9. associate-+r+ 99.9%

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

   10. distribute-neg-in 99.9%

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

   11. distribute-neg-out 99.9%

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

   12. distribute-neg-out 99.9%

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

   13. neg-mul-1 99.9%

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

   14. count-2 99.9%

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

   15. distribute-lft-neg-in 99.9%

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

   16. metadata-eval 99.9%

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

   17. metadata-eval 99.9%

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

   18. distribute-rgt-out 99.9%

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

   19. fma-def 100.0%

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

3. Simplified 100.0%

   \[\leadsto \color{blue}{z - \mathsf{fma}\left(x, -3, y \cdot -2\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 99.9%

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

6. Final simplification 99.9%

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

Alternative 11: 35.2% accurate, 11.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := z

Derivation

1. Initial program 99.9%

   \[\left(\left(\left(\left(x + y\right) + y\right) + x\right) + z\right) + x \]
2. Step-by-step derivation

   1. associate-+l+ 99.9%

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

   2. associate-+l+ 99.9%

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

   3. +-commutative 99.9%

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

   4. count-2 99.9%

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

   5. +-commutative 99.9%

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

   6. +-commutative 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{2 \cdot \left(x + y\right) + \left(x + z\right)} \]
4. Add Preprocessing

5. Taylor expanded in z around inf 29.4%

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

6. Final simplification 29.4%

   \[\leadsto z \]
7. Add Preprocessing

Reproduce

herbie shell --seed 2024021 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendInside from plot-0.2.3.4"
  :precision binary64
  (+ (+ (+ (+ (+ x y) y) x) z) x))