Rosa's Benchmark

Percentage Accurate: 99.8% → 99.8%

Time: 7.1s

Alternatives: 8

Speedup: 1.2×

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

Specification

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * ((x * x) * x))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * ((x * x) * x))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(Float64(x * x) * x)))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * ((x * x) * x));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(N[(x * x), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (fma 0.954929658551372 x (* (pow x 3.0) -0.12900613773279798)))

C

double code(double x) {
	return fma(0.954929658551372, x, (pow(x, 3.0) * -0.12900613773279798));
}

Julia

function code(x)
	return fma(0.954929658551372, x, Float64((x ^ 3.0) * -0.12900613773279798))
end

Wolfram

code[x_] := N[(0.954929658551372 * x + N[(N[Power[x, 3.0], $MachinePrecision] * -0.12900613773279798), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. fma-neg 99.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, -0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right)\right)} \]

   2. *-commutative 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, -\color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot 0.12900613773279798}\right) \]

   3. distribute-rgt-neg-in 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{\left(\left(x \cdot x\right) \cdot x\right) \cdot \left(-0.12900613773279798\right)}\right) \]

   4. unpow3 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, \color{blue}{{x}^{3}} \cdot \left(-0.12900613773279798\right)\right) \]

   5. metadata-eval 99.8%

      \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot \color{blue}{-0.12900613773279798}\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right)} \]

4. Final simplification 99.8%

   \[\leadsto \mathsf{fma}\left(0.954929658551372, x, {x}^{3} \cdot -0.12900613773279798\right) \]

Alternative 2: 99.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (* x (fma (* x x) -0.12900613773279798 0.954929658551372)))

C

double code(double x) {
	return x * fma((x * x), -0.12900613773279798, 0.954929658551372);
}

Julia

function code(x)
	return Float64(x * fma(Float64(x * x), -0.12900613773279798, 0.954929658551372))
end

Wolfram

code[x_] := N[(x * N[(N[(x * x), $MachinePrecision] * -0.12900613773279798 + 0.954929658551372), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. associate-*r* 99.8%

      \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

   2. distribute-rgt-out-- 99.8%

      \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

   3. sub-neg 99.8%

      \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

   4. +-commutative 99.8%

      \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

   5. *-commutative 99.8%

      \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

   6. distribute-rgt-neg-in 99.8%

      \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

   7. fma-def 99.8%

      \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

4. Final simplification 99.8%

   \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right) \]

Alternative 3: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.7 \lor \neg \left(x \leq 2.7\right):\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.954929658551372 \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (or (<= x -2.7) (not (<= x 2.7)))
   (* x (* -0.12900613773279798 (* x x)))
   (* 0.954929658551372 x)))

C

double code(double x) {
	double tmp;
	if ((x <= -2.7) || !(x <= 2.7)) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = 0.954929658551372 * x;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if ((x <= (-2.7d0)) .or. (.not. (x <= 2.7d0))) then
        tmp = x * ((-0.12900613773279798d0) * (x * x))
    else
        tmp = 0.954929658551372d0 * x
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if ((x <= -2.7) || !(x <= 2.7)) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else {
		tmp = 0.954929658551372 * x;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if (x <= -2.7) or not (x <= 2.7):
		tmp = x * (-0.12900613773279798 * (x * x))
	else:
		tmp = 0.954929658551372 * x
	return tmp

Julia

function code(x)
	tmp = 0.0
	if ((x <= -2.7) || !(x <= 2.7))
		tmp = Float64(x * Float64(-0.12900613773279798 * Float64(x * x)));
	else
		tmp = Float64(0.954929658551372 * x);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if ((x <= -2.7) || ~((x <= 2.7)))
		tmp = x * (-0.12900613773279798 * (x * x));
	else
		tmp = 0.954929658551372 * x;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[Or[LessEqual[x, -2.7], N[Not[LessEqual[x, 2.7]], $MachinePrecision]], N[(x * N[(-0.12900613773279798 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(0.954929658551372 * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.7000000000000002 or 2.7000000000000002 < x

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around inf 98.4%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. expm1-log1p-u 96.2%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left({x}^{2}\right)\right)}\right) \]

      2. expm1-udef 96.2%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left({x}^{2}\right)} - 1\right)}\right) \]

      3. unpow2 96.2%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \left(e^{\mathsf{log1p}\left(\color{blue}{x \cdot x}\right)} - 1\right)\right) \]

   6. Applied egg-rr 96.2%

      \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left(x \cdot x\right)} - 1\right)}\right) \]
   7. Step-by-step derivation

      1. expm1-def 96.2%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(x \cdot x\right)\right)}\right) \]

      2. expm1-log1p 98.4%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   8. Simplified 98.4%

      \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   if -2.7000000000000002 < x < 2.7000000000000002

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around 0 98.8%

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

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.7 \lor \neg \left(x \leq 2.7\right):\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{else}:\\ \;\;\;\;0.954929658551372 \cdot x\\ \end{array} \]

Alternative 4: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.7:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{elif}\;x \leq 2.7:\\ \;\;\;\;0.954929658551372 \cdot x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -2.7)
   (* x (* -0.12900613773279798 (* x x)))
   (if (<= x 2.7)
     (* 0.954929658551372 x)
     (* x (* x (* x -0.12900613773279798))))))

C

double code(double x) {
	double tmp;
	if (x <= -2.7) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else if (x <= 2.7) {
		tmp = 0.954929658551372 * x;
	} else {
		tmp = x * (x * (x * -0.12900613773279798));
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-2.7d0)) then
        tmp = x * ((-0.12900613773279798d0) * (x * x))
    else if (x <= 2.7d0) then
        tmp = 0.954929658551372d0 * x
    else
        tmp = x * (x * (x * (-0.12900613773279798d0)))
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= -2.7) {
		tmp = x * (-0.12900613773279798 * (x * x));
	} else if (x <= 2.7) {
		tmp = 0.954929658551372 * x;
	} else {
		tmp = x * (x * (x * -0.12900613773279798));
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= -2.7:
		tmp = x * (-0.12900613773279798 * (x * x))
	elif x <= 2.7:
		tmp = 0.954929658551372 * x
	else:
		tmp = x * (x * (x * -0.12900613773279798))
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -2.7)
		tmp = Float64(x * Float64(-0.12900613773279798 * Float64(x * x)));
	elseif (x <= 2.7)
		tmp = Float64(0.954929658551372 * x);
	else
		tmp = Float64(x * Float64(x * Float64(x * -0.12900613773279798)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= -2.7)
		tmp = x * (-0.12900613773279798 * (x * x));
	elseif (x <= 2.7)
		tmp = 0.954929658551372 * x;
	else
		tmp = x * (x * (x * -0.12900613773279798));
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, -2.7], N[(x * N[(-0.12900613773279798 * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[x, 2.7], N[(0.954929658551372 * x), $MachinePrecision], N[(x * N[(x * N[(x * -0.12900613773279798), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if x < -2.7000000000000002

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.9%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.9%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.9%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.9%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.9%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.9%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.9%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.9%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.9%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around inf 98.7%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. expm1-log1p-u 96.1%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left({x}^{2}\right)\right)}\right) \]

      2. expm1-udef 96.1%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left({x}^{2}\right)} - 1\right)}\right) \]

      3. unpow2 96.1%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \left(e^{\mathsf{log1p}\left(\color{blue}{x \cdot x}\right)} - 1\right)\right) \]

   6. Applied egg-rr 96.1%

      \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(e^{\mathsf{log1p}\left(x \cdot x\right)} - 1\right)}\right) \]
   7. Step-by-step derivation

      1. expm1-def 96.1%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\mathsf{expm1}\left(\mathsf{log1p}\left(x \cdot x\right)\right)}\right) \]

      2. expm1-log1p 98.7%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   8. Simplified 98.7%

      \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

   if -2.7000000000000002 < x < 2.7000000000000002

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around 0 98.8%

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

   if 2.7000000000000002 < x

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around inf 98.2%

      \[\leadsto x \cdot \color{blue}{\left(-0.12900613773279798 \cdot {x}^{2}\right)} \]
   5. Step-by-step derivation

      1. unpow2 98.2%

         \[\leadsto x \cdot \left(-0.12900613773279798 \cdot \color{blue}{\left(x \cdot x\right)}\right) \]

      2. *-commutative 98.2%

         \[\leadsto x \cdot \color{blue}{\left(\left(x \cdot x\right) \cdot -0.12900613773279798\right)} \]

      3. associate-*r* 98.3%

         \[\leadsto x \cdot \color{blue}{\left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)} \]

   6. Simplified 98.3%

      \[\leadsto x \cdot \color{blue}{\left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.7:\\ \;\;\;\;x \cdot \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\\ \mathbf{elif}\;x \leq 2.7:\\ \;\;\;\;0.954929658551372 \cdot x\\ \mathbf{else}:\\ \;\;\;\;x \cdot \left(x \cdot \left(x \cdot -0.12900613773279798\right)\right)\\ \end{array} \]

Alternative 5: 99.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (- (* 0.954929658551372 x) (* 0.12900613773279798 (* x (* x x)))))

C

double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.954929658551372d0 * x) - (0.12900613773279798d0 * (x * (x * x)))
end function

Java

public static double code(double x) {
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
}

Python

def code(x):
	return (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)))

Julia

function code(x)
	return Float64(Float64(0.954929658551372 * x) - Float64(0.12900613773279798 * Float64(x * Float64(x * x))))
end

MATLAB

function tmp = code(x)
	tmp = (0.954929658551372 * x) - (0.12900613773279798 * (x * (x * x)));
end

Wolfram

code[x_] := N[(N[(0.954929658551372 * x), $MachinePrecision] - N[(0.12900613773279798 * N[(x * N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]

2. Final simplification 99.8%

   \[\leadsto 0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(x \cdot \left(x \cdot x\right)\right) \]

Alternative 6: 99.8% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ x \cdot \left(0.954929658551372 - x \cdot \left(x \cdot 0.12900613773279798\right)\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (* x (- 0.954929658551372 (* x (* x 0.12900613773279798)))))

C

double code(double x) {
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (0.954929658551372d0 - (x * (x * 0.12900613773279798d0)))
end function

Java

public static double code(double x) {
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
}

Python

def code(x):
	return x * (0.954929658551372 - (x * (x * 0.12900613773279798)))

Julia

function code(x)
	return Float64(x * Float64(0.954929658551372 - Float64(x * Float64(x * 0.12900613773279798))))
end

MATLAB

function tmp = code(x)
	tmp = x * (0.954929658551372 - (x * (x * 0.12900613773279798)));
end

Wolfram

code[x_] := N[(x * N[(0.954929658551372 - N[(x * N[(x * 0.12900613773279798), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. associate-*r* 99.8%

      \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

   2. distribute-rgt-out-- 99.8%

      \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

   3. associate-*r* 99.8%

      \[\leadsto x \cdot \left(0.954929658551372 - \color{blue}{\left(0.12900613773279798 \cdot x\right) \cdot x}\right) \]

3. Applied egg-rr 99.8%

   \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - \left(0.12900613773279798 \cdot x\right) \cdot x\right)} \]

4. Final simplification 99.8%

   \[\leadsto x \cdot \left(0.954929658551372 - x \cdot \left(x \cdot 0.12900613773279798\right)\right) \]

Alternative 7: 51.2% accurate, 2.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 2.7:\\ \;\;\;\;0.954929658551372 \cdot x\\ \mathbf{else}:\\ \;\;\;\;x \cdot -0.954929658551372\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 2.7) (* 0.954929658551372 x) (* x -0.954929658551372)))

C

double code(double x) {
	double tmp;
	if (x <= 2.7) {
		tmp = 0.954929658551372 * x;
	} else {
		tmp = x * -0.954929658551372;
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= 2.7d0) then
        tmp = 0.954929658551372d0 * x
    else
        tmp = x * (-0.954929658551372d0)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double tmp;
	if (x <= 2.7) {
		tmp = 0.954929658551372 * x;
	} else {
		tmp = x * -0.954929658551372;
	}
	return tmp;
}

Python

def code(x):
	tmp = 0
	if x <= 2.7:
		tmp = 0.954929658551372 * x
	else:
		tmp = x * -0.954929658551372
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= 2.7)
		tmp = Float64(0.954929658551372 * x);
	else
		tmp = Float64(x * -0.954929658551372);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	tmp = 0.0;
	if (x <= 2.7)
		tmp = 0.954929658551372 * x;
	else
		tmp = x * -0.954929658551372;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := If[LessEqual[x, 2.7], N[(0.954929658551372 * x), $MachinePrecision], N[(x * -0.954929658551372), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 2.7000000000000002

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around 0 68.3%

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

   if 2.7000000000000002 < x

   1. Initial program 99.8%

      \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
   2. Step-by-step derivation

      1. associate-*r* 99.8%

         \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

      2. distribute-rgt-out-- 99.8%

         \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

      3. sub-neg 99.8%

         \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

      4. +-commutative 99.8%

         \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

      5. *-commutative 99.8%

         \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

      6. distribute-rgt-neg-in 99.8%

         \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

      7. fma-def 99.8%

         \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

      8. metadata-eval 99.8%

         \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

   3. Simplified 99.8%

      \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   4. Taylor expanded in x around 0 0.4%

      \[\leadsto x \cdot \color{blue}{0.954929658551372} \]
   5. Step-by-step derivation

      1. *-commutative 0.4%

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

      2. add-sqr-sqrt 0.4%

         \[\leadsto \color{blue}{\sqrt{0.954929658551372 \cdot x} \cdot \sqrt{0.954929658551372 \cdot x}} \]

      3. sqrt-unprod 0.4%

         \[\leadsto \color{blue}{\sqrt{\left(0.954929658551372 \cdot x\right) \cdot \left(0.954929658551372 \cdot x\right)}} \]

      4. *-commutative 0.4%

         \[\leadsto \sqrt{\color{blue}{\left(x \cdot 0.954929658551372\right)} \cdot \left(0.954929658551372 \cdot x\right)} \]

      5. *-commutative 0.4%

         \[\leadsto \sqrt{\left(x \cdot 0.954929658551372\right) \cdot \color{blue}{\left(x \cdot 0.954929658551372\right)}} \]

      6. swap-sqr 0.4%

         \[\leadsto \sqrt{\color{blue}{\left(x \cdot x\right) \cdot \left(0.954929658551372 \cdot 0.954929658551372\right)}} \]

      7. metadata-eval 0.4%

         \[\leadsto \sqrt{\left(x \cdot x\right) \cdot \color{blue}{0.9118906527810399}} \]

   6. Applied egg-rr 0.4%

      \[\leadsto \color{blue}{\sqrt{\left(x \cdot x\right) \cdot 0.9118906527810399}} \]

   7. Taylor expanded in x around -inf 6.4%

      \[\leadsto \color{blue}{-0.954929658551372 \cdot x} \]
   8. Step-by-step derivation

      1. *-commutative 6.4%

         \[\leadsto \color{blue}{x \cdot -0.954929658551372} \]

   9. Simplified 6.4%

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

4. Final simplification 50.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq 2.7:\\ \;\;\;\;0.954929658551372 \cdot x\\ \mathbf{else}:\\ \;\;\;\;x \cdot -0.954929658551372\\ \end{array} \]

Alternative 8: 5.1% accurate, 3.7× speedup

Math

\[\begin{array}{l} \\ x \cdot -0.954929658551372 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* x -0.954929658551372))

C

double code(double x) {
	return x * -0.954929658551372;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = x * (-0.954929658551372d0)
end function

Java

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

Python

def code(x):
	return x * -0.954929658551372

Julia

function code(x)
	return Float64(x * -0.954929658551372)
end

MATLAB

function tmp = code(x)
	tmp = x * -0.954929658551372;
end

Wolfram

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

Derivation

1. Initial program 99.8%

   \[0.954929658551372 \cdot x - 0.12900613773279798 \cdot \left(\left(x \cdot x\right) \cdot x\right) \]
2. Step-by-step derivation

   1. associate-*r* 99.8%

      \[\leadsto 0.954929658551372 \cdot x - \color{blue}{\left(0.12900613773279798 \cdot \left(x \cdot x\right)\right) \cdot x} \]

   2. distribute-rgt-out-- 99.8%

      \[\leadsto \color{blue}{x \cdot \left(0.954929658551372 - 0.12900613773279798 \cdot \left(x \cdot x\right)\right)} \]

   3. sub-neg 99.8%

      \[\leadsto x \cdot \color{blue}{\left(0.954929658551372 + \left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right)\right)} \]

   4. +-commutative 99.8%

      \[\leadsto x \cdot \color{blue}{\left(\left(-0.12900613773279798 \cdot \left(x \cdot x\right)\right) + 0.954929658551372\right)} \]

   5. *-commutative 99.8%

      \[\leadsto x \cdot \left(\left(-\color{blue}{\left(x \cdot x\right) \cdot 0.12900613773279798}\right) + 0.954929658551372\right) \]

   6. distribute-rgt-neg-in 99.8%

      \[\leadsto x \cdot \left(\color{blue}{\left(x \cdot x\right) \cdot \left(-0.12900613773279798\right)} + 0.954929658551372\right) \]

   7. fma-def 99.8%

      \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

   8. metadata-eval 99.8%

      \[\leadsto x \cdot \mathsf{fma}\left(x \cdot x, \color{blue}{-0.12900613773279798}, 0.954929658551372\right) \]

3. Simplified 99.8%

   \[\leadsto \color{blue}{x \cdot \mathsf{fma}\left(x \cdot x, -0.12900613773279798, 0.954929658551372\right)} \]

4. Taylor expanded in x around 0 49.2%

   \[\leadsto x \cdot \color{blue}{0.954929658551372} \]
5. Step-by-step derivation

   1. *-commutative 49.2%

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

   2. add-sqr-sqrt 22.8%

      \[\leadsto \color{blue}{\sqrt{0.954929658551372 \cdot x} \cdot \sqrt{0.954929658551372 \cdot x}} \]

   3. sqrt-unprod 24.3%

      \[\leadsto \color{blue}{\sqrt{\left(0.954929658551372 \cdot x\right) \cdot \left(0.954929658551372 \cdot x\right)}} \]

   4. *-commutative 24.3%

      \[\leadsto \sqrt{\color{blue}{\left(x \cdot 0.954929658551372\right)} \cdot \left(0.954929658551372 \cdot x\right)} \]

   5. *-commutative 24.3%

      \[\leadsto \sqrt{\left(x \cdot 0.954929658551372\right) \cdot \color{blue}{\left(x \cdot 0.954929658551372\right)}} \]

   6. swap-sqr 24.3%

      \[\leadsto \sqrt{\color{blue}{\left(x \cdot x\right) \cdot \left(0.954929658551372 \cdot 0.954929658551372\right)}} \]

   7. metadata-eval 24.3%

      \[\leadsto \sqrt{\left(x \cdot x\right) \cdot \color{blue}{0.9118906527810399}} \]

6. Applied egg-rr 24.3%

   \[\leadsto \color{blue}{\sqrt{\left(x \cdot x\right) \cdot 0.9118906527810399}} \]

7. Taylor expanded in x around -inf 5.1%

   \[\leadsto \color{blue}{-0.954929658551372 \cdot x} \]
8. Step-by-step derivation

   1. *-commutative 5.1%

      \[\leadsto \color{blue}{x \cdot -0.954929658551372} \]

9. Simplified 5.1%

   \[\leadsto \color{blue}{x \cdot -0.954929658551372} \]

10. Final simplification 5.1%

    \[\leadsto x \cdot -0.954929658551372 \]

Reproduce

herbie shell --seed 2023207 
(FPCore (x)
  :name "Rosa's Benchmark"
  :precision binary64
  (- (* 0.954929658551372 x) (* 0.12900613773279798 (* (* x x) x))))