Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, C

Percentage Accurate: 99.9% → 100.0%

Time: 4.5s

Alternatives: 8

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 0.1× speedup

Math

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

FPCore

(FPCore (x y z) :precision binary64 (fma z 5.0 (* x (+ z y))))

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. +-commutative 99.9%

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

   2. fma-def 100.0%

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

3. Applied egg-rr 100.0%

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

4. Final simplification 100.0%

   \[\leadsto \mathsf{fma}\left(z, 5, x \cdot \left(z + y\right)\right) \]

Alternative 2: 61.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.2 \cdot 10^{+274}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{+220}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;x \leq -1.5 \cdot 10^{-42}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1850000:\\ \;\;\;\;z \cdot 5\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{+147}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.2e+274)
   (* x y)
   (if (<= x -1.55e+220)
     (* z x)
     (if (<= x -1.5e-42)
       (* x y)
       (if (<= x 1850000.0) (* z 5.0) (if (<= x 5.2e+147) (* x y) (* z x)))))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.2e+274) {
		tmp = x * y;
	} else if (x <= -1.55e+220) {
		tmp = z * x;
	} else if (x <= -1.5e-42) {
		tmp = x * y;
	} else if (x <= 1850000.0) {
		tmp = z * 5.0;
	} else if (x <= 5.2e+147) {
		tmp = x * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (x <= (-4.2d+274)) then
        tmp = x * y
    else if (x <= (-1.55d+220)) then
        tmp = z * x
    else if (x <= (-1.5d-42)) then
        tmp = x * y
    else if (x <= 1850000.0d0) then
        tmp = z * 5.0d0
    else if (x <= 5.2d+147) then
        tmp = x * y
    else
        tmp = z * x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.2e+274) {
		tmp = x * y;
	} else if (x <= -1.55e+220) {
		tmp = z * x;
	} else if (x <= -1.5e-42) {
		tmp = x * y;
	} else if (x <= 1850000.0) {
		tmp = z * 5.0;
	} else if (x <= 5.2e+147) {
		tmp = x * y;
	} else {
		tmp = z * x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -4.2e+274:
		tmp = x * y
	elif x <= -1.55e+220:
		tmp = z * x
	elif x <= -1.5e-42:
		tmp = x * y
	elif x <= 1850000.0:
		tmp = z * 5.0
	elif x <= 5.2e+147:
		tmp = x * y
	else:
		tmp = z * x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.2e+274)
		tmp = Float64(x * y);
	elseif (x <= -1.55e+220)
		tmp = Float64(z * x);
	elseif (x <= -1.5e-42)
		tmp = Float64(x * y);
	elseif (x <= 1850000.0)
		tmp = Float64(z * 5.0);
	elseif (x <= 5.2e+147)
		tmp = Float64(x * y);
	else
		tmp = Float64(z * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -4.2e+274)
		tmp = x * y;
	elseif (x <= -1.55e+220)
		tmp = z * x;
	elseif (x <= -1.5e-42)
		tmp = x * y;
	elseif (x <= 1850000.0)
		tmp = z * 5.0;
	elseif (x <= 5.2e+147)
		tmp = x * y;
	else
		tmp = z * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.2e+274], N[(x * y), $MachinePrecision], If[LessEqual[x, -1.55e+220], N[(z * x), $MachinePrecision], If[LessEqual[x, -1.5e-42], N[(x * y), $MachinePrecision], If[LessEqual[x, 1850000.0], N[(z * 5.0), $MachinePrecision], If[LessEqual[x, 5.2e+147], N[(x * y), $MachinePrecision], N[(z * x), $MachinePrecision]]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -4.20000000000000032e274 or -1.55e220 < x < -1.50000000000000014e-42 or 1.85e6 < x < 5.1999999999999997e147

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around inf 67.5%

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

   if -4.20000000000000032e274 < x < -1.55e220 or 5.1999999999999997e147 < x

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around inf 100.0%

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

      1. +-commutative 100.0%

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

   4. Simplified 100.0%

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

   5. Taylor expanded in z around inf 66.3%

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

   if -1.50000000000000014e-42 < x < 1.85e6

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around 0 73.2%

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

4. Final simplification 69.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.2 \cdot 10^{+274}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq -1.55 \cdot 10^{+220}:\\ \;\;\;\;z \cdot x\\ \mathbf{elif}\;x \leq -1.5 \cdot 10^{-42}:\\ \;\;\;\;x \cdot y\\ \mathbf{elif}\;x \leq 1850000:\\ \;\;\;\;z \cdot 5\\ \mathbf{elif}\;x \leq 5.2 \cdot 10^{+147}:\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot x\\ \end{array} \]

Alternative 3: 98.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -145000000000 \lor \neg \left(x \leq 5\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y - z \cdot -5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -145000000000.0) (not (<= x 5.0)))
   (* x (+ z y))
   (- (* x y) (* z -5.0))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -145000000000.0) || !(x <= 5.0)) {
		tmp = x * (z + y);
	} else {
		tmp = (x * y) - (z * -5.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 ((x <= (-145000000000.0d0)) .or. (.not. (x <= 5.0d0))) then
        tmp = x * (z + y)
    else
        tmp = (x * y) - (z * (-5.0d0))
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (x <= -145000000000.0) or not (x <= 5.0):
		tmp = x * (z + y)
	else:
		tmp = (x * y) - (z * -5.0)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -145000000000.0) || !(x <= 5.0))
		tmp = Float64(x * Float64(z + y));
	else
		tmp = Float64(Float64(x * y) - Float64(z * -5.0));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -145000000000.0) || ~((x <= 5.0)))
		tmp = x * (z + y);
	else
		tmp = (x * y) - (z * -5.0);
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if x < -1.45e11 or 5 < x

   1. Initial program 100.0%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around inf 99.5%

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

      1. +-commutative 99.5%

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

   4. Simplified 99.5%

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

   if -1.45e11 < x < 5

   1. Initial program 99.9%

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

      1. +-commutative 99.9%

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

      2. fma-def 100.0%

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

   3. Applied egg-rr 100.0%

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

   4. Taylor expanded in z around -inf 99.9%

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

      1. +-commutative 99.9%

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

      2. mul-1-neg 99.9%

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

      3. unsub-neg 99.9%

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

      4. sub-neg 99.9%

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

      5. +-commutative 99.9%

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

      6. mul-1-neg 99.9%

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

      7. unsub-neg 99.9%

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

      8. metadata-eval 99.9%

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

   6. Simplified 99.9%

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

   7. Taylor expanded in x around 0 98.4%

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

      1. *-commutative 98.4%

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

   9. Simplified 98.4%

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

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -145000000000 \lor \neg \left(x \leq 5\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;x \cdot y - z \cdot -5\\ \end{array} \]

Alternative 4: 85.0% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.7e-43) (not (<= x 0.016))) (* x (+ z y)) (* z 5.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.7e-43) || !(x <= 0.016)) {
		tmp = x * (z + y);
	} else {
		tmp = z * 5.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 ((x <= (-2.7d-43)) .or. (.not. (x <= 0.016d0))) then
        tmp = x * (z + y)
    else
        tmp = z * 5.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.7e-43) || !(x <= 0.016)) {
		tmp = x * (z + y);
	} else {
		tmp = z * 5.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.7e-43) or not (x <= 0.016):
		tmp = x * (z + y)
	else:
		tmp = z * 5.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.7e-43) || !(x <= 0.016))
		tmp = Float64(x * Float64(z + y));
	else
		tmp = Float64(z * 5.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.7e-43) || ~((x <= 0.016)))
		tmp = x * (z + y);
	else
		tmp = z * 5.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.7e-43], N[Not[LessEqual[x, 0.016]], $MachinePrecision]], N[(x * N[(z + y), $MachinePrecision]), $MachinePrecision], N[(z * 5.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.69999999999999991e-43 or 0.016 < x

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around inf 96.0%

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

      1. +-commutative 96.0%

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

   4. Simplified 96.0%

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

   if -2.69999999999999991e-43 < x < 0.016

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around 0 73.7%

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

4. Final simplification 85.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.7 \cdot 10^{-43} \lor \neg \left(x \leq 0.016\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot 5\\ \end{array} \]

Alternative 5: 85.1% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.3e-43) (not (<= x 1850000.0)))
   (* x (+ z y))
   (* z (+ 5.0 x))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.3e-43) || !(x <= 1850000.0)) {
		tmp = x * (z + y);
	} else {
		tmp = z * (5.0 + x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-1.3d-43)) .or. (.not. (x <= 1850000.0d0))) then
        tmp = x * (z + y)
    else
        tmp = z * (5.0d0 + x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.3e-43) || !(x <= 1850000.0)) {
		tmp = x * (z + y);
	} else {
		tmp = z * (5.0 + x);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.3e-43) or not (x <= 1850000.0):
		tmp = x * (z + y)
	else:
		tmp = z * (5.0 + x)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.3e-43) || !(x <= 1850000.0))
		tmp = Float64(x * Float64(z + y));
	else
		tmp = Float64(z * Float64(5.0 + x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -1.3e-43) || ~((x <= 1850000.0)))
		tmp = x * (z + y);
	else
		tmp = z * (5.0 + x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.3e-43], N[Not[LessEqual[x, 1850000.0]], $MachinePrecision]], N[(x * N[(z + y), $MachinePrecision]), $MachinePrecision], N[(z * N[(5.0 + x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.3e-43 or 1.85e6 < x

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around inf 96.3%

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

      1. +-commutative 96.3%

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

   4. Simplified 96.3%

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

   if -1.3e-43 < x < 1.85e6

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around 0 74.5%

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

      1. distribute-rgt-in 74.5%

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

   4. Simplified 74.5%

      \[\leadsto \color{blue}{z \cdot \left(5 + x\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 86.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.3 \cdot 10^{-43} \lor \neg \left(x \leq 1850000\right):\\ \;\;\;\;x \cdot \left(z + y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(5 + x\right)\\ \end{array} \]

Alternative 6: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

   \[x \cdot \left(y + z\right) + z \cdot 5 \]

2. Final simplification 99.9%

   \[\leadsto x \cdot \left(z + y\right) + z \cdot 5 \]

Alternative 7: 61.7% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.25 \cdot 10^{-42} \lor \neg \left(x \leq 1850000\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot 5\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -2.25e-42) (not (<= x 1850000.0))) (* x y) (* z 5.0)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.25e-42) || !(x <= 1850000.0)) {
		tmp = x * y;
	} else {
		tmp = z * 5.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 ((x <= (-2.25d-42)) .or. (.not. (x <= 1850000.0d0))) then
        tmp = x * y
    else
        tmp = z * 5.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -2.25e-42) || !(x <= 1850000.0)) {
		tmp = x * y;
	} else {
		tmp = z * 5.0;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -2.25e-42) or not (x <= 1850000.0):
		tmp = x * y
	else:
		tmp = z * 5.0
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -2.25e-42) || !(x <= 1850000.0))
		tmp = Float64(x * y);
	else
		tmp = Float64(z * 5.0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -2.25e-42) || ~((x <= 1850000.0)))
		tmp = x * y;
	else
		tmp = z * 5.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -2.25e-42], N[Not[LessEqual[x, 1850000.0]], $MachinePrecision]], N[(x * y), $MachinePrecision], N[(z * 5.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.25e-42 or 1.85e6 < x

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in y around inf 59.9%

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

   if -2.25e-42 < x < 1.85e6

   1. Initial program 99.9%

      \[x \cdot \left(y + z\right) + z \cdot 5 \]

   2. Taylor expanded in x around 0 73.2%

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

4. Final simplification 66.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.25 \cdot 10^{-42} \lor \neg \left(x \leq 1850000\right):\\ \;\;\;\;x \cdot y\\ \mathbf{else}:\\ \;\;\;\;z \cdot 5\\ \end{array} \]

Alternative 8: 36.8% accurate, 3.0× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return z * 5.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 * 5.0d0
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(z * 5.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot \left(y + z\right) + z \cdot 5 \]

2. Taylor expanded in x around 0 36.9%

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

3. Final simplification 36.9%

   \[\leadsto z \cdot 5 \]

Developer target: 97.8% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Reproduce

herbie shell --seed 2023321 
(FPCore (x y z)
  :name "Graphics.Rendering.Plot.Render.Plot.Legend:renderLegendOutside from plot-0.2.3.4, C"
  :precision binary64

  :herbie-target
  (+ (* (+ x 5.0) z) (* x y))

  (+ (* x (+ y z)) (* z 5.0)))