Average Error: 0.0 → 0.0
Time: 876.0ms
Precision: binary64
\[x \cdot \left(x - 1\right) \]
↓
\[x \cdot x - x \]
(FPCore (x) :precision binary64 (* x (- x 1.0)))
↓
(FPCore (x) :precision binary64 (- (* x x) x))
double code(double x) {
	return x * (x - 1.0);
}
↓
double code(double x) {
	return (x * x) - x;
}

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

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

def code(x):
	return x * (x - 1.0)
↓
def code(x):
	return (x * x) - x

function code(x)
	return Float64(x * Float64(x - 1.0))
end
↓
function code(x)
	return Float64(Float64(x * x) - x)
end

function tmp = code(x)
	tmp = x * (x - 1.0);
end
↓
function tmp = code(x)
	tmp = (x * x) - x;
end

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

x \cdot \left(x - 1\right)
↓
x \cdot x - x

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[x \cdot x - x \]

Derivation

  1. Initial program 0.0

    \[x \cdot \left(x - 1\right) \]

  2. Simplified0.0

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

  3. Final simplification0.0

    \[\leadsto x \cdot x - x \]

Reproduce

herbie shell --seed 2022150 
(FPCore (x)
  :name "Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2"
  :precision binary64

  :herbie-target
  (- (* x x) x)

  (* x (- x 1.0)))