Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2

Percentage Accurate: 99.9% → 99.9%

Time: 4.9s

Alternatives: 6

Speedup: 1.0×

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

Specification

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Final simplification 99.9%

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

Alternative 2: 95.3% accurate, 0.6× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 5.00000000000000009e150

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 92.7%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 92.7%

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

   if 5.00000000000000009e150 < z

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 80.3%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 80.3%

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

   5. Taylor expanded in x around 0

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

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

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left({z}^{2}\right)}\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(z \cdot \color{blue}{z}\right)\right) \]

      3. *-lowering-*.f64 80.3%

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

   7. Simplified 80.3%

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

      1. associate-*r* N/A

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

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

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot z\right), \color{blue}{z}\right) \]

      3. *-lowering-*.f64 97.2%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, z\right), z\right) \]

   9. Applied egg-rr 97.2%

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

4. Final simplification 93.3%

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

Alternative 3: 65.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 25000000000000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;z \cdot \left(y \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 25000000000000.0) x (* z (* y z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 25000000000000.0) {
		tmp = x;
	} else {
		tmp = z * (y * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 25000000000000.0d0) then
        tmp = x
    else
        tmp = z * (y * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 25000000000000.0) {
		tmp = x;
	} else {
		tmp = z * (y * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 25000000000000.0:
		tmp = x
	else:
		tmp = z * (y * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 25000000000000.0)
		tmp = x;
	else
		tmp = Float64(z * Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 25000000000000.0)
		tmp = x;
	else
		tmp = z * (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 25000000000000.0], x, N[(z * N[(y * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 2.5e13

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 91.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 91.6%

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

   5. Taylor expanded in x around inf

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

   7. Simplified 57.8%

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

   if 2.5e13 < z

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 89.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 89.6%

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

   5. Taylor expanded in x around 0

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

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

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left({z}^{2}\right)}\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(z \cdot \color{blue}{z}\right)\right) \]

      3. *-lowering-*.f64 74.2%

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

   7. Simplified 74.2%

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

      1. associate-*r* N/A

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

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

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot z\right), \color{blue}{z}\right) \]

      3. *-lowering-*.f64 83.0%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, z\right), z\right) \]

   9. Applied egg-rr 83.0%

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

4. Final simplification 64.0%

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

Alternative 4: 63.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 8500000000000:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(z \cdot z\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z 8500000000000.0) x (* y (* z z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 8500000000000.0) {
		tmp = x;
	} else {
		tmp = y * (z * z);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 8500000000000.0d0) then
        tmp = x
    else
        tmp = y * (z * z)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 8500000000000.0) {
		tmp = x;
	} else {
		tmp = y * (z * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 8500000000000.0:
		tmp = x
	else:
		tmp = y * (z * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 8500000000000.0)
		tmp = x;
	else
		tmp = Float64(y * Float64(z * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 8500000000000.0)
		tmp = x;
	else
		tmp = y * (z * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, 8500000000000.0], x, N[(y * N[(z * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < 8.5e12

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 91.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 91.6%

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

   5. Taylor expanded in x around inf

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

   7. Simplified 57.8%

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

   if 8.5e12 < z

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 89.6%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 89.6%

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

   5. Taylor expanded in x around 0

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

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

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left({z}^{2}\right)}\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(z \cdot \color{blue}{z}\right)\right) \]

      3. *-lowering-*.f64 74.2%

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

   7. Simplified 74.2%

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

Alternative 5: 53.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq 6.5 \cdot 10^{+35}:\\ \;\;\;\;x\\ \mathbf{else}:\\ \;\;\;\;y \cdot z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= z 6.5e+35) x (* y z)))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= 6.5e+35) {
		tmp = x;
	} else {
		tmp = y * z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (z <= 6.5d+35) then
        tmp = x
    else
        tmp = y * z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (z <= 6.5e+35) {
		tmp = x;
	} else {
		tmp = y * z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if z <= 6.5e+35:
		tmp = x
	else:
		tmp = y * z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= 6.5e+35)
		tmp = x;
	else
		tmp = Float64(y * z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (z <= 6.5e+35)
		tmp = x;
	else
		tmp = y * z;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < 6.5000000000000003e35

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 91.9%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 91.9%

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

   5. Taylor expanded in x around inf

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

   7. Simplified 57.4%

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

   if 6.5000000000000003e35 < z

   1. Initial program 99.9%

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

      1. +-lowering-+.f64 N/A

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

      2. associate-*l* N/A

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

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

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

      4. *-lowering-*.f64 88.3%

         \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

   3. Simplified 88.3%

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

   5. Taylor expanded in x around 0

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

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

         \[\leadsto \mathsf{*.f64}\left(y, \color{blue}{\left({z}^{2}\right)}\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{*.f64}\left(y, \left(z \cdot \color{blue}{z}\right)\right) \]

      3. *-lowering-*.f64 76.1%

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

   7. Simplified 76.1%

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

      1. associate-*r* N/A

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

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

         \[\leadsto \mathsf{*.f64}\left(\left(y \cdot z\right), \color{blue}{z}\right) \]

      3. *-lowering-*.f64 86.1%

         \[\leadsto \mathsf{*.f64}\left(\mathsf{*.f64}\left(y, z\right), z\right) \]

   9. Applied egg-rr 86.1%

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

   11. Applied egg-rr 32.2%

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

Alternative 6: 50.1% accurate, 7.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := x

Derivation

1. Initial program 99.9%

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

   1. +-lowering-+.f64 N/A

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

   2. associate-*l* N/A

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

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

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \color{blue}{\left(z \cdot z\right)}\right)\right) \]

   4. *-lowering-*.f64 91.1%

      \[\leadsto \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(y, \mathsf{*.f64}\left(z, \color{blue}{z}\right)\right)\right) \]

3. Simplified 91.1%

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

5. Taylor expanded in x around inf

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

7. Simplified 48.3%

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

Reproduce

herbie shell --seed 2024161 
(FPCore (x y z)
  :name "Statistics.Sample:robustSumVarWeighted from math-functions-0.1.5.2"
  :precision binary64
  (+ x (* (* y z) z)))