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

Percentage Accurate: 99.9% → 99.9%

Time: 8.9s

Alternatives: 14

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, 0.7× speedup

Math

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

FPCore

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

C

double code(double x, double y, double z) {
	return cos(y) + fma(z, -sin(y), x);
}

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. cancel-sign-sub-inv 99.9%

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

   2. +-commutative 99.9%

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

   3. associate-+l+ 99.9%

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

   4. +-commutative 99.9%

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

   5. distribute-lft-neg-out 99.9%

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

   6. distribute-rgt-neg-in 99.9%

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

   7. sin-neg 99.9%

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

   8. fma-define 99.9%

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

   9. sin-neg 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \sin y\\ \mathbf{if}\;x \leq -1.58 \cdot 10^{-9} \lor \neg \left(x \leq 2.25 \cdot 10^{-18}\right):\\ \;\;\;\;\left(x + 1\right) - t\_0\\ \mathbf{else}:\\ \;\;\;\;\cos y - t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (sin y))))
   (if (or (<= x -1.58e-9) (not (<= x 2.25e-18)))
     (- (+ x 1.0) t_0)
     (- (cos y) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * sin(y);
	double tmp;
	if ((x <= -1.58e-9) || !(x <= 2.25e-18)) {
		tmp = (x + 1.0) - t_0;
	} else {
		tmp = cos(y) - t_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 = z * sin(y)
    if ((x <= (-1.58d-9)) .or. (.not. (x <= 2.25d-18))) then
        tmp = (x + 1.0d0) - t_0
    else
        tmp = cos(y) - t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = z * Math.sin(y);
	double tmp;
	if ((x <= -1.58e-9) || !(x <= 2.25e-18)) {
		tmp = (x + 1.0) - t_0;
	} else {
		tmp = Math.cos(y) - t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.sin(y)
	tmp = 0
	if (x <= -1.58e-9) or not (x <= 2.25e-18):
		tmp = (x + 1.0) - t_0
	else:
		tmp = math.cos(y) - t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * sin(y))
	tmp = 0.0
	if ((x <= -1.58e-9) || !(x <= 2.25e-18))
		tmp = Float64(Float64(x + 1.0) - t_0);
	else
		tmp = Float64(cos(y) - t_0);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * sin(y);
	tmp = 0.0;
	if ((x <= -1.58e-9) || ~((x <= 2.25e-18)))
		tmp = (x + 1.0) - t_0;
	else
		tmp = cos(y) - t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[Or[LessEqual[x, -1.58e-9], N[Not[LessEqual[x, 2.25e-18]], $MachinePrecision]], N[(N[(x + 1.0), $MachinePrecision] - t$95$0), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] - t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.5799999999999999e-9 or 2.24999999999999997e-18 < 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 99.6%

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

   if -1.5799999999999999e-9 < x < 2.24999999999999997e-18

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.8%

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

      1. neg-mul-1 99.8%

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

      2. sub-neg 99.8%

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

   7. Simplified 99.8%

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

4. Final simplification 99.7%

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

Alternative 3: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := N[(N[(N[Cos[y], $MachinePrecision] + x), $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. Final simplification 99.9%

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

Alternative 4: 99.4% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -0.45) (not (<= z 0.35)))
   (- (+ x 1.0) (* z (sin y)))
   (+ (cos y) x)))

C

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

Java

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

Python

def code(x, y, z):
	tmp = 0
	if (z <= -0.45) or not (z <= 0.35):
		tmp = (x + 1.0) - (z * math.sin(y))
	else:
		tmp = math.cos(y) + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -0.45) || !(z <= 0.35))
		tmp = Float64(Float64(x + 1.0) - Float64(z * sin(y)));
	else
		tmp = Float64(cos(y) + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -0.45) || ~((z <= 0.35)))
		tmp = (x + 1.0) - (z * sin(y));
	else
		tmp = cos(y) + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -0.45], N[Not[LessEqual[z, 0.35]], $MachinePrecision]], N[(N[(x + 1.0), $MachinePrecision] - N[(z * N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -0.450000000000000011 or 0.34999999999999998 < 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.2%

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

   if -0.450000000000000011 < z < 0.34999999999999998

   1. Initial program 100.0%

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

      1. cancel-sign-sub-inv 100.0%

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

      2. +-commutative 100.0%

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

      3. associate-+l+ 100.0%

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

      4. +-commutative 100.0%

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

      5. distribute-lft-neg-out 100.0%

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

      6. distribute-rgt-neg-in 100.0%

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

      7. sin-neg 100.0%

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

      8. fma-define 100.0%

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

      9. sin-neg 100.0%

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

   3. Simplified 100.0%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 98.5%

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

4. Final simplification 98.9%

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

Alternative 5: 81.6% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -4 \cdot 10^{+141} \lor \neg \left(z \leq 1.35 \cdot 10^{+239}\right):\\ \;\;\;\;\sin y \cdot \left(-z\right)\\ \mathbf{else}:\\ \;\;\;\;\cos y + x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= z -4e+141) (not (<= z 1.35e+239)))
   (* (sin y) (- z))
   (+ (cos y) x)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4e+141) || !(z <= 1.35e+239)) {
		tmp = sin(y) * -z;
	} else {
		tmp = cos(y) + 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 ((z <= (-4d+141)) .or. (.not. (z <= 1.35d+239))) then
        tmp = sin(y) * -z
    else
        tmp = cos(y) + x
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((z <= -4e+141) || !(z <= 1.35e+239)) {
		tmp = Math.sin(y) * -z;
	} else {
		tmp = Math.cos(y) + x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (z <= -4e+141) or not (z <= 1.35e+239):
		tmp = math.sin(y) * -z
	else:
		tmp = math.cos(y) + x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((z <= -4e+141) || !(z <= 1.35e+239))
		tmp = Float64(sin(y) * Float64(-z));
	else
		tmp = Float64(cos(y) + x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((z <= -4e+141) || ~((z <= 1.35e+239)))
		tmp = sin(y) * -z;
	else
		tmp = cos(y) + x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[z, -4e+141], N[Not[LessEqual[z, 1.35e+239]], $MachinePrecision]], N[(N[Sin[y], $MachinePrecision] * (-z)), $MachinePrecision], N[(N[Cos[y], $MachinePrecision] + x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -4.00000000000000007e141 or 1.3499999999999999e239 < z

   1. Initial program 99.7%

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

      1. cancel-sign-sub-inv 99.7%

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

      2. +-commutative 99.7%

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

      3. associate-+l+ 99.7%

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

      4. +-commutative 99.7%

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

      5. distribute-lft-neg-out 99.7%

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

      6. distribute-rgt-neg-in 99.7%

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

      7. sin-neg 99.7%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around inf 79.6%

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

      1. neg-mul-1 79.6%

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

      2. distribute-rgt-neg-in 79.6%

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

   7. Simplified 79.6%

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

   if -4.00000000000000007e141 < z < 1.3499999999999999e239

   1. Initial program 99.9%

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

      1. cancel-sign-sub-inv 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. distribute-lft-neg-out 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. sin-neg 99.9%

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

      8. fma-define 99.9%

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

      9. sin-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 85.0%

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

4. Final simplification 83.8%

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

Alternative 6: 80.7% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.5 \cdot 10^{+20} \lor \neg \left(y \leq 9 \cdot 10^{+18}\right):\\ \;\;\;\;\cos y + x\\ \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 -4.5e+20) (not (<= y 9e+18)))
   (+ (cos y) x)
   (+ 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 <= -4.5e+20) || !(y <= 9e+18)) {
		tmp = cos(y) + x;
	} 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 <= (-4.5d+20)) .or. (.not. (y <= 9d+18))) then
        tmp = cos(y) + x
    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 <= -4.5e+20) || !(y <= 9e+18)) {
		tmp = Math.cos(y) + x;
	} 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 <= -4.5e+20) or not (y <= 9e+18):
		tmp = math.cos(y) + x
	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 <= -4.5e+20) || !(y <= 9e+18))
		tmp = Float64(cos(y) + x);
	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 <= -4.5e+20) || ~((y <= 9e+18)))
		tmp = cos(y) + x;
	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, -4.5e+20], N[Not[LessEqual[y, 9e+18]], $MachinePrecision]], N[(N[Cos[y], $MachinePrecision] + x), $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 < -4.5e20 or 9e18 < y

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in z around 0 62.7%

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

   if -4.5e20 < y < 9e18

   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.8%

      \[\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 78.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -4.5 \cdot 10^{+20} \lor \neg \left(y \leq 9 \cdot 10^{+18}\right):\\ \;\;\;\;\cos y + x\\ \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 7: 72.7% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -1.2e-12) (not (<= x 2.25e-18))) (+ x 1.0) (cos y)))

C

double code(double x, double y, double z) {
	double tmp;
	if ((x <= -1.2e-12) || !(x <= 2.25e-18)) {
		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 <= (-1.2d-12)) .or. (.not. (x <= 2.25d-18))) 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 <= -1.2e-12) || !(x <= 2.25e-18)) {
		tmp = x + 1.0;
	} else {
		tmp = Math.cos(y);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -1.2e-12) or not (x <= 2.25e-18):
		tmp = x + 1.0
	else:
		tmp = math.cos(y)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -1.2e-12) || !(x <= 2.25e-18))
		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 <= -1.2e-12) || ~((x <= 2.25e-18)))
		tmp = x + 1.0;
	else
		tmp = cos(y);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -1.2e-12], N[Not[LessEqual[x, 2.25e-18]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[Cos[y], $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.19999999999999994e-12 or 2.24999999999999997e-18 < x

   1. Initial program 99.9%

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

      1. cancel-sign-sub-inv 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. distribute-lft-neg-out 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. sin-neg 99.9%

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

      8. fma-define 99.9%

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

      9. sin-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 80.8%

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

   if -1.19999999999999994e-12 < x < 2.24999999999999997e-18

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.8%

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

      1. neg-mul-1 99.8%

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

      2. sub-neg 99.8%

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

   7. Simplified 99.8%

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

   8. Taylor expanded in z around 0 56.7%

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

4. Final simplification 70.1%

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

Alternative 8: 69.6% accurate, 7.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.26 \cdot 10^{+33} \lor \neg \left(y \leq 8.5 \cdot 10^{+33}\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 -1.26e+33) (not (<= y 8.5e+33)))
   (+ 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 <= -1.26e+33) || !(y <= 8.5e+33)) {
		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 <= (-1.26d+33)) .or. (.not. (y <= 8.5d+33))) 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 <= -1.26e+33) || !(y <= 8.5e+33)) {
		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 <= -1.26e+33) or not (y <= 8.5e+33):
		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 <= -1.26e+33) || !(y <= 8.5e+33))
		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 <= -1.26e+33) || ~((y <= 8.5e+33)))
		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, -1.26e+33], N[Not[LessEqual[y, 8.5e+33]], $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 < -1.26e33 or 8.4999999999999998e33 < y

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 40.5%

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

   if -1.26e33 < y < 8.4999999999999998e33

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0 92.7%

      \[\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.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.26 \cdot 10^{+33} \lor \neg \left(y \leq 8.5 \cdot 10^{+33}\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 9: 69.6% accurate, 8.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.45 \cdot 10^{+33} \lor \neg \left(y \leq 1.35 \cdot 10^{+54}\right):\\ \;\;\;\;x + 1\\ \mathbf{else}:\\ \;\;\;\;1 + \left(x + y \cdot \left(y \cdot \left(0.16666666666666666 \cdot \left(y \cdot z\right)\right) - z\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -1.45e+33) (not (<= y 1.35e+54)))
   (+ x 1.0)
   (+ 1.0 (+ x (* y (- (* y (* 0.16666666666666666 (* y z))) z))))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -1.45e+33) || !(y <= 1.35e+54)) {
		tmp = x + 1.0;
	} else {
		tmp = 1.0 + (x + (y * ((y * (0.16666666666666666 * (y * z))) - z)));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -1.45e+33) or not (y <= 1.35e+54):
		tmp = x + 1.0
	else:
		tmp = 1.0 + (x + (y * ((y * (0.16666666666666666 * (y * z))) - z)))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -1.45e+33) || !(y <= 1.35e+54))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(1.0 + Float64(x + Float64(y * Float64(Float64(y * Float64(0.16666666666666666 * Float64(y * z))) - z))));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -1.45e+33) || ~((y <= 1.35e+54)))
		tmp = x + 1.0;
	else
		tmp = 1.0 + (x + (y * ((y * (0.16666666666666666 * (y * z))) - z)));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -1.45e+33], N[Not[LessEqual[y, 1.35e+54]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(1.0 + N[(x + N[(y * N[(N[(y * N[(0.16666666666666666 * N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] - z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.45000000000000012e33 or 1.35000000000000005e54 < y

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 42.5%

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

   if -1.45000000000000012e33 < y < 1.35000000000000005e54

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0 87.4%

      \[\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)} \]

   4. Taylor expanded in y around inf 87.9%

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

      1. *-commutative 87.9%

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

   6. Simplified 87.9%

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

4. Final simplification 66.6%

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

Alternative 10: 69.3% accurate, 12.1× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= y -7e+119) (not (<= y 9e+63))) (+ x 1.0) (+ 1.0 (- x (* y z)))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((y <= -7e+119) || !(y <= 9e+63)) {
		tmp = x + 1.0;
	} else {
		tmp = 1.0 + (x - (y * z));
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (y <= -7e+119) or not (y <= 9e+63):
		tmp = x + 1.0
	else:
		tmp = 1.0 + (x - (y * z))
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((y <= -7e+119) || !(y <= 9e+63))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(1.0 + Float64(x - Float64(y * z)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((y <= -7e+119) || ~((y <= 9e+63)))
		tmp = x + 1.0;
	else
		tmp = 1.0 + (x - (y * z));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[y, -7e+119], N[Not[LessEqual[y, 9e+63]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(1.0 + N[(x - N[(y * z), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -7.0000000000000001e119 or 9.00000000000000034e63 < y

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 40.7%

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

   if -7.0000000000000001e119 < y < 9.00000000000000034e63

   1. Initial program 99.9%

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

      1. cancel-sign-sub-inv 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. distribute-lft-neg-out 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. sin-neg 99.9%

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

      8. fma-define 99.9%

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

      9. sin-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 84.5%

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

      1. mul-1-neg 84.5%

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

      2. unsub-neg 84.5%

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

   7. Simplified 84.5%

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

4. Final simplification 66.6%

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

Alternative 11: 67.1% accurate, 13.8× speedup

Math

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

FPCore

(FPCore (x y z)
 :precision binary64
 (if (or (<= x -3.2e-5) (not (<= x 5.2e-19))) (+ x 1.0) (- 1.0 (* y z))))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if ((x <= -3.2e-5) || !(x <= 5.2e-19)) {
		tmp = x + 1.0;
	} else {
		tmp = 1.0 - (y * z);
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if (x <= -3.2e-5) or not (x <= 5.2e-19):
		tmp = x + 1.0
	else:
		tmp = 1.0 - (y * z)
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if ((x <= -3.2e-5) || !(x <= 5.2e-19))
		tmp = Float64(x + 1.0);
	else
		tmp = Float64(1.0 - Float64(y * z));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if ((x <= -3.2e-5) || ~((x <= 5.2e-19)))
		tmp = x + 1.0;
	else
		tmp = 1.0 - (y * z);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[Or[LessEqual[x, -3.2e-5], N[Not[LessEqual[x, 5.2e-19]], $MachinePrecision]], N[(x + 1.0), $MachinePrecision], N[(1.0 - N[(y * z), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -3.19999999999999986e-5 or 5.20000000000000026e-19 < x

   1. Initial program 99.9%

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

      1. cancel-sign-sub-inv 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. distribute-lft-neg-out 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. sin-neg 99.9%

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

      8. fma-define 99.9%

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

      9. sin-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in y around 0 81.5%

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

   if -3.19999999999999986e-5 < x < 5.20000000000000026e-19

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 76.2%

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

      1. metadata-eval 76.2%

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

      2. mul-1-neg 76.2%

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

      3. distribute-neg-in 76.2%

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

      4. +-commutative 76.2%

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

      5. metadata-eval 76.2%

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

      6. sub-neg 76.2%

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

      7. distribute-rgt-neg-in 76.2%

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

      8. distribute-lft-neg-in 76.2%

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

      9. *-commutative 76.2%

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

      10. *-commutative 76.2%

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

      11. associate-/l* 68.7%

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

      12. fmm-def 68.7%

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

      13. metadata-eval 68.7%

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

   7. Simplified 68.7%

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

   8. Taylor expanded in z around inf 76.0%

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

      1. associate-/l* 76.0%

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

   10. Simplified 76.0%

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

   11. Taylor expanded in y around 0 42.4%

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

       1. mul-1-neg 42.4%

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

       2. unsub-neg 42.4%

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

       3. *-commutative 42.4%

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

   13. Simplified 42.4%

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

4. Final simplification 63.9%

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

Alternative 12: 61.0% accurate, 18.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -0.83:\\ \;\;\;\;x\\ \mathbf{elif}\;x \leq 1.45:\\ \;\;\;\;1\\ \mathbf{else}:\\ \;\;\;\;x\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z) :precision binary64 (if (<= x -0.83) x (if (<= x 1.45) 1.0 x)))

C

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

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -0.83) {
		tmp = x;
	} else if (x <= 1.45) {
		tmp = 1.0;
	} else {
		tmp = x;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -0.83:
		tmp = x
	elif x <= 1.45:
		tmp = 1.0
	else:
		tmp = x
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -0.83)
		tmp = x;
	elseif (x <= 1.45)
		tmp = 1.0;
	else
		tmp = x;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -0.83)
		tmp = x;
	elseif (x <= 1.45)
		tmp = 1.0;
	else
		tmp = x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -0.83], x, If[LessEqual[x, 1.45], 1.0, x]]

Derivation

1. Split input into 2 regimes

2. if x < -0.82999999999999996 or 1.44999999999999996 < x

   1. Initial program 99.9%

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

      1. cancel-sign-sub-inv 99.9%

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

      2. +-commutative 99.9%

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

      3. associate-+l+ 99.9%

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

      4. +-commutative 99.9%

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

      5. distribute-lft-neg-out 99.9%

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

      6. distribute-rgt-neg-in 99.9%

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

      7. sin-neg 99.9%

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

      8. fma-define 99.9%

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

      9. sin-neg 99.9%

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

   3. Simplified 99.9%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around inf 80.8%

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

   if -0.82999999999999996 < x < 1.44999999999999996

   1. Initial program 99.8%

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

      1. cancel-sign-sub-inv 99.8%

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

      2. +-commutative 99.8%

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

      3. associate-+l+ 99.8%

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

      4. +-commutative 99.8%

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

      5. distribute-lft-neg-out 99.8%

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

      6. distribute-rgt-neg-in 99.8%

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

      7. sin-neg 99.8%

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

      8. fma-define 99.8%

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

      9. sin-neg 99.8%

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

   3. Simplified 99.8%

      \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
   4. Add Preprocessing

   5. Taylor expanded in x around 0 99.2%

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

      1. neg-mul-1 99.2%

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

      2. sub-neg 99.2%

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

   7. Simplified 99.2%

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

   8. Taylor expanded in y around 0 30.1%

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

Alternative 13: 61.8% 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. Step-by-step derivation

   1. cancel-sign-sub-inv 99.9%

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

   2. +-commutative 99.9%

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

   3. associate-+l+ 99.9%

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

   4. +-commutative 99.9%

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

   5. distribute-lft-neg-out 99.9%

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

   6. distribute-rgt-neg-in 99.9%

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

   7. sin-neg 99.9%

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

   8. fma-define 99.9%

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

   9. sin-neg 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
4. Add Preprocessing

5. Taylor expanded in y around 0 58.1%

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

6. Final simplification 58.1%

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

Alternative 14: 21.4% accurate, 207.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

code[x_, y_, z_] := 1.0

Derivation

1. Initial program 99.9%

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

   1. cancel-sign-sub-inv 99.9%

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

   2. +-commutative 99.9%

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

   3. associate-+l+ 99.9%

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

   4. +-commutative 99.9%

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

   5. distribute-lft-neg-out 99.9%

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

   6. distribute-rgt-neg-in 99.9%

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

   7. sin-neg 99.9%

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

   8. fma-define 99.9%

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

   9. sin-neg 99.9%

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

3. Simplified 99.9%

   \[\leadsto \color{blue}{\cos y + \mathsf{fma}\left(z, -\sin y, x\right)} \]
4. Add Preprocessing

5. Taylor expanded in x around 0 55.7%

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

   1. neg-mul-1 55.7%

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

   2. sub-neg 55.7%

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

7. Simplified 55.7%

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

8. Taylor expanded in y around 0 15.5%

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

Reproduce

herbie shell --seed 2024181 
(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))))