Metrics for Statistics.Correlation.Kendall:numOfTiesBy from math-functions-0.1.5.2

start0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory

0.3MiB live, 0.3MiB allocated; 0ms collecting garbage

Algorithm

1×

Search

Probability	Valid	Unknown	Precondition	Infinite	Domain	Can't	Iter
0%	0%	100%	0%	0%	0%	0%	0
100%	100%	0%	0%	0%	0%	0%	1

Compiler

Compiled 7 to 6 computations (14.3% saved)

sample697.0ms (36.9%)

Memory

35.6MiB live, 980.0MiB allocated; 202ms collecting garbage

Samples

435.0ms

8 256×

valid

Precisions

Click to see histograms. Total time spent on operations: 253.0ms

ival-mult: 152.0ms (60.1% of total)

ival-sub: 86.0ms (34% of total)

ival-true: 6.0ms (2.4% of total)

exact: 5.0ms (2% of total)

ival-assert: 3.0ms (1.2% of total)

adjust: 2.0ms (0.8% of total)

Bogosity

explain49.0ms (2.6%)

Memory

-30.3MiB live, 161.5MiB allocated; 15ms collecting garbage

FPErrors

Click to see full error table

Example	Example	Subexpression
-	-	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`
-	-	`(-.f64 x #s(literal 1 binary64))`
-	-	`#s(literal 1 binary64)`
-	-	`x`

Confusion

	Predicted +	Predicted -
+	0	0
-	0	256

Precision

0/0

Recall

0/0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	256

Precision?

0/0

Recall?

0/0

Freqs

test

number	freq
0	256

Total Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	0	0	0
-	0	0	1

Precision?

0/0

Recall?

0/0

Samples

22.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

Click to see histograms. Total time spent on operations: 10.0ms

ival-mult: 6.0ms (57.9% of total)

ival-sub: 3.0ms (29% of total)

ival-true: 0.0ms (0% of total)

adjust: 0.0ms (0% of total)

exact: 0.0ms (0% of total)

ival-assert: 0.0ms (0% of total)

preprocess259.0ms (13.7%)

Memory

1.4MiB live, 255.5MiB allocated; 25ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	20
1	18	18
2	26	18
3	45	18
4	88	18
5	298	18
6	2471	16
7	6405	16
0	4	5
0	6	5
1	9	5
2	12	5
3	21	5
4	51	5
5	216	5
6	1799	5
7	5137	5
0	8310	5

Stop Event

1×	iter limit
1×	node limit
1×	iter limit
1×	node limit

Calls

Call 1

Inputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))

Outputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) x)

Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory: 0.1MiB live, 0.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

0.9MiB live, 0.9MiB allocated; 0ms collecting garbage

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Compiler

Compiled 5 to 4 computations (20% saved)

series2.0ms (0.1%)

Memory

3.9MiB live, 3.9MiB allocated; 0ms collecting garbage

Counts

4 → 10

Calls

Call 1

Inputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))
x
(-.f64 x #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx x #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	inf	((* x (- x 1)) x (- x 1) 1)
1.0ms	x	@	-inf	((* x (- x 1)) x (- x 1) 1)
0.0ms	x	@	0	((* x (- x 1)) x (- x 1) 1)

simplify111.0ms (5.9%)

Memory

2.3MiB live, 138.7MiB allocated; 12ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	73
1	38	73
2	58	73
3	106	73
4	333	73
5	2055	73
6	6563	73
0	8088	73

Stop Event

1×	iter limit
1×	node limit

Counts

10 → 10

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx x #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))

Outputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(literal -1 binary64))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) (*.f64 x x))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) x)
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))

rewrite42.0ms (2.2%)

Memory

-7.6MiB live, 49.2MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	23	10
0	155	10

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

4 → 16

Calls

Call 1

Inputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))
x
(-.f64 x #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
(*.f64 (-.f64 x #s(literal 1 binary64)) x)
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) x) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 x (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal -1 binary64)))
(/.f64 (*.f64 x (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
x
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1 binary64))) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (neg.f64 (fma.f64 x x (-.f64 x #s(literal -1 binary64)))))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (-.f64 x #s(literal -1 binary64)))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64))))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (-.f64 x #s(literal -1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 x x (-.f64 x #s(literal -1 binary64)))))
(-.f64 x #s(literal 1 binary64))
(+.f64 x #s(literal -1 binary64))
#s(literal 1 binary64)

eval2.0ms (0.1%)

Memory: 6.1MiB live, 6.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 236 to 60 computations (74.6% saved)

prune2.0ms (0.1%)

Memory

5.4MiB live, 5.4MiB allocated; 0ms collecting garbage

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	22	3	25
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	22	4	26

Accuracy

100.0%

Counts

26 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	93.1%	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
▶	50.1%	(*.f64 x #s(approx (- x 1) x))
▶	53.0%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 30 to 21 computations (30% saved)

series7.0ms (0.4%)

Memory

-34.8MiB live, 10.7MiB allocated; 4ms collecting garbage

Counts

10 → 28

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
(*.f64 x #s(approx (- x 1) x))
#s(approx (- x 1) x)
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
(fma.f64 x x #s(literal -1 binary64))
#s(literal -1 binary64)
(-.f64 x #s(literal -1 binary64))

Outputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))

Calls

3 calls:

Time	Variable		Point	Expression
4.0ms	x	@	-inf	((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))
1.0ms	x	@	inf	((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))
1.0ms	x	@	0	((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))

Time

Variable

Point

Expression

4.0ms

-inf

((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))

1.0ms

inf

((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))

1.0ms

((* x (- x 1)) (neg x) x (* x (- x 1)) (- x 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) -1 (- x -1))

simplify189.0ms (10%)

Memory

41.2MiB live, 183.9MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	63	245
1	105	237
2	239	229
3	1145	229
4	5820	229
0	8169	223

Stop Event

1×	iter limit
1×	node limit

Counts

28 → 28

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))

Outputs
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx (neg x) (neg.f64 x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- x 1) #s(hole binary64 -1))
#s(approx (- x 1) #s(literal -1 binary64))
#s(approx (- x 1) #s(hole binary64 (- x 1)))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) (neg.f64 x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))
#s(approx (+ (* x x) -1) #s(hole binary64 -1))
#s(approx (+ (* x x) -1) #s(literal -1 binary64))
#s(approx (+ (* x x) -1) #s(hole binary64 (- (pow x 2) 1)))
#s(approx (+ (* x x) -1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(literal 1 binary64))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (* x (- x 1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) (*.f64 x x))
#s(approx (* x (- x 1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (- x 1) #s(hole binary64 x))
#s(approx (- x 1) x)
#s(approx (- x 1) #s(hole binary64 (* x (- 1 (/ 1 x)))))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (* x (- x 1)) (*.f64 x x))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* x (- x 1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) (pow.f64 x #s(literal 3 binary64)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))
#s(approx (+ (* x x) -1) #s(hole binary64 (pow x 2)))
#s(approx (+ (* x x) -1) (*.f64 x x))
#s(approx (+ (* x x) -1) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 (pow x 2))))))
#s(approx (+ (* x x) -1) (fma.f64 x x #s(literal -1 binary64)))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) x)
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (- x 1) #s(hole binary64 (* -1 (* x (- (/ 1 x) 1)))))
#s(approx (- x 1) (-.f64 x #s(literal 1 binary64)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))

rewrite57.0ms (3%)

Memory

-25.2MiB live, 19.2MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	47
0	20	47
1	69	42
0	477	42

Stop Event

1×	iter limit
1×	iter limit
1×	node limit
1×	iter limit

Counts

10 → 88

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
(*.f64 x #s(approx (- x 1) x))
#s(approx (- x 1) x)
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
(fma.f64 x x #s(literal -1 binary64))
#s(literal -1 binary64)
(-.f64 x #s(literal -1 binary64))

Outputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
(*.f64 #s(approx (- x 1) x) x)
(*.f64 x #s(approx (- x 1) x))
#s(approx (- x 1) x)
(.f64 (/.f64 (.f64 (fma.f64 x x #s(literal -1 binary64)) x) (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal 1 binary64)))
(.f64 (/.f64 (.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64))))
(*.f64 (/.f64 x (-.f64 x #s(literal -1 binary64))) (fma.f64 x x #s(literal -1 binary64)))
(.f64 (-.f64 x #s(literal -1 binary64)) (.f64 (-.f64 x #s(literal 1 binary64)) (/.f64 x (-.f64 x #s(literal -1 binary64)))))
(*.f64 (fma.f64 x x #s(literal -1 binary64)) (/.f64 x (-.f64 x #s(literal -1 binary64))))
(*.f64 (-.f64 x #s(literal 1 binary64)) x)
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(/.f64 (.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (/.f64 x (-.f64 x #s(literal -1 binary64)))) (-.f64 (.f64 x x) #s(literal -1 binary64)))
(/.f64 (.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) (/.f64 x (-.f64 x #s(literal -1 binary64)))) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(/.f64 (*.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) x) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 x (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (neg.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) (neg.f64 x))) (neg.f64 (neg.f64 (-.f64 x #s(literal -1 binary64)))))
(/.f64 (.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) x) (.f64 (-.f64 (*.f64 x x) #s(literal -1 binary64)) (-.f64 x #s(literal -1 binary64))))
(/.f64 (.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) x) (.f64 (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (*.f64 x x)) (pow.f64 x #s(literal 4 binary64))) (-.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) (neg.f64 x)) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(neg.f64 (/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) (neg.f64 x)) (-.f64 x #s(literal -1 binary64))))
(neg.f64 (/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (neg.f64 (-.f64 x #s(literal -1 binary64)))))
(.f64 (.f64 x (-.f64 x #s(literal -1 binary64))) (-.f64 x #s(literal 1 binary64)))
(.f64 (-.f64 x #s(literal -1 binary64)) (.f64 (-.f64 x #s(literal 1 binary64)) x))
(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
(*.f64 x (fma.f64 x x #s(literal -1 binary64)))
(/.f64 (.f64 x (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64))) (-.f64 (.f64 x x) #s(literal -1 binary64)))
(/.f64 (.f64 x (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64))) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(/.f64 (.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) x) (-.f64 (.f64 x x) #s(literal -1 binary64)))
(/.f64 (.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) x) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(fma.f64 (pow.f64 x #s(literal 3/2 binary64)) (pow.f64 x #s(literal 3/2 binary64)) (*.f64 #s(literal -1 binary64) x))
(fma.f64 (.f64 x x) x (.f64 #s(literal -1 binary64) x))
(fma.f64 #s(literal -1 binary64) x (pow.f64 x #s(literal 3 binary64)))
(fma.f64 x (.f64 x x) (.f64 #s(literal -1 binary64) x))
(fma.f64 x #s(literal -1 binary64) (pow.f64 x #s(literal 3 binary64)))
(+.f64 (*.f64 #s(literal -1 binary64) x) (pow.f64 x #s(literal 3 binary64)))
(+.f64 (pow.f64 x #s(literal 3 binary64)) (*.f64 #s(literal -1 binary64) x))
(*.f64 (+.f64 (fabs.f64 x) #s(literal -1 binary64)) (-.f64 (fabs.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (fabs.f64 x) #s(literal 1 binary64)) (-.f64 (fabs.f64 x) #s(literal 1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal -1 binary64)) (-.f64 (neg.f64 x) #s(literal -1 binary64)))
(*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (-.f64 (neg.f64 x) #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 x #s(literal -1 binary64)) (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal -1 binary64)))
(/.f64 (*.f64 (-.f64 x #s(literal -1 binary64)) (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64))) (fma.f64 x x (-.f64 x #s(literal -1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 4 binary64))) (-.f64 #s(literal -1 binary64) (*.f64 x x)))
(/.f64 (-.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal 1 binary64)) (+.f64 (pow.f64 x #s(literal 4 binary64)) (+.f64 #s(literal 1 binary64) (.f64 (.f64 x x) #s(literal 1 binary64)))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64))) (neg.f64 (-.f64 (*.f64 x x) #s(literal -1 binary64))))
(/.f64 (neg.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64))) (neg.f64 (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (*.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (fma.f64 x x #s(literal 1 binary64)))
(/.f64 (-.f64 (pow.f64 x #s(literal 4 binary64)) #s(literal 1 binary64)) (-.f64 (*.f64 x x) #s(literal -1 binary64)))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) (+.f64 #s(literal 1 binary64) (-.f64 (pow.f64 x #s(literal 4 binary64)) (.f64 (.f64 x x) #s(literal -1 binary64)))))
(/.f64 (+.f64 (pow.f64 x #s(literal 6 binary64)) #s(literal -1 binary64)) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (*.f64 x x)) (pow.f64 x #s(literal 4 binary64))))
(fma.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)) #s(literal -1 binary64))
(fma.f64 (fabs.f64 x) (fabs.f64 x) #s(literal -1 binary64))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 x x #s(literal -1 binary64))
(expm1.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(-.f64 (/.f64 (pow.f64 x #s(literal 4 binary64)) (-.f64 (.f64 x x) #s(literal -1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 (.f64 x x) #s(literal -1 binary64))))
(-.f64 (*.f64 x x) #s(literal 1 binary64))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 (fabs.f64 x)) (fabs.f64 x)))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 (neg.f64 x)) (neg.f64 x)))
(-.f64 #s(literal -1 binary64) (*.f64 (neg.f64 x) x))
(-.f64 #s(literal -1 binary64) (*.f64 x (neg.f64 x)))
(+.f64 (/.f64 (pow.f64 x #s(literal 6 binary64)) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))) (/.f64 #s(literal -1 binary64) (fma.f64 #s(literal -1 binary64) (-.f64 #s(literal -1 binary64) (.f64 x x)) (pow.f64 x #s(literal 4 binary64)))))
(+.f64 (*.f64 x x) #s(literal -1 binary64))
(+.f64 #s(literal -1 binary64) (*.f64 x x))
#s(literal -1 binary64)
(*.f64 (-.f64 x #s(literal -1 binary64)) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (-.f64 x #s(literal -1 binary64)))
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1 binary64))) (neg.f64 (-.f64 x #s(literal 1 binary64))))
(/.f64 (-.f64 #s(literal 1 binary64) (*.f64 x x)) (-.f64 #s(literal 1 binary64) x))
(/.f64 (+.f64 #s(literal 1 binary64) (pow.f64 x #s(literal 3 binary64))) (+.f64 #s(literal 1 binary64) (-.f64 (*.f64 x x) x)))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) x)))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64)) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64))))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal -1 binary64) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))))
(-.f64 #s(literal 1 binary64) (*.f64 (neg.f64 x) #s(literal 1 binary64)))
(-.f64 x #s(literal -1 binary64))
(+.f64 #s(literal 1 binary64) x)
(+.f64 x #s(literal 1 binary64))

eval11.0ms (0.6%)

Memory: 14.3MiB live, 14.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 591 to 333 computations (79.1% saved)

prune5.0ms (0.3%)

Memory

8.2MiB live, 8.2MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (1 fresh and 4 done)

	Pruned	Kept	Total
New	115	1	116
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	115	5	120

Accuracy

100.0%

Counts

120 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	93.1%	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
▶	51.9%	(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
✓	50.1%	(*.f64 x #s(approx (- x 1) x))
✓	53.0%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 44 to 31 computations (29.5% saved)

series2.0ms (0.1%)

Memory

2.8MiB live, 2.8MiB allocated; 0ms collecting garbage

Counts

6 → 15

Calls

Call 1

Inputs
(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
#s(approx (* (+ (* x x) -1) x) (neg.f64 x))
(neg.f64 x)
x
(-.f64 x #s(literal -1 binary64))
#s(literal -1 binary64)

Outputs
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))

Calls

3 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)
1.0ms	x	@	inf	((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)
0.0ms	x	@	0	((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)

Time

Variable

Point

Expression

1.0ms

-inf

((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)

1.0ms

inf

((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)

0.0ms

((/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (neg x) x (- x -1) -1)

simplify216.0ms (11.4%)

Memory

-26.0MiB live, 124.3MiB allocated; 99ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	45	161
1	81	149
2	199	137
3	1056	121
4	5683	121
0	8080	121

Stop Event

1×	iter limit
1×	node limit

Counts

15 → 15

Calls

Call 1

Inputs
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))

Outputs
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* -1 x)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) (neg.f64 x))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* x (- x 1))))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 x)))
#s(approx (* (+ (* x x) -1) x) (neg.f64 x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* x (- (pow x 2) 1))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))
#s(approx (neg x) #s(hole binary64 (* -1 x)))
#s(approx (neg x) (neg.f64 x))
#s(approx x #s(hole binary64 x))
#s(approx x x)
#s(approx (- x -1) #s(hole binary64 1))
#s(approx (- x -1) #s(literal 1 binary64))
#s(approx (- x -1) #s(hole binary64 (+ 1 x)))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (pow x 2)))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) (*.f64 x x))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) #s(hole binary64 (* (pow x 2) (- 1 (/ 1 x)))))
#s(approx (/ (* (+ (* x x) -1) x) (- x -1)) (*.f64 (-.f64 x #s(literal 1 binary64)) x))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (pow x 3)))
#s(approx (* (+ (* x x) -1) x) (pow.f64 x #s(literal 3 binary64)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* (pow x 3) (- 1 (/ 1 (pow x 2))))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))
#s(approx (- x -1) #s(hole binary64 x))
#s(approx (- x -1) x)
#s(approx (- x -1) #s(hole binary64 (* x (+ 1 (/ 1 x)))))
#s(approx (- x -1) (-.f64 x #s(literal -1 binary64)))
#s(approx (* (+ (* x x) -1) x) #s(hole binary64 (* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))))
#s(approx (* (+ (* x x) -1) x) (-.f64 (pow.f64 x #s(literal 3 binary64)) x))

rewrite39.0ms (2.1%)

Memory

21.9MiB live, 21.9MiB allocated; 0ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	9	31
0	12	31
1	48	31
0	349	29

Stop Event

1×	iter limit
1×	iter limit
1×	iter limit
1×	unsound
1×	iter limit

Counts

6 → 21

Calls

Call 1

Inputs
(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
#s(approx (* (+ (* x x) -1) x) (neg.f64 x))
(neg.f64 x)
x
(-.f64 x #s(literal -1 binary64))
#s(literal -1 binary64)

Outputs
(.f64 (/.f64 #s(approx ( (+ (* x x) -1) x) (neg.f64 x)) (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal 1 binary64)))
(.f64 (/.f64 #s(approx ( (+ (* x x) -1) x) (neg.f64 x)) (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (neg.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)))) (neg.f64 (neg.f64 (-.f64 x #s(literal -1 binary64)))))
(/.f64 (neg.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x))) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
(neg.f64 (/.f64 (neg.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x))) (-.f64 x #s(literal -1 binary64))))
(neg.f64 (/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (neg.f64 (-.f64 x #s(literal -1 binary64)))))
#s(approx (* (+ (* x x) -1) x) (neg.f64 x))
(neg.f64 x)
x
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 1 binary64)) (fma.f64 x x (-.f64 #s(literal 1 binary64) (*.f64 x #s(literal 1 binary64)))))
(/.f64 (neg.f64 (fma.f64 x x #s(literal -1 binary64))) (neg.f64 (-.f64 x #s(literal 1 binary64))))
(/.f64 (neg.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64))) (neg.f64 (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))))
(/.f64 (fma.f64 x x #s(literal -1 binary64)) (-.f64 x #s(literal 1 binary64)))
(/.f64 (-.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal -1 binary64)) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 x x) (-.f64 x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (-.f64 x #s(literal 1 binary64))))
(-.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal -1 binary64) (fma.f64 x x (fma.f64 #s(literal -1 binary64) x #s(literal 1 binary64)))))
(-.f64 x #s(literal -1 binary64))
(+.f64 #s(literal 1 binary64) x)
(+.f64 x #s(literal 1 binary64))
#s(literal -1 binary64)

eval3.0ms (0.2%)

Memory: 4.1MiB live, 4.1MiB allocated; 0ms collecting garbage
Compiler: Compiled 583 to 90 computations (84.6% saved)

prune3.0ms (0.2%)

Memory

4.3MiB live, 4.3MiB allocated; 0ms collecting garbage

Pruning

5 alts after pruning (0 fresh and 5 done)

	Pruned	Kept	Total
New	33	0	33
Fresh	0	0	0
Picked	0	1	1
Done	0	4	4
Total	33	5	38

Accuracy

100.0%

Counts

38 → 5

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	93.1%	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
✓	51.9%	(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
✓	50.1%	(*.f64 x #s(approx (- x 1) x))
✓	53.0%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 88 to 53 computations (39.8% saved)

regimes43.0ms (2.3%)

Memory

-35.5MiB live, 11.1MiB allocated; 13ms collecting garbage

Counts

5 → 1

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(*.f64 x #s(approx (- x 1) x))
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))

Outputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))

Calls

2 calls:

41.0ms	x
2.0ms	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Results

Accuracy	Segments	Branch
100.0%	1	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`
100.0%	1	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes3.0ms (0.1%)

Memory

6.0MiB live, 6.0MiB allocated; 0ms collecting garbage

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(*.f64 x #s(approx (- x 1) x))

Outputs
#s(approx (* x (- x 1)) (neg.f64 x))
(*.f64 x #s(approx (- x 1) x))

Calls

2 calls:

1.0ms	x
1.0ms	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Results

Accuracy	Segments	Branch
98.4%	2	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`
98.4%	3	`x`

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes2.0ms (0.1%)

Memory

5.0MiB live, 5.0MiB allocated; 0ms collecting garbage

Accuracy

Total -0.0b remaining (-0%)

Threshold costs -0b (-0%)

Counts

1 → 1

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))

Outputs
#s(approx (* x (- x 1)) (neg.f64 x))

Calls

2 calls:

1.0ms	(*.f64 x (-.f64 x #s(literal 1 binary64)))
1.0ms	x

Results

Accuracy	Segments	Branch
53.0%	1	`x`
53.0%	1	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`

Compiler

Compiled 6 to 5 computations (16.7% saved)

bsearch0.0ms (0%)

Memory

0.5MiB live, 0.5MiB allocated; 0ms collecting garbage

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	1.072946631110053e-14	1.1832639888492686

Compiler

Compiled 8 to 8 computations (0% saved)

simplify55.0ms (2.9%)

Memory

-5.0MiB live, 41.1MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	36
1	22	36
2	29	36
3	45	36
4	82	36
5	326	36
6	3207	36
7	7184	36

Stop Event

1×	node limit

Calls

Call 1

Inputs

(*.f64 x (-.f64 x #s(literal 1 binary64)))

(if (<=.f64 (*.f64 x (-.f64 x #s(literal 1 binary64))) #s(literal 6338253001141147/316912650057057350374175801344 binary64)) #s(approx (* x (- x 1)) (neg.f64 x)) (*.f64 x #s(approx (- x 1) x)))

#s(approx (* x (- x 1)) (neg.f64 x))

Outputs

(*.f64 x (-.f64 x #s(literal 1 binary64)))

(if (<=.f64 (*.f64 x (-.f64 x #s(literal 1 binary64))) #s(literal 6338253001141147/316912650057057350374175801344 binary64)) #s(approx (* x (- x 1)) (neg.f64 x)) (*.f64 x #s(approx (- x 1) x)))

#s(approx (* x (- x 1)) (neg.f64 x))

derivations71.0ms (3.8%)

Memory

-12.6MiB live, 85.5MiB allocated; 25ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 36 to 14 computations (61.1% saved)

preprocess17.0ms (0.9%)

Memory: 33.7MiB live, 33.7MiB allocated; 0ms collecting garbage
Compiler: Compiled 92 to 42 computations (54.3% saved)

end0.0ms (0%)

Memory: 0.0MiB live, 0.0MiB allocated; 0ms collecting garbage

start0.0ms (0%)

analyze0.0ms (0%)

sample697.0ms (36.9%)

explain49.0ms (2.6%)

preprocess259.0ms (13.7%)

eval0.0ms (0%)

prune0.0ms (0%)

series2.0ms (0.1%)

simplify111.0ms (5.9%)

rewrite42.0ms (2.2%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

series7.0ms (0.4%)

simplify189.0ms (10%)

rewrite57.0ms (3%)

eval11.0ms (0.6%)

prune5.0ms (0.3%)

series2.0ms (0.1%)

simplify216.0ms (11.4%)

rewrite39.0ms (2.1%)

eval3.0ms (0.2%)

prune3.0ms (0.2%)

regimes43.0ms (2.3%)

regimes3.0ms (0.1%)

regimes2.0ms (0.1%)

bsearch0.0ms (0%)

simplify55.0ms (2.9%)

derivations71.0ms (3.8%)

preprocess17.0ms (0.9%)

end0.0ms (0%)

Profiling