bug1188 (missed optimization)

Percentage Accurate: 53.2% → 98.8%

Time: 1.5s

Alternatives: 5

Speedup: 0.9×

Specification

Math

\[\sin \left(\pi \cdot x\right) \]

FPCore

(FPCore (x)
  :precision binary64
  (sin (* PI x)))

C

double code(double x) {
	return sin((((double) M_PI) * x));
}

Java

public static double code(double x) {
	return Math.sin((Math.PI * x));
}

Python

def code(x):
	return math.sin((math.pi * x))

Julia

function code(x)
	return sin(Float64(pi * x))
end

MATLAB

function tmp = code(x)
	tmp = sin((pi * x));
end

Wolfram

code[x_] := N[Sin[N[(Pi * x), $MachinePrecision]], $MachinePrecision]

Initial Program: 53.2% accurate, 1.0× speedup

Math

\[\sin \left(\pi \cdot x\right) \]

FPCore

(FPCore (x)
  :precision binary64
  (sin (* PI x)))

C

double code(double x) {
	return sin((((double) M_PI) * x));
}

Java

public static double code(double x) {
	return Math.sin((Math.PI * x));
}

Python

def code(x):
	return math.sin((math.pi * x))

Julia

function code(x)
	return sin(Float64(pi * x))
end

MATLAB

function tmp = code(x)
	tmp = sin((pi * x));
end

Wolfram

code[x_] := N[Sin[N[(Pi * x), $MachinePrecision]], $MachinePrecision]

Alternative 1: 98.8% accurate, 0.5× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 3500000000000:\\ \;\;\;\;\sin \left(\pi \cdot \left|x\right|\right)\\ \mathbf{else}:\\ \;\;\;\;\left|x\right| \cdot 0\\ \end{array} \]

FPCore

(FPCore (x)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<= (fabs x) 3500000000000)
   (sin (* PI (fabs x)))
   (* (fabs x) 0))))

C

double code(double x) {
	double tmp;
	if (fabs(x) <= 3500000000000.0) {
		tmp = sin((((double) M_PI) * fabs(x)));
	} else {
		tmp = fabs(x) * 0.0;
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (Math.abs(x) <= 3500000000000.0) {
		tmp = Math.sin((Math.PI * Math.abs(x)));
	} else {
		tmp = Math.abs(x) * 0.0;
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x):
	tmp = 0
	if math.fabs(x) <= 3500000000000.0:
		tmp = math.sin((math.pi * math.fabs(x)))
	else:
		tmp = math.fabs(x) * 0.0
	return math.copysign(1.0, x) * tmp

Julia

function code(x)
	tmp = 0.0
	if (abs(x) <= 3500000000000.0)
		tmp = sin(Float64(pi * abs(x)));
	else
		tmp = Float64(abs(x) * 0.0);
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (abs(x) <= 3500000000000.0)
		tmp = sin((pi * abs(x)));
	else
		tmp = abs(x) * 0.0;
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 3500000000000], N[Sin[N[(Pi * N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision], N[(N[Abs[x], $MachinePrecision] * 0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 3.5e12

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   if 3.5e12 < x

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto x \cdot \pi \]
   6. Step-by-step derivation

      1. lower-PI.f64 51.0%

         \[\leadsto x \cdot \pi \]

   7. Applied rewrites 51.0%

      \[\leadsto x \cdot \pi \]

   8. Taylor expanded in undef-var around zero

      \[\leadsto x \cdot 0 \]
   9. Step-by-step derivation

   10. Applied rewrites 50.0%

       \[\leadsto x \cdot 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 97.4% accurate, 0.7× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 225:\\ \;\;\;\;\left(\left(1 - \left(\left(\left(\left|x\right| \cdot \left|x\right|\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \left|x\right|\right) \cdot \pi\\ \mathbf{else}:\\ \;\;\;\;\left|x\right| \cdot 0\\ \end{array} \]

FPCore

(FPCore (x)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<= (fabs x) 225)
   (*
    (* (- 1 (* (* (* (* (fabs x) (fabs x)) 1/6) PI) PI)) (fabs x))
    PI)
   (* (fabs x) 0))))

C

double code(double x) {
	double tmp;
	if (fabs(x) <= 225.0) {
		tmp = ((1.0 - ((((fabs(x) * fabs(x)) * 0.16666666666666666) * ((double) M_PI)) * ((double) M_PI))) * fabs(x)) * ((double) M_PI);
	} else {
		tmp = fabs(x) * 0.0;
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (Math.abs(x) <= 225.0) {
		tmp = ((1.0 - ((((Math.abs(x) * Math.abs(x)) * 0.16666666666666666) * Math.PI) * Math.PI)) * Math.abs(x)) * Math.PI;
	} else {
		tmp = Math.abs(x) * 0.0;
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x):
	tmp = 0
	if math.fabs(x) <= 225.0:
		tmp = ((1.0 - ((((math.fabs(x) * math.fabs(x)) * 0.16666666666666666) * math.pi) * math.pi)) * math.fabs(x)) * math.pi
	else:
		tmp = math.fabs(x) * 0.0
	return math.copysign(1.0, x) * tmp

Julia

function code(x)
	tmp = 0.0
	if (abs(x) <= 225.0)
		tmp = Float64(Float64(Float64(1.0 - Float64(Float64(Float64(Float64(abs(x) * abs(x)) * 0.16666666666666666) * pi) * pi)) * abs(x)) * pi);
	else
		tmp = Float64(abs(x) * 0.0);
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (abs(x) <= 225.0)
		tmp = ((1.0 - ((((abs(x) * abs(x)) * 0.16666666666666666) * pi) * pi)) * abs(x)) * pi;
	else
		tmp = abs(x) * 0.0;
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 225], N[(N[(N[(1 - N[(N[(N[(N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision] * 1/6), $MachinePrecision] * Pi), $MachinePrecision] * Pi), $MachinePrecision]), $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision] * Pi), $MachinePrecision], N[(N[Abs[x], $MachinePrecision] * 0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 225

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

      \[\leadsto \color{blue}{x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. add-flip N/A

         \[\leadsto x \cdot \left(\pi - \color{blue}{\left(\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)\right)}\right) \]

      3. sub-to-mult N/A

         \[\leadsto x \cdot \left(\left(1 - \frac{\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)}{\pi}\right) \cdot \color{blue}{\pi}\right) \]

      4. lower-unsound-*.f64 N/A

         \[\leadsto x \cdot \left(\left(1 - \frac{\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)}{\pi}\right) \cdot \color{blue}{\pi}\right) \]

   6. Applied rewrites 51.1%

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

      1. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\left(1 - \frac{\left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)}{\pi}\right) \cdot \color{blue}{\pi}\right) \]

      2. lift--.f64 N/A

         \[\leadsto x \cdot \left(\left(1 - \frac{\left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)}{\pi}\right) \cdot \pi\right) \]

      3. lift-/.f64 N/A

         \[\leadsto x \cdot \left(\left(1 - \frac{\left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)}{\pi}\right) \cdot \pi\right) \]

      4. sub-to-fraction N/A

         \[\leadsto x \cdot \left(\frac{1 \cdot \pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)}{\pi} \cdot \pi\right) \]

      5. associate-*l/ N/A

         \[\leadsto x \cdot \frac{\left(1 \cdot \pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \cdot \pi}{\color{blue}{\pi}} \]

      6. lower-/.f64 N/A

         \[\leadsto x \cdot \frac{\left(1 \cdot \pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \cdot \pi}{\color{blue}{\pi}} \]

   8. Applied rewrites 51.1%

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

      1. lift-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\frac{\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi}{\pi}} \]

      2. lift-/.f64 N/A

         \[\leadsto x \cdot \frac{\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi}{\color{blue}{\pi}} \]

      3. mult-flip N/A

         \[\leadsto x \cdot \left(\left(\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \color{blue}{\frac{1}{\pi}}\right) \]

      4. mult-flip N/A

         \[\leadsto x \cdot \frac{\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi}{\color{blue}{\pi}} \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \frac{\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi\right) \cdot \pi}{\pi} \]

   10. Applied rewrites 51.1%

       \[\leadsto \color{blue}{\left(\left(1 - \left(\left(\left(x \cdot x\right) \cdot \frac{1}{6}\right) \cdot \pi\right) \cdot \pi\right) \cdot x\right) \cdot \pi} \]

   if 225 < x

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto x \cdot \pi \]
   6. Step-by-step derivation

      1. lower-PI.f64 51.0%

         \[\leadsto x \cdot \pi \]

   7. Applied rewrites 51.0%

      \[\leadsto x \cdot \pi \]

   8. Taylor expanded in undef-var around zero

      \[\leadsto x \cdot 0 \]
   9. Step-by-step derivation

   10. Applied rewrites 50.0%

       \[\leadsto x \cdot 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 97.4% accurate, 0.7× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 225:\\ \;\;\;\;\left|x\right| \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot \left(\left|x\right| \cdot \left|x\right|\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left|x\right| \cdot 0\\ \end{array} \]

FPCore

(FPCore (x)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<= (fabs x) 225)
   (*
    (fabs x)
    (- PI (* (* (* 1/6 (* (fabs x) (fabs x))) PI) (* PI PI))))
   (* (fabs x) 0))))

C

double code(double x) {
	double tmp;
	if (fabs(x) <= 225.0) {
		tmp = fabs(x) * (((double) M_PI) - (((0.16666666666666666 * (fabs(x) * fabs(x))) * ((double) M_PI)) * (((double) M_PI) * ((double) M_PI))));
	} else {
		tmp = fabs(x) * 0.0;
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (Math.abs(x) <= 225.0) {
		tmp = Math.abs(x) * (Math.PI - (((0.16666666666666666 * (Math.abs(x) * Math.abs(x))) * Math.PI) * (Math.PI * Math.PI)));
	} else {
		tmp = Math.abs(x) * 0.0;
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x):
	tmp = 0
	if math.fabs(x) <= 225.0:
		tmp = math.fabs(x) * (math.pi - (((0.16666666666666666 * (math.fabs(x) * math.fabs(x))) * math.pi) * (math.pi * math.pi)))
	else:
		tmp = math.fabs(x) * 0.0
	return math.copysign(1.0, x) * tmp

Julia

function code(x)
	tmp = 0.0
	if (abs(x) <= 225.0)
		tmp = Float64(abs(x) * Float64(pi - Float64(Float64(Float64(0.16666666666666666 * Float64(abs(x) * abs(x))) * pi) * Float64(pi * pi))));
	else
		tmp = Float64(abs(x) * 0.0);
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (abs(x) <= 225.0)
		tmp = abs(x) * (pi - (((0.16666666666666666 * (abs(x) * abs(x))) * pi) * (pi * pi)));
	else
		tmp = abs(x) * 0.0;
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 225], N[(N[Abs[x], $MachinePrecision] * N[(Pi - N[(N[(N[(1/6 * N[(N[Abs[x], $MachinePrecision] * N[Abs[x], $MachinePrecision]), $MachinePrecision]), $MachinePrecision] * Pi), $MachinePrecision] * N[(Pi * Pi), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Abs[x], $MachinePrecision] * 0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 225

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

      \[\leadsto \color{blue}{x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

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

      2. add-flip N/A

         \[\leadsto x \cdot \left(\pi - \color{blue}{\left(\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)\right)}\right) \]

      3. lower--.f64 N/A

         \[\leadsto x \cdot \left(\pi - \color{blue}{\left(\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)\right)}\right) \]

      4. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)\right)\right) \]

      5. lift-*.f64 N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right)\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\left(\frac{-1}{6} \cdot {x}^{2}\right) \cdot {\pi}^{3}\right)\right)\right) \]

      7. distribute-lft-neg-in N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot \color{blue}{{\pi}^{3}}\right) \]

      8. lift-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot {\pi}^{\color{blue}{3}}\right) \]

      9. cube-mult N/A

         \[\leadsto x \cdot \left(\pi - \left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot \left(\pi \cdot \color{blue}{\left(\pi \cdot \pi\right)}\right)\right) \]

      10. associate-*r* N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot \pi\right) \cdot \color{blue}{\left(\pi \cdot \pi\right)}\right) \]

      11. lower-*.f64 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot \pi\right) \cdot \color{blue}{\left(\pi \cdot \pi\right)}\right) \]

      12. lower-*.f64 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\mathsf{neg}\left(\frac{-1}{6} \cdot {x}^{2}\right)\right) \cdot \pi\right) \cdot \left(\color{blue}{\pi} \cdot \pi\right)\right) \]

      13. distribute-lft-neg-out N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\left(\mathsf{neg}\left(\frac{-1}{6}\right)\right) \cdot {x}^{2}\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      14. lower-*.f64 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\left(\mathsf{neg}\left(\frac{-1}{6}\right)\right) \cdot {x}^{2}\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      15. metadata-eval N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot {x}^{2}\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      16. lift-pow.f64 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot {x}^{2}\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      17. unpow2 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      18. lower-*.f64 N/A

          \[\leadsto x \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)\right) \]

      19. lower-*.f64 51.1%

          \[\leadsto x \cdot \left(\pi - \left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \color{blue}{\pi}\right)\right) \]

   6. Applied rewrites 51.1%

      \[\leadsto x \cdot \left(\pi - \color{blue}{\left(\left(\frac{1}{6} \cdot \left(x \cdot x\right)\right) \cdot \pi\right) \cdot \left(\pi \cdot \pi\right)}\right) \]

   if 225 < x

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto x \cdot \pi \]
   6. Step-by-step derivation

      1. lower-PI.f64 51.0%

         \[\leadsto x \cdot \pi \]

   7. Applied rewrites 51.0%

      \[\leadsto x \cdot \pi \]

   8. Taylor expanded in undef-var around zero

      \[\leadsto x \cdot 0 \]
   9. Step-by-step derivation

   10. Applied rewrites 50.0%

       \[\leadsto x \cdot 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 97.1% accurate, 0.9× speedup

Math

\[\mathsf{copysign}\left(1, x\right) \cdot \begin{array}{l} \mathbf{if}\;\left|x\right| \leq 2150000000:\\ \;\;\;\;\left|x\right| \cdot \pi\\ \mathbf{else}:\\ \;\;\;\;\left|x\right| \cdot 0\\ \end{array} \]

FPCore

(FPCore (x)
  :precision binary64
  (*
 (copysign 1 x)
 (if (<= (fabs x) 2150000000) (* (fabs x) PI) (* (fabs x) 0))))

C

double code(double x) {
	double tmp;
	if (fabs(x) <= 2150000000.0) {
		tmp = fabs(x) * ((double) M_PI);
	} else {
		tmp = fabs(x) * 0.0;
	}
	return copysign(1.0, x) * tmp;
}

Java

public static double code(double x) {
	double tmp;
	if (Math.abs(x) <= 2150000000.0) {
		tmp = Math.abs(x) * Math.PI;
	} else {
		tmp = Math.abs(x) * 0.0;
	}
	return Math.copySign(1.0, x) * tmp;
}

Python

def code(x):
	tmp = 0
	if math.fabs(x) <= 2150000000.0:
		tmp = math.fabs(x) * math.pi
	else:
		tmp = math.fabs(x) * 0.0
	return math.copysign(1.0, x) * tmp

Julia

function code(x)
	tmp = 0.0
	if (abs(x) <= 2150000000.0)
		tmp = Float64(abs(x) * pi);
	else
		tmp = Float64(abs(x) * 0.0);
	end
	return Float64(copysign(1.0, x) * tmp)
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (abs(x) <= 2150000000.0)
		tmp = abs(x) * pi;
	else
		tmp = abs(x) * 0.0;
	end
	tmp_2 = (sign(x) * abs(1.0)) * tmp;
end

Wolfram

code[x_] := N[(N[With[{TMP1 = Abs[1], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision] * If[LessEqual[N[Abs[x], $MachinePrecision], 2150000000], N[(N[Abs[x], $MachinePrecision] * Pi), $MachinePrecision], N[(N[Abs[x], $MachinePrecision] * 0), $MachinePrecision]]), $MachinePrecision]

Derivation

1. Split input into 2 regimes

2. if x < 2.15e9

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto x \cdot \pi \]
   6. Step-by-step derivation

      1. lower-PI.f64 51.0%

         \[\leadsto x \cdot \pi \]

   7. Applied rewrites 51.0%

      \[\leadsto x \cdot \pi \]

   if 2.15e9 < x

   1. Initial program 53.2%

      \[\sin \left(\pi \cdot x\right) \]

   2. Taylor expanded in x around 0

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

      1. lower-*.f64 N/A

         \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

      2. lower-+.f64 N/A

         \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      3. lower-PI.f64 N/A

         \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

      4. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

      5. lower-*.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

      6. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

      7. lower-pow.f64 N/A

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

      8. lower-PI.f64 51.1%

         \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

   4. Applied rewrites 51.1%

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

   5. Taylor expanded in x around 0

      \[\leadsto x \cdot \pi \]
   6. Step-by-step derivation

      1. lower-PI.f64 51.0%

         \[\leadsto x \cdot \pi \]

   7. Applied rewrites 51.0%

      \[\leadsto x \cdot \pi \]

   8. Taylor expanded in undef-var around zero

      \[\leadsto x \cdot 0 \]
   9. Step-by-step derivation

   10. Applied rewrites 50.0%

       \[\leadsto x \cdot 0 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 50.0% accurate, 17.7× speedup

Math

\[x \cdot 0 \]

FPCore

(FPCore (x)
  :precision binary64
  (* x 0))

C

double code(double x) {
	return x * 0.0;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = x * 0.0d0
end function

Java

public static double code(double x) {
	return x * 0.0;
}

Python

def code(x):
	return x * 0.0

Julia

function code(x)
	return Float64(x * 0.0)
end

MATLAB

function tmp = code(x)
	tmp = x * 0.0;
end

Wolfram

code[x_] := N[(x * 0), $MachinePrecision]

Derivation

1. Initial program 53.2%

   \[\sin \left(\pi \cdot x\right) \]

2. Taylor expanded in x around 0

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

   1. lower-*.f64 N/A

      \[\leadsto x \cdot \color{blue}{\left(\mathsf{PI}\left(\right) + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right)} \]

   2. lower-+.f64 N/A

      \[\leadsto x \cdot \left(\mathsf{PI}\left(\right) + \color{blue}{\frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

   3. lower-PI.f64 N/A

      \[\leadsto x \cdot \left(\pi + \color{blue}{\frac{-1}{6}} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)\right) \]

   4. lower-*.f64 N/A

      \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \color{blue}{\left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{3}\right)}\right) \]

   5. lower-*.f64 N/A

      \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot \color{blue}{{\mathsf{PI}\left(\right)}^{3}}\right)\right) \]

   6. lower-pow.f64 N/A

      \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\color{blue}{\mathsf{PI}\left(\right)}}^{3}\right)\right) \]

   7. lower-pow.f64 N/A

      \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\mathsf{PI}\left(\right)}^{\color{blue}{3}}\right)\right) \]

   8. lower-PI.f64 51.1%

      \[\leadsto x \cdot \left(\pi + \frac{-1}{6} \cdot \left({x}^{2} \cdot {\pi}^{3}\right)\right) \]

4. Applied rewrites 51.1%

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

5. Taylor expanded in x around 0

   \[\leadsto x \cdot \pi \]
6. Step-by-step derivation

   1. lower-PI.f64 51.0%

      \[\leadsto x \cdot \pi \]

7. Applied rewrites 51.0%

   \[\leadsto x \cdot \pi \]

8. Taylor expanded in undef-var around zero

   \[\leadsto x \cdot 0 \]
9. Step-by-step derivation

10. Applied rewrites 50.0%

    \[\leadsto x \cdot 0 \]
11. Add Preprocessing

Reproduce

herbie shell --seed 2025285 -o generate:evaluate
(FPCore (x)
  :name "bug1188 (missed optimization)"
  :precision binary64
  (sin (* PI x)))