Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, B

Percentage Accurate: 99.9% → 99.9%

Time: 8.5s

Alternatives: 13

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z) {
	return (x + Math.cos(y)) - (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x + math.cos(y)) - (z * math.sin(y))

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z) {
	return (x + Math.cos(y)) - (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x + math.cos(y)) - (z * math.sin(y))

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

public static double code(double x, double y, double z) {
	return (x + Math.cos(y)) - (z * Math.sin(y));
}

Python

def code(x, y, z):
	return (x + math.cos(y)) - (z * math.sin(y))

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

Alternative 2: 99.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -3.6 \cdot 10^{+17} \lor \neg \left(z \leq 3.4 \cdot 10^{-10}\right):\\ \;\;\;\;\left(x + 1\right) - z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x + \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -3.6e+17) (not (<= z 3.4e-10)))
   (- (+ x 1.0) (* z (sin y)))
   (+ x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.6e+17) || !(z <= 3.4e-10)) {
		tmp = (x + 1.0) - (z * sin(y));
	} else {
		tmp = x + cos(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-3.6d+17)) .or. (.not. (z <= 3.4d-10))) then
        tmp = (x + 1.0d0) - (z * sin(y))
    else
        tmp = x + cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -3.6e+17) || !(z <= 3.4e-10)) {
		tmp = (x + 1.0) - (z * Math.sin(y));
	} else {
		tmp = x + Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -3.6e+17) or not (z <= 3.4e-10):
		tmp = (x + 1.0) - (z * math.sin(y))
	else:
		tmp = x + math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -3.6e+17) || !(z <= 3.4e-10))
		tmp = Float64(Float64(x + 1.0) - Float64(z * sin(y)));
	else
		tmp = Float64(x + cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -3.6e+17) || ~((z <= 3.4e-10)))
		tmp = (x + 1.0) - (z * sin(y));
	else
		tmp = x + cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -3.6e+17], N[Not[LessEqual[z, 3.4e-10]], $MachinePrecision]], N[(N[(x + 1.0), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -3.6e17 or 3.40000000000000015e-10 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 99.4%

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

   if -3.6e17 < z < 3.40000000000000015e-10

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0 99.2%

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

      1. +-commutative 99.2%

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

   5. Simplified 99.2%

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

4. Final simplification 99.3%

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

Alternative 3: 92.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.65 \cdot 10^{+108} \lor \neg \left(z \leq 6.6 \cdot 10^{+27}\right):\\ \;\;\;\;x - z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x + \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.65e+108) (not (<= z 6.6e+27)))
   (- x (* z (sin y)))
   (+ x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.65e+108) || !(z <= 6.6e+27)) {
		tmp = x - (z * sin(y));
	} else {
		tmp = x + cos(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.65d+108)) .or. (.not. (z <= 6.6d+27))) then
        tmp = x - (z * sin(y))
    else
        tmp = x + cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.65e+108) || !(z <= 6.6e+27)) {
		tmp = x - (z * Math.sin(y));
	} else {
		tmp = x + Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.65e+108) or not (z <= 6.6e+27):
		tmp = x - (z * math.sin(y))
	else:
		tmp = x + math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.65e+108) || !(z <= 6.6e+27))
		tmp = Float64(x - Float64(z * sin(y)));
	else
		tmp = Float64(x + cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.65e+108) || ~((z <= 6.6e+27)))
		tmp = x - (z * sin(y));
	else
		tmp = x + cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.65e+108], N[Not[LessEqual[z, 6.6e+27]], $MachinePrecision]], N[(x - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.6500000000000001e108 or 6.5999999999999996e27 < z

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf 99.7%

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

   4. Taylor expanded in x around 0 99.7%

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

   5. Taylor expanded in z around inf 90.5%

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

      1. neg-mul-1 90.5%

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

   7. Simplified 90.5%

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

   if -1.6500000000000001e108 < z < 6.5999999999999996e27

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0 97.0%

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

      1. +-commutative 97.0%

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

   5. Simplified 97.0%

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

4. Final simplification 94.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.65 \cdot 10^{+108} \lor \neg \left(z \leq 6.6 \cdot 10^{+27}\right):\\ \;\;\;\;x - z \cdot \sin y\\ \mathbf{else}:\\ \;\;\;\;x + \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 80.8% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -1.22 \cdot 10^{+156} \lor \neg \left(z \leq 2.3 \cdot 10^{+243}\right):\\ \;\;\;\;\sin y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;x + \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -1.22e+156) (not (<= z 2.3e+243)))
   (* (sin y) (- z))
   (+ x (cos y))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.22e+156) || !(z <= 2.3e+243)) {
		tmp = sin(y) * -z;
	} else {
		tmp = x + cos(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((z <= (-1.22d+156)) .or. (.not. (z <= 2.3d+243))) then
        tmp = sin(y) * -z
    else
        tmp = x + cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -1.22e+156) || !(z <= 2.3e+243)) {
		tmp = Math.sin(y) * -z;
	} else {
		tmp = x + Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -1.22e+156) or not (z <= 2.3e+243):
		tmp = math.sin(y) * -z
	else:
		tmp = x + math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -1.22e+156) || !(z <= 2.3e+243))
		tmp = Float64(sin(y) * Float64(-z));
	else
		tmp = Float64(x + cos(y));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -1.22e+156) || ~((z <= 2.3e+243)))
		tmp = sin(y) * -z;
	else
		tmp = x + cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -1.22e+156], N[Not[LessEqual[z, 2.3e+243]], $MachinePrecision]], N[(N[Sin[y], $MachinePrecision] * (-z)), $MachinePrecision], N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.21999999999999991e156 or 2.29999999999999987e243 < z

   1. Initial program 99.7%

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

   3. Taylor expanded in z around inf 82.1%

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

      1. mul-1-neg 82.1%

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

      2. *-commutative 82.1%

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

      3. distribute-rgt-neg-in 82.1%

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

   5. Simplified 82.1%

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

   if -1.21999999999999991e156 < z < 2.29999999999999987e243

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0 87.5%

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

      1. +-commutative 87.5%

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

   5. Simplified 87.5%

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

4. Final simplification 86.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.22 \cdot 10^{+156} \lor \neg \left(z \leq 2.3 \cdot 10^{+243}\right):\\ \;\;\;\;\sin y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;x + \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+39} \lor \neg \left(y \leq 0.72\right):\\ \;\;\;\;x + \cos y\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x + y \cdot \left(y \cdot \left(0.16666666666666666 \cdot \left(y \cdot z\right) - 0.5\right) - z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.65e+39) (not (<= y 0.72)))
   (+ x (cos y))
   (+ 1.0 (+ x (* y (- (* y (- (* 0.16666666666666666 (* y z)) 0.5)) z))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+39) || !(y <= 0.72)) {
		tmp = x + cos(y);
	} else {
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - 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 <= (-2.65d+39)) .or. (.not. (y <= 0.72d0))) then
        tmp = x + cos(y)
    else
        tmp = 1.0d0 + (x + (y * ((y * ((0.16666666666666666d0 * (y * z)) - 0.5d0)) - z)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+39) || !(y <= 0.72)) {
		tmp = x + Math.cos(y);
	} else {
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.65e+39) or not (y <= 0.72):
		tmp = x + math.cos(y)
	else:
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.65e+39) || !(y <= 0.72))
		tmp = Float64(x + cos(y));
	else
		tmp = Float64(1.0 + Float64(x + Float64(y * Float64(Float64(y * Float64(Float64(0.16666666666666666 * Float64(y * z)) - 0.5)) - z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.65e+39) || ~((y <= 0.72)))
		tmp = x + cos(y);
	else
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.65e+39], N[Not[LessEqual[y, 0.72]], $MachinePrecision]], N[(x + N[Cos[y], $MachinePrecision]), $MachinePrecision], N[(1.0 + N[(x + N[(y * N[(N[(y * N[(N[(0.16666666666666666 * N[(y * z), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.64999999999999989e39 or 0.71999999999999997 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in z around 0 72.0%

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

      1. +-commutative 72.0%

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

   5. Simplified 72.0%

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

   if -2.64999999999999989e39 < y < 0.71999999999999997

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 96.6%

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

4. Final simplification 84.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+39} \lor \neg \left(y \leq 0.72\right):\\ \;\;\;\;x + \cos y\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x + y \cdot \left(y \cdot \left(0.16666666666666666 \cdot \left(y \cdot z\right) - 0.5\right) - z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 72.2% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.00041 \lor \neg \left(x \leq 1.25 \cdot 10^{-7}\right):\\ \;\;\;\;x + 1\\ \mathbf{else}:\\ \;\;\;\;\cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -0.00041) (not (<= x 1.25e-7))) (+ x 1.0) (cos y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -0.00041) || !(x <= 1.25e-7)) {
		tmp = x + 1.0;
	} else {
		tmp = cos(y);
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if ((x <= (-0.00041d0)) .or. (.not. (x <= 1.25d-7))) then
        tmp = x + 1.0d0
    else
        tmp = cos(y)
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -0.00041) || !(x <= 1.25e-7)) {
		tmp = x + 1.0;
	} else {
		tmp = Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -0.00041) or not (x <= 1.25e-7):
		tmp = x + 1.0
	else:
		tmp = math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -0.00041) || !(x <= 1.25e-7))
		tmp = Float64(x + 1.0);
	else
		tmp = cos(y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -0.00041) || ~((x <= 1.25e-7)))
		tmp = x + 1.0;
	else
		tmp = cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -0.00041], N[Not[LessEqual[x, 1.25e-7]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[Cos[y], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -4.0999999999999999e-4 or 1.24999999999999994e-7 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 81.7%

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

      1. +-commutative 81.7%

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

   5. Simplified 81.7%

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

   if -4.0999999999999999e-4 < x < 1.24999999999999994e-7

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0 98.2%

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

   4. Taylor expanded in z around 0 68.2%

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

4. Final simplification 74.7%

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

Alternative 7: 69.7% accurate, 7.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+39} \lor \neg \left(y \leq 1.6 \cdot 10^{+45}\right):\\ \;\;\;\;x + 1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x + y \cdot \left(y \cdot \left(0.16666666666666666 \cdot \left(y \cdot z\right) - 0.5\right) - z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -2.65e+39) (not (<= y 1.6e+45)))
   (+ x 1.0)
   (+ 1.0 (+ x (* y (- (* y (- (* 0.16666666666666666 (* y z)) 0.5)) z))))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+39) || !(y <= 1.6e+45)) {
		tmp = x + 1.0;
	} else {
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - 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 <= (-2.65d+39)) .or. (.not. (y <= 1.6d+45))) then
        tmp = x + 1.0d0
    else
        tmp = 1.0d0 + (x + (y * ((y * ((0.16666666666666666d0 * (y * z)) - 0.5d0)) - z)))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -2.65e+39) || !(y <= 1.6e+45)) {
		tmp = x + 1.0;
	} else {
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -2.65e+39) or not (y <= 1.6e+45):
		tmp = x + 1.0
	else:
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -2.65e+39) || !(y <= 1.6e+45))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(1.0 + Float64(x + Float64(y * Float64(Float64(y * Float64(Float64(0.16666666666666666 * Float64(y * z)) - 0.5)) - z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -2.65e+39) || ~((y <= 1.6e+45)))
		tmp = x + 1.0;
	else
		tmp = 1.0 + (x + (y * ((y * ((0.16666666666666666 * (y * z)) - 0.5)) - z)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -2.65e+39], N[Not[LessEqual[y, 1.6e+45]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(1.0 + N[(x + N[(y * N[(N[(y * N[(N[(0.16666666666666666 * N[(y * z), $MachinePrecision]), $MachinePrecision] - 0.5), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.64999999999999989e39 or 1.6000000000000001e45 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 38.3%

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

      1. +-commutative 38.3%

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

   5. Simplified 38.3%

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

   if -2.64999999999999989e39 < y < 1.6000000000000001e45

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 91.9%

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

4. Final simplification 66.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.65 \cdot 10^{+39} \lor \neg \left(y \leq 1.6 \cdot 10^{+45}\right):\\ \;\;\;\;x + 1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x + y \cdot \left(y \cdot \left(0.16666666666666666 \cdot \left(y \cdot z\right) - 0.5\right) - z\right)\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 70.0% accurate, 9.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -540.0) (not (<= y 2.45e+45)))
   (+ x 1.0)
   (+ (+ x 1.0) (* y (- (* y -0.5) z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -540.0) || !(y <= 2.45e+45)) {
		tmp = x + 1.0;
	} else {
		tmp = (x + 1.0) + (y * ((y * -0.5) - 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 <= (-540.0d0)) .or. (.not. (y <= 2.45d+45))) then
        tmp = x + 1.0d0
    else
        tmp = (x + 1.0d0) + (y * ((y * (-0.5d0)) - z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -540.0) || !(y <= 2.45e+45)) {
		tmp = x + 1.0;
	} else {
		tmp = (x + 1.0) + (y * ((y * -0.5) - z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -540.0) or not (y <= 2.45e+45):
		tmp = x + 1.0
	else:
		tmp = (x + 1.0) + (y * ((y * -0.5) - z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -540.0) || !(y <= 2.45e+45))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(Float64(x + 1.0) + Float64(y * Float64(Float64(y * -0.5) - z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -540.0) || ~((y <= 2.45e+45)))
		tmp = x + 1.0;
	else
		tmp = (x + 1.0) + (y * ((y * -0.5) - z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -540.0], N[Not[LessEqual[y, 2.45e+45]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(N[(x + 1.0), $MachinePrecision] + N[(y * N[(N[(y * -0.5), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -540 or 2.4500000000000001e45 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 38.2%

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

      1. +-commutative 38.2%

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

   5. Simplified 38.2%

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

   if -540 < y < 2.4500000000000001e45

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 94.4%

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

      1. associate-+r+ 94.4%

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

      2. +-commutative 94.4%

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

      3. *-commutative 94.4%

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

   5. Simplified 94.4%

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

4. Final simplification 66.7%

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

Alternative 9: 70.0% accurate, 12.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1350.0) (not (<= y 2.3e+32))) (+ x 1.0) (+ x (- 1.0 (* y z)))))

C

double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1350.0) || !(y <= 2.3e+32)) {
		tmp = x + 1.0;
	} else {
		tmp = x + (1.0 - (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 ((y <= (-1350.0d0)) .or. (.not. (y <= 2.3d+32))) then
        tmp = x + 1.0d0
    else
        tmp = x + (1.0d0 - (y * z))
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1350.0) || !(y <= 2.3e+32)) {
		tmp = x + 1.0;
	} else {
		tmp = x + (1.0 - (y * z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1350.0) or not (y <= 2.3e+32):
		tmp = x + 1.0
	else:
		tmp = x + (1.0 - (y * z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1350.0) || !(y <= 2.3e+32))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(x + Float64(1.0 - Float64(y * z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1350.0) || ~((y <= 2.3e+32)))
		tmp = x + 1.0;
	else
		tmp = x + (1.0 - (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1350.0], N[Not[LessEqual[y, 2.3e+32]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(x + N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1350 or 2.3e32 < y

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 37.6%

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

      1. +-commutative 37.6%

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

   5. Simplified 37.6%

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

   if -1350 < y < 2.3e32

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 95.5%

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

      1. associate-+r+ 95.5%

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

      2. +-commutative 95.5%

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

      3. associate-+l+ 95.5%

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

      4. mul-1-neg 95.5%

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

      5. unsub-neg 95.5%

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

   5. Simplified 95.5%

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

4. Final simplification 66.5%

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

Alternative 10: 65.0% accurate, 13.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.7 \cdot 10^{-136}:\\ \;\;\;\;x + 1\\ \mathbf{elif}\;x \leq 5.1 \cdot 10^{+28}:\\ \;\;\;\;1 - y \cdot z\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.7e-136) (+ x 1.0) (if (<= x 5.1e+28) (- 1.0 (* y z)) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.7e-136) {
		tmp = x + 1.0;
	} else if (x <= 5.1e+28) {
		tmp = 1.0 - (y * z);
	} else {
		tmp = 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.7d-136)) then
        tmp = x + 1.0d0
    else if (x <= 5.1d+28) then
        tmp = 1.0d0 - (y * z)
    else
        tmp = x
    end if
    code = tmp
end function

Java

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

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.7e-136:
		tmp = x + 1.0
	elif x <= 5.1e+28:
		tmp = 1.0 - (y * z)
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.7e-136)
		tmp = Float64(x + 1.0);
	elseif (x <= 5.1e+28)
		tmp = Float64(1.0 - Float64(y * z));
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.7e-136)
		tmp = x + 1.0;
	elseif (x <= 5.1e+28)
		tmp = 1.0 - (y * z);
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1.7e-136

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 63.4%

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

      1. +-commutative 63.4%

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

   5. Simplified 63.4%

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

   if -1.7e-136 < x < 5.1000000000000004e28

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf 99.8%

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

   4. Taylor expanded in x around 0 99.8%

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

   5. Taylor expanded in y around 0 52.3%

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

      1. +-commutative 52.3%

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

      2. mul-1-neg 52.3%

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

      3. unsub-neg 52.3%

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

   7. Simplified 52.3%

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

   8. Taylor expanded in x around 0 51.8%

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

      1. sub-neg 51.8%

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

      2. distribute-lft-in 51.8%

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

      3. rgt-mult-inverse 51.8%

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

      4. distribute-rgt-neg-in 51.8%

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

      5. unsub-neg 51.8%

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

   10. Simplified 51.8%

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

   if 5.1000000000000004e28 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf 89.7%

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

4. Final simplification 64.4%

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

Alternative 11: 62.2% accurate, 23.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if z < -1.17999999999999994e191

   1. Initial program 99.8%

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

   3. Taylor expanded in y around 0 47.0%

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

      1. +-commutative 47.0%

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

      2. fma-define 47.0%

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

      3. *-commutative 47.0%

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

   5. Simplified 47.0%

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

   6. Taylor expanded in z around inf 36.6%

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

      1. associate-*r* 36.6%

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

      2. mul-1-neg 36.6%

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

   8. Simplified 36.6%

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

   if -1.17999999999999994e191 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 63.3%

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

      1. +-commutative 63.3%

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

   5. Simplified 63.3%

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

4. Final simplification 60.5%

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

Alternative 12: 61.9% accurate, 69.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0 58.3%

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

   1. +-commutative 58.3%

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

5. Simplified 58.3%

   \[\leadsto \color{blue}{x + 1} \]
6. Add Preprocessing

Alternative 13: 42.4% accurate, 207.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%

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

3. Taylor expanded in x around inf 40.7%

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

Reproduce

herbie shell --seed 2024129 
(FPCore (x y z)
  :name "Graphics.Rasterific.Svg.PathConverter:segmentToBezier from rasterific-svg-0.2.3.1, B"
  :precision binary64
  (- (+ x (cos y)) (* z (sin y))))