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

Percentage Accurate: 99.9% → 99.9%

Time: 7.2s

Alternatives: 11

Speedup: 1.0×

Specification

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 99.9% accurate, 1.0× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

   1. lift-+.f64 N/A

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

   2. +-commutative N/A

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

   3. lift-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-fma.f64 99.9

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

   6. lift-+.f64 N/A

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

   7. +-commutative N/A

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

   8. lower-+.f64 99.9

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

4. Applied rewrites 99.9%

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

5. Final simplification 99.9%

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

Alternative 2: 89.3% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{+78}:\\ \;\;\;\;\mathsf{fma}\left(\cos y, z, x + y\right)\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(1, z, x + \sin y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= z -2e+78)
   (fma (cos y) z (+ x y))
   (if (<= z 1.4e+64) (fma 1.0 z (+ x (sin y))) (* z (cos y)))))

C

double code(double x, double y, double z) {
	double tmp;
	if (z <= -2e+78) {
		tmp = fma(cos(y), z, (x + y));
	} else if (z <= 1.4e+64) {
		tmp = fma(1.0, z, (x + sin(y)));
	} else {
		tmp = z * cos(y);
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (z <= -2e+78)
		tmp = fma(cos(y), z, Float64(x + y));
	elseif (z <= 1.4e+64)
		tmp = fma(1.0, z, Float64(x + sin(y)));
	else
		tmp = Float64(z * cos(y));
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[z, -2e+78], N[(N[Cos[y], $MachinePrecision] * z + N[(x + y), $MachinePrecision]), $MachinePrecision], If[LessEqual[z, 1.4e+64], N[(1.0 * z + N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if z < -2.00000000000000002e78

   1. Initial program 99.9%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 99.9

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 99.9

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

   4. Applied rewrites 99.9%

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

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\cos y, z, \color{blue}{x + y}\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 89.8

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

   7. Applied rewrites 89.8%

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

   if -2.00000000000000002e78 < z < 1.40000000000000012e64

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 96.3%

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

   if 1.40000000000000012e64 < z

   1. Initial program 99.8%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 93.4

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

   5. Applied rewrites 93.4%

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

4. Final simplification 94.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -2 \cdot 10^{+78}:\\ \;\;\;\;\mathsf{fma}\left(\cos y, z, x + y\right)\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(1, z, x + \sin y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 89.1% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;z \leq -1.45 \cdot 10^{+104}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(1, z, x + \sin y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= z -1.45e+104)
     t_0
     (if (<= z 1.4e+64) (fma 1.0 z (+ x (sin y))) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (z <= -1.45e+104) {
		tmp = t_0;
	} else if (z <= 1.4e+64) {
		tmp = fma(1.0, z, (x + sin(y)));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (z <= -1.45e+104)
		tmp = t_0;
	elseif (z <= 1.4e+64)
		tmp = fma(1.0, z, Float64(x + sin(y)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -1.45e+104], t$95$0, If[LessEqual[z, 1.4e+64], N[(1.0 * z + N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -1.4499999999999999e104 or 1.40000000000000012e64 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 88.1

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

   5. Applied rewrites 88.1%

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

   if -1.4499999999999999e104 < z < 1.40000000000000012e64

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

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

   7. Applied rewrites 95.3%

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

4. Final simplification 92.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.45 \cdot 10^{+104}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;z \leq 1.4 \cdot 10^{+64}:\\ \;\;\;\;\mathsf{fma}\left(1, z, x + \sin y\right)\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 81.9% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := z \cdot \cos y\\ \mathbf{if}\;z \leq -8.5 \cdot 10^{+53}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;z \leq 1.08 \cdot 10^{+64}:\\ \;\;\;\;x + \sin y\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (* z (cos y))))
   (if (<= z -8.5e+53) t_0 (if (<= z 1.08e+64) (+ x (sin y)) t_0))))

C

double code(double x, double y, double z) {
	double t_0 = z * cos(y);
	double tmp;
	if (z <= -8.5e+53) {
		tmp = t_0;
	} else if (z <= 1.08e+64) {
		tmp = x + sin(y);
	} else {
		tmp = 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 * cos(y)
    if (z <= (-8.5d+53)) then
        tmp = t_0
    else if (z <= 1.08d+64) then
        tmp = x + sin(y)
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double t_0 = z * Math.cos(y);
	double tmp;
	if (z <= -8.5e+53) {
		tmp = t_0;
	} else if (z <= 1.08e+64) {
		tmp = x + Math.sin(y);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(x, y, z):
	t_0 = z * math.cos(y)
	tmp = 0
	if z <= -8.5e+53:
		tmp = t_0
	elif z <= 1.08e+64:
		tmp = x + math.sin(y)
	else:
		tmp = t_0
	return tmp

Julia

function code(x, y, z)
	t_0 = Float64(z * cos(y))
	tmp = 0.0
	if (z <= -8.5e+53)
		tmp = t_0;
	elseif (z <= 1.08e+64)
		tmp = Float64(x + sin(y));
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	t_0 = z * cos(y);
	tmp = 0.0;
	if (z <= -8.5e+53)
		tmp = t_0;
	elseif (z <= 1.08e+64)
		tmp = x + sin(y);
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(z * N[Cos[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[z, -8.5e+53], t$95$0, If[LessEqual[z, 1.08e+64], N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if z < -8.5000000000000002e53 or 1.08000000000000007e64 < z

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. lower-cos.f64 85.8

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

   5. Applied rewrites 85.8%

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

   if -8.5000000000000002e53 < z < 1.08000000000000007e64

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-sin.f64 87.6

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

   5. Applied rewrites 87.6%

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

4. Final simplification 87.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -8.5 \cdot 10^{+53}:\\ \;\;\;\;z \cdot \cos y\\ \mathbf{elif}\;z \leq 1.08 \cdot 10^{+64}:\\ \;\;\;\;x + \sin y\\ \mathbf{else}:\\ \;\;\;\;z \cdot \cos y\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 80.3% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \sin y\\ \mathbf{if}\;y \leq -0.002:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, y \cdot y, 0.041666666666666664\right), y \cdot y, -0.5\right), y \cdot y, 1\right), z, x + y\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (let* ((t_0 (+ x (sin y))))
   (if (<= y -0.002)
     t_0
     (if (<= y 2.7e+35)
       (fma
        (fma
         (fma
          (fma -0.001388888888888889 (* y y) 0.041666666666666664)
          (* y y)
          -0.5)
         (* y y)
         1.0)
        z
        (+ x y))
       t_0))))

C

double code(double x, double y, double z) {
	double t_0 = x + sin(y);
	double tmp;
	if (y <= -0.002) {
		tmp = t_0;
	} else if (y <= 2.7e+35) {
		tmp = fma(fma(fma(fma(-0.001388888888888889, (y * y), 0.041666666666666664), (y * y), -0.5), (y * y), 1.0), z, (x + y));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(x, y, z)
	t_0 = Float64(x + sin(y))
	tmp = 0.0
	if (y <= -0.002)
		tmp = t_0;
	elseif (y <= 2.7e+35)
		tmp = fma(fma(fma(fma(-0.001388888888888889, Float64(y * y), 0.041666666666666664), Float64(y * y), -0.5), Float64(y * y), 1.0), z, Float64(x + y));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := Block[{t$95$0 = N[(x + N[Sin[y], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -0.002], t$95$0, If[LessEqual[y, 2.7e+35], N[(N[(N[(N[(-0.001388888888888889 * N[(y * y), $MachinePrecision] + 0.041666666666666664), $MachinePrecision] * N[(y * y), $MachinePrecision] + -0.5), $MachinePrecision] * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * z + N[(x + y), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -2e-3 or 2.70000000000000003e35 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. lower-sin.f64 65.5

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

   5. Applied rewrites 65.5%

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

   if -2e-3 < y < 2.70000000000000003e35

   1. Initial program 100.0%

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

      1. lift-+.f64 N/A

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

      2. +-commutative N/A

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

      3. lift-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 100.0

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

      6. lift-+.f64 N/A

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

      7. +-commutative N/A

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

      8. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\cos y, z, \color{blue}{x + y}\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

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

      2. lower-+.f64 100.0

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

   7. Applied rewrites 100.0%

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

   8. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{1 + {y}^{2} \cdot \left({y}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) - \frac{1}{2}\right)}, z, y + x\right) \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{{y}^{2} \cdot \left({y}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) - \frac{1}{2}\right) + 1}, z, y + x\right) \]

      2. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\left({y}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) - \frac{1}{2}\right) \cdot {y}^{2}} + 1, z, y + x\right) \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\color{blue}{\mathsf{fma}\left({y}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) - \frac{1}{2}, {y}^{2}, 1\right)}, z, y + x\right) \]

      4. sub-neg N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{{y}^{2} \cdot \left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right)}, {y}^{2}, 1\right), z, y + x\right) \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) \cdot {y}^{2}} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right), {y}^{2}, 1\right), z, y + x\right) \]

      6. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}\right) \cdot {y}^{2} + \color{blue}{\frac{-1}{2}}, {y}^{2}, 1\right), z, y + x\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\mathsf{fma}\left(\frac{1}{24} + \frac{-1}{720} \cdot {y}^{2}, {y}^{2}, \frac{-1}{2}\right)}, {y}^{2}, 1\right), z, y + x\right) \]

      8. +-commutative N/A

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\color{blue}{\frac{-1}{720} \cdot {y}^{2} + \frac{1}{24}}, {y}^{2}, \frac{-1}{2}\right), {y}^{2}, 1\right), z, y + x\right) \]

      9. lower-fma.f64 N/A

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

      10. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{720}, \color{blue}{y \cdot y}, \frac{1}{24}\right), {y}^{2}, \frac{-1}{2}\right), {y}^{2}, 1\right), z, y + x\right) \]

      11. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{720}, \color{blue}{y \cdot y}, \frac{1}{24}\right), {y}^{2}, \frac{-1}{2}\right), {y}^{2}, 1\right), z, y + x\right) \]

      12. unpow2 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{720}, y \cdot y, \frac{1}{24}\right), \color{blue}{y \cdot y}, \frac{-1}{2}\right), {y}^{2}, 1\right), z, y + x\right) \]

      13. lower-*.f64 N/A

          \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{-1}{720}, y \cdot y, \frac{1}{24}\right), \color{blue}{y \cdot y}, \frac{-1}{2}\right), {y}^{2}, 1\right), z, y + x\right) \]

      14. unpow2 N/A

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

      15. lower-*.f64 96.0

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

   10. Applied rewrites 96.0%

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

4. Final simplification 81.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -0.002:\\ \;\;\;\;x + \sin y\\ \mathbf{elif}\;y \leq 2.7 \cdot 10^{+35}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.001388888888888889, y \cdot y, 0.041666666666666664\right), y \cdot y, -0.5\right), y \cdot y, 1\right), z, x + y\right)\\ \mathbf{else}:\\ \;\;\;\;x + \sin y\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 70.6% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -5:\\ \;\;\;\;x + z\\ \mathbf{elif}\;y \leq 4.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, -0.5 \cdot z\right), y, 1\right), y, x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -5.0)
   (+ x z)
   (if (<= y 4.6)
     (fma (fma (fma -0.16666666666666666 y (* -0.5 z)) y 1.0) y (+ x z))
     (+ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -5.0) {
		tmp = x + z;
	} else if (y <= 4.6) {
		tmp = fma(fma(fma(-0.16666666666666666, y, (-0.5 * z)), y, 1.0), y, (x + z));
	} else {
		tmp = x + z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -5.0)
		tmp = Float64(x + z);
	elseif (y <= 4.6)
		tmp = fma(fma(fma(-0.16666666666666666, y, Float64(-0.5 * z)), y, 1.0), y, Float64(x + z));
	else
		tmp = Float64(x + z);
	end
	return tmp
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -5.0], N[(x + z), $MachinePrecision], If[LessEqual[y, 4.6], N[(N[(N[(-0.16666666666666666 * y + N[(-0.5 * z), $MachinePrecision]), $MachinePrecision] * y + 1.0), $MachinePrecision] * y + N[(x + z), $MachinePrecision]), $MachinePrecision], N[(x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -5 or 4.5999999999999996 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 37.0

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

   5. Applied rewrites 37.0%

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

   if -5 < y < 4.5999999999999996

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 99.2

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

   5. Applied rewrites 99.2%

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

4. Final simplification 69.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -5:\\ \;\;\;\;x + z\\ \mathbf{elif}\;y \leq 4.6:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, y, -0.5 \cdot z\right), y, 1\right), y, x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 70.4% accurate, 6.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.08 \cdot 10^{+27}:\\ \;\;\;\;x + z\\ \mathbf{elif}\;y \leq 0.125:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666 \cdot y, y, 1\right), y, x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -1.08e+27)
   (+ x z)
   (if (<= y 0.125)
     (fma (fma (* -0.16666666666666666 y) y 1.0) y (+ x z))
     (+ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -1.08e+27) {
		tmp = x + z;
	} else if (y <= 0.125) {
		tmp = fma(fma((-0.16666666666666666 * y), y, 1.0), y, (x + z));
	} else {
		tmp = x + z;
	}
	return tmp;
}

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -1.08e+27)
		tmp = Float64(x + z);
	elseif (y <= 0.125)
		tmp = fma(fma(Float64(-0.16666666666666666 * y), y, 1.0), y, Float64(x + z));
	else
		tmp = Float64(x + z);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.08e27 or 0.125 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 38.2

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

   5. Applied rewrites 38.2%

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

   if -1.08e27 < y < 0.125

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. associate-+r+ N/A

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

      2. +-commutative N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

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

      5. +-commutative N/A

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

      6. *-commutative N/A

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

      7. lower-fma.f64 N/A

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

      8. +-commutative N/A

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

      9. lower-fma.f64 N/A

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

      10. lower-*.f64 N/A

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

      11. +-commutative N/A

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

      12. lower-+.f64 97.0

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

   5. Applied rewrites 97.0%

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

   6. Taylor expanded in z around 0

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

   8. Applied rewrites 97.1%

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

4. Final simplification 69.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.08 \cdot 10^{+27}:\\ \;\;\;\;x + z\\ \mathbf{elif}\;y \leq 0.125:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666 \cdot y, y, 1\right), y, x + z\right)\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 70.2% accurate, 11.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -6 \cdot 10^{+72}:\\ \;\;\;\;x + z\\ \mathbf{elif}\;y \leq 0.125:\\ \;\;\;\;\left(x + y\right) + z\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= y -6e+72) (+ x z) (if (<= y 0.125) (+ (+ x y) z) (+ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (y <= -6e+72) {
		tmp = x + z;
	} else if (y <= 0.125) {
		tmp = (x + y) + z;
	} else {
		tmp = x + z;
	}
	return tmp;
}

Fortran

real(8) function code(x, y, z)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8) :: tmp
    if (y <= (-6d+72)) then
        tmp = x + z
    else if (y <= 0.125d0) then
        tmp = (x + y) + z
    else
        tmp = x + z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (y <= -6e+72) {
		tmp = x + z;
	} else if (y <= 0.125) {
		tmp = (x + y) + z;
	} else {
		tmp = x + z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if y <= -6e+72:
		tmp = x + z
	elif y <= 0.125:
		tmp = (x + y) + z
	else:
		tmp = x + z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (y <= -6e+72)
		tmp = Float64(x + z);
	elseif (y <= 0.125)
		tmp = Float64(Float64(x + y) + z);
	else
		tmp = Float64(x + z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (y <= -6e+72)
		tmp = x + z;
	elseif (y <= 0.125)
		tmp = (x + y) + z;
	else
		tmp = x + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[y, -6e+72], N[(x + z), $MachinePrecision], If[LessEqual[y, 0.125], N[(N[(x + y), $MachinePrecision] + z), $MachinePrecision], N[(x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if y < -6.00000000000000006e72 or 0.125 < y

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 37.5

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

   5. Applied rewrites 37.5%

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

   if -6.00000000000000006e72 < y < 0.125

   1. Initial program 100.0%

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

   3. Taylor expanded in y around 0

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

      1. associate-+r+ N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 93.3

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

   5. Applied rewrites 93.3%

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

4. Final simplification 68.9%

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

Alternative 9: 67.4% accurate, 13.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{-80}:\\ \;\;\;\;x + z\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{-46}:\\ \;\;\;\;z + y\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -4.7e-80) (+ x z) (if (<= x 1.6e-46) (+ z y) (+ x z))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.7e-80) {
		tmp = x + z;
	} else if (x <= 1.6e-46) {
		tmp = z + y;
	} else {
		tmp = x + 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 <= (-4.7d-80)) then
        tmp = x + z
    else if (x <= 1.6d-46) then
        tmp = z + y
    else
        tmp = x + z
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -4.7e-80) {
		tmp = x + z;
	} else if (x <= 1.6e-46) {
		tmp = z + y;
	} else {
		tmp = x + z;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -4.7e-80:
		tmp = x + z
	elif x <= 1.6e-46:
		tmp = z + y
	else:
		tmp = x + z
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -4.7e-80)
		tmp = Float64(x + z);
	elseif (x <= 1.6e-46)
		tmp = Float64(z + y);
	else
		tmp = Float64(x + z);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -4.7e-80)
		tmp = x + z;
	elseif (x <= 1.6e-46)
		tmp = z + y;
	else
		tmp = x + z;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -4.7e-80], N[(x + z), $MachinePrecision], If[LessEqual[x, 1.6e-46], N[(z + y), $MachinePrecision], N[(x + z), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -4.69999999999999973e-80 or 1.6e-46 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 82.5

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

   5. Applied rewrites 82.5%

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

   if -4.69999999999999973e-80 < x < 1.6e-46

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 34.1

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

   5. Applied rewrites 34.1%

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

   6. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 47.5

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

   8. Applied rewrites 47.5%

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

   9. Taylor expanded in x around 0

      \[\leadsto y + \color{blue}{z} \]
   10. Step-by-step derivation

   11. Applied rewrites 43.6%

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

4. Final simplification 66.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.7 \cdot 10^{-80}:\\ \;\;\;\;x + z\\ \mathbf{elif}\;x \leq 1.6 \cdot 10^{-46}:\\ \;\;\;\;z + y\\ \mathbf{else}:\\ \;\;\;\;x + z\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 50.2% accurate, 13.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+69}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+80}:\\ \;\;\;\;z + y\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \end{array} \]

FPCore

(FPCore (x y z)
 :precision binary64
 (if (<= x -1.5e+69) (+ x y) (if (<= x 4e+80) (+ z y) (+ x y))))

C

double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.5e+69) {
		tmp = x + y;
	} else if (x <= 4e+80) {
		tmp = z + y;
	} else {
		tmp = x + 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.5d+69)) then
        tmp = x + y
    else if (x <= 4d+80) then
        tmp = z + y
    else
        tmp = x + y
    end if
    code = tmp
end function

Java

public static double code(double x, double y, double z) {
	double tmp;
	if (x <= -1.5e+69) {
		tmp = x + y;
	} else if (x <= 4e+80) {
		tmp = z + y;
	} else {
		tmp = x + y;
	}
	return tmp;
}

Python

def code(x, y, z):
	tmp = 0
	if x <= -1.5e+69:
		tmp = x + y
	elif x <= 4e+80:
		tmp = z + y
	else:
		tmp = x + y
	return tmp

Julia

function code(x, y, z)
	tmp = 0.0
	if (x <= -1.5e+69)
		tmp = Float64(x + y);
	elseif (x <= 4e+80)
		tmp = Float64(z + y);
	else
		tmp = Float64(x + y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y, z)
	tmp = 0.0;
	if (x <= -1.5e+69)
		tmp = x + y;
	elseif (x <= 4e+80)
		tmp = z + y;
	else
		tmp = x + y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_, z_] := If[LessEqual[x, -1.5e+69], N[(x + y), $MachinePrecision], If[LessEqual[x, 4e+80], N[(z + y), $MachinePrecision], N[(x + y), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if x < -1.49999999999999992e69 or 4e80 < x

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 89.9

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

   5. Applied rewrites 89.9%

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

   6. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 79.3

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

   8. Applied rewrites 79.3%

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

   9. Taylor expanded in z around 0

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

   11. Applied rewrites 70.3%

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

   if -1.49999999999999992e69 < x < 4e80

   1. Initial program 99.9%

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

   3. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 43.7

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

   5. Applied rewrites 43.7%

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

   6. Taylor expanded in y around 0

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

      1. +-commutative N/A

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

      2. lower-+.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-+.f64 49.0

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

   8. Applied rewrites 49.0%

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

   9. Taylor expanded in x around 0

      \[\leadsto y + \color{blue}{z} \]
   10. Step-by-step derivation

   11. Applied rewrites 39.8%

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

4. Final simplification 52.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.5 \cdot 10^{+69}:\\ \;\;\;\;x + y\\ \mathbf{elif}\;x \leq 4 \cdot 10^{+80}:\\ \;\;\;\;z + y\\ \mathbf{else}:\\ \;\;\;\;x + y\\ \end{array} \]
5. Add Preprocessing

Alternative 11: 38.3% accurate, 53.0× speedup

Math

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

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 99.9%

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

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 63.0

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

5. Applied rewrites 63.0%

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

6. Taylor expanded in y around 0

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

   1. +-commutative N/A

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

   2. lower-+.f64 N/A

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

   3. +-commutative N/A

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

   4. lower-+.f64 61.7

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

8. Applied rewrites 61.7%

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

9. Taylor expanded in z around 0

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

11. Applied rewrites 41.2%

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

12. Final simplification 41.2%

    \[\leadsto x + y \]
13. Add Preprocessing

Reproduce

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