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

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

1.2MiB live, 1.2MiB 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)

sample676.0ms (12.5%)

Memory

7.2MiB live, 720.5MiB allocated; 178ms collecting garbage

Samples

438.0ms

8 256×

valid

Precisions

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

ival-mult: 138.0ms (56% of total)

ival-sub: 95.0ms (38.6% of total)

ival-true: 5.0ms (2% of total)

exact: 5.0ms (2% of total)

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

adjust: 2.0ms (0.8% of total)

Bogosity

explain42.0ms (0.8%)

Memory

30.8MiB live, 76.1MiB allocated; 6ms 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

20.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-sub: 6.0ms (57.2% of total)

ival-mult: 3.0ms (28.6% 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)

preprocess485.0ms (9%)

Memory

-4.7MiB live, 457.0MiB allocated; 100ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	6	15
1	15	13
2	23	13
3	37	13
4	72	13
5	245	13
6	1965	11
7	5440	11
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	5121	5
0	8296	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.3MiB live, 0.3MiB allocated; 0ms collecting garbage
Compiler: Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory

1.1MiB live, 1.1MiB 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)

simplify635.0ms (11.7%)

Memory

-12.6MiB live, 559.3MiB allocated; 115ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(-.f64 x #s(literal 1 binary64))
cost-diff	0	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	10
1	9	10
2	12	10
3	21	10
4	51	10
5	216	10
6	1799	10
7	5121	10
0	8296	10

Stop Event

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

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 x (-.f64 x #s(literal 1 binary64)))
(*.f64 (-.f64 x #s(literal 1 binary64)) x)
x
(-.f64 x #s(literal 1 binary64))
#s(literal 1 binary64)

localize13.0ms (0.2%)

Memory

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

Localize:

Found 2 expressions of interest:

New	Metric	Score	Program
accuracy	0.0	(-.f64 x #s(literal 1 binary64))
accuracy	0.01171875	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Samples

8.0ms

256×

valid

Compiler

Compiled 12 to 6 computations (50% saved)

Precisions

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

ival-sub: 2.0ms (55.6% of total)

ival-mult: 2.0ms (55.6% 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)

series1.0ms (0%)

Memory

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

Counts

2 → 9

Calls

Call 1

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

Outputs
(* -1 x)
(* x (- x 1))
-1
(- x 1)
(pow x 2)
(* (pow x 2) (- 1 (/ 1 x)))
x
(* x (- 1 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 1)))

Calls

3 calls:

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

simplify482.0ms (8.9%)

Memory

-18.1MiB live, 454.9MiB allocated; 143ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	26
1	28	26
2	48	26
3	96	26
4	333	26
5	2061	26
6	6597	26
0	8161	26

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 8

Calls

Call 1

Inputs
(* -1 x)
(* x (- x 1))
-1
(- x 1)
(pow x 2)
(* (pow x 2) (- 1 (/ 1 x)))
x
(* x (- 1 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 1)))

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

rewrite33.0ms (0.6%)

Memory

35.1MiB live, 82.3MiB allocated; 2ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	4	8
0	6	8
1	23	8
0	146	8

Stop Event

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

Counts

2 → 16

Calls

Call 1

Inputs
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(-.f64 x #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))))
(/.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))))
(fma.f64 #s(literal 1 binary64) x #s(literal -1 binary64))
(fma.f64 x #s(literal 1 binary64) #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))

eval2.0ms (0%)

Memory: 5.0MiB live, 5.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 212 to 58 computations (72.6% saved)

prune1.0ms (0%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	18	3	21
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	18	4	22

Accuracy

100.0%

Counts

22 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	92.8%	(/.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)))
▶	54.0%	#s(approx (* x (- x 1)) (*.f64 x x))
▶	50.2%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 32 to 22 computations (31.3% saved)

simplify487.0ms (9%)

Memory

23.9MiB live, 337.8MiB allocated; 57ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 8 expressions of interest:

New	Metric	Score
cost-diff	0	(-.f64 x #s(literal -1 binary64))
cost-diff	0	(fma.f64 x x #s(literal -1 binary64))
cost-diff	1	(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
cost-diff	4	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
cost-diff	0	(*.f64 x x)
cost-diff	0	#s(approx (* x (- x 1)) (*.f64 x x))
cost-diff	0	(neg.f64 x)
cost-diff	0	#s(approx (* x (- x 1)) (neg.f64 x))

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	13	49
0	19	49
1	31	49
2	79	49
3	293	43
4	1000	43
5	5962	43
0	8581	43

Stop Event

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

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x x)
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))
x
#s(literal -1 binary64)
(-.f64 x #s(literal -1 binary64))

Outputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
x
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x x)
x
(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.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 (pow.f64 x #s(literal 3 binary64)) x)
(fma.f64 x x #s(literal -1 binary64))
x
#s(literal -1 binary64)
(-.f64 x #s(literal -1 binary64))

localize30.0ms (0.5%)

Memory

-42.6MiB live, 49.4MiB allocated; 5ms collecting garbage

Localize:

Found 8 expressions of interest:

New	Metric	Score
accuracy	0.0	(fma.f64 x x #s(literal -1 binary64))
accuracy	0.0	(-.f64 x #s(literal -1 binary64))
accuracy	0.0390625	(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
accuracy	4.6529043286992	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
accuracy	0.0	(*.f64 x x)
accuracy	29.43381062209899	#s(approx (* x (- x 1)) (*.f64 x x))
accuracy	0.0	(neg.f64 x)
accuracy	31.893912226435845	#s(approx (* x (- x 1)) (neg.f64 x))

Samples

19.0ms

256×

valid

Compiler

Compiled 47 to 13 computations (72.3% saved)

Precisions

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

ival-mult: 5.0ms (44.3% of total)

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

ival-div: 1.0ms (8.9% of total)

ival-add: 1.0ms (8.9% of total)

ival-neg: 1.0ms (8.9% of total)

adjust: 0.0ms (0% of total)

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

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

exact: 0.0ms (0% of total)

series5.0ms (0.1%)

Memory

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

Counts

8 → 15

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x 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))
(-.f64 x #s(literal -1 binary64))

Outputs
(* -1 x)
(* x (- x 1))
(pow x 2)
(* x (- (pow x 2) 1))
-1
(- (pow x 2) 1)
1
(+ 1 x)
(* (pow x 2) (- 1 (/ 1 x)))
(pow x 3)
(* (pow x 3) (- 1 (/ 1 (pow x 2))))
(* (pow x 2) (- 1 (/ 1 (pow x 2))))
x
(* x (+ 1 (/ 1 x)))
(* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))

Calls

3 calls:

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

Time

Variable

Point

Expression

2.0ms

-inf

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

1.0ms

inf

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

1.0ms

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

simplify400.0ms (7.4%)

Memory

-21.4MiB live, 351.6MiB allocated; 44ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	58
1	52	58
2	109	58
3	455	55
4	2978	55
5	7973	55
0	8082	53

Stop Event

1×	iter limit
1×	node limit

Counts

15 → 14

Calls

Call 1

Inputs
(* -1 x)
(* x (- x 1))
(pow x 2)
(* x (- (pow x 2) 1))
-1
(- (pow x 2) 1)
1
(+ 1 x)
(* (pow x 2) (- 1 (/ 1 x)))
(pow x 3)
(* (pow x 3) (- 1 (/ 1 (pow x 2))))
(* (pow x 2) (- 1 (/ 1 (pow x 2))))
x
(* x (+ 1 (/ 1 x)))
(* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))

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

rewrite57.0ms (1.1%)

Memory

-9.3MiB live, 36.6MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	45
0	19	45
1	67	40
0	471	40

Stop Event

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

Counts

8 → 107

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x 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))
(-.f64 x #s(literal -1 binary64))

Outputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 x)
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 (pow.f64 x #s(literal 1 binary64)) (pow.f64 x #s(literal 1 binary64)))
(*.f64 (neg.f64 (fabs.f64 x)) (neg.f64 (fabs.f64 x)))
(*.f64 (neg.f64 (neg.f64 x)) (neg.f64 (neg.f64 x)))
(*.f64 (fabs.f64 (fabs.f64 x)) (fabs.f64 (fabs.f64 x)))
(*.f64 (fabs.f64 x) (fabs.f64 x))
(*.f64 (neg.f64 x) (neg.f64 x))
(*.f64 x x)
(pow.f64 (fabs.f64 x) #s(literal 2 binary64))
(pow.f64 (neg.f64 x) #s(literal 2 binary64))
(pow.f64 x #s(literal 2 binary64))
(neg.f64 (*.f64 (neg.f64 x) x))
(neg.f64 (*.f64 x (neg.f64 x)))
(fabs.f64 (*.f64 x x))
(exp.f64 (*.f64 (log.f64 x) #s(literal 2 binary64)))
(.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 #s(literal -1 binary64) x (pow.f64 x #s(literal 3 binary64)))
(fma.f64 (.f64 x x) x (.f64 #s(literal -1 binary64) x))
(fma.f64 x #s(literal -1 binary64) (pow.f64 x #s(literal 3 binary64)))
(fma.f64 x (.f64 x x) (.f64 #s(literal -1 binary64) x))
(+.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 #s(literal -1 binary64) (.f64 x x)))))
(/.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 (pow.f64 #s(literal -1 binary64) #s(literal 3/2 binary64)) (pow.f64 #s(literal -1 binary64) #s(literal 3/2 binary64)) (*.f64 x x))
(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 #s(literal -1 binary64) #s(literal 1 binary64) (*.f64 x x))
(fma.f64 (neg.f64 x) (neg.f64 x) #s(literal -1 binary64))
(fma.f64 #s(literal 1 binary64) #s(literal -1 binary64) (*.f64 x x))
(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 #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 x x) #s(literal 1 binary64))
(+.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 #s(literal -1 binary64) (*.f64 x x))
(+.f64 (*.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)))
(fma.f64 (pow.f64 #s(literal 1 binary64) #s(literal 3/2 binary64)) (pow.f64 #s(literal 1 binary64) #s(literal 3/2 binary64)) x)
(fma.f64 (*.f64 #s(literal -1 binary64) x) #s(literal -1 binary64) #s(literal 1 binary64))
(fma.f64 #s(literal -1 binary64) #s(literal -1 binary64) x)
(fma.f64 #s(literal 1 binary64) #s(literal 1 binary64) x)
(fma.f64 #s(literal 1 binary64) x #s(literal 1 binary64))
(fma.f64 x #s(literal 1 binary64) #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))

eval12.0ms (0.2%)

Memory: 20.9MiB live, 20.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 1 625 to 350 computations (78.5% saved)

prune3.0ms (0%)

Memory

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

Pruning

4 alts after pruning (1 fresh and 3 done)

	Pruned	Kept	Total
New	114	1	115
Fresh	0	0	0
Picked	1	2	3
Done	0	1	1
Total	115	4	119

Accuracy

100.0%

Counts

119 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	48.8%	(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
✓	54.0%	#s(approx (* x (- x 1)) (*.f64 x x))
✓	50.2%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 35 to 25 computations (28.6% saved)

simplify1.1s (21.2%)

Memory

21.1MiB live, 770.3MiB allocated; 210ms collecting garbage

Algorithm

1×	egg-herbie

Localize:

Found 4 expressions of interest:

New	Metric	Score	Program
cost-diff	0	(-.f64 x #s(literal -1 binary64))
cost-diff	0	#s(approx (+ (* x x) -1) #s(literal -1 binary64))
cost-diff	0	(.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x)
cost-diff	0	(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	34
0	11	34
1	23	34
2	57	34
3	123	34
4	285	34
5	1149	34
6	6588	34
0	9166	31

Stop Event

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

Calls

Call 1

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

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

localize33.0ms (0.6%)

Memory

-36.0MiB live, 22.7MiB allocated; 8ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 x #s(literal -1 binary64))
accuracy	0.0390625	(.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x)
accuracy	4.6529043286992	(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
accuracy	32.776536721743774	#s(approx (+ (* x x) -1) #s(literal -1 binary64))

Samples

27.0ms

256×

valid

Compiler

Compiled 30 to 9 computations (70% saved)

Precisions

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

ival-sub: 15.0ms (69% of total)

ival-mult: 3.0ms (13.8% of total)

ival-div: 1.0ms (4.6% of total)

ival-add: 1.0ms (4.6% 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)

series2.0ms (0%)

Memory

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

Counts

4 → 15

Calls

Call 1

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

Outputs
(* -1 x)
(* x (- x 1))
(* x (- (pow x 2) 1))
-1
(- (pow x 2) 1)
1
(+ 1 x)
(pow x 2)
(* (pow x 2) (- 1 (/ 1 x)))
(pow x 3)
(* (pow x 3) (- 1 (/ 1 (pow x 2))))
(* (pow x 2) (- 1 (/ 1 (pow x 2))))
x
(* x (+ 1 (/ 1 x)))
(* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))

Calls

3 calls:

Time

Variable

Point

Expression

1.0ms

-inf

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

1.0ms

inf

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

0.0ms

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

simplify420.0ms (7.8%)

Memory

17.0MiB live, 249.1MiB allocated; 34ms collecting garbage

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	25	58
1	52	58
2	109	58
3	455	55
4	2984	55
5	7962	55
0	8071	53

Stop Event

1×	iter limit
1×	node limit

Counts

15 → 14

Calls

Call 1

Inputs
(* -1 x)
(* x (- x 1))
(* x (- (pow x 2) 1))
-1
(- (pow x 2) 1)
1
(+ 1 x)
(pow x 2)
(* (pow x 2) (- 1 (/ 1 x)))
(pow x 3)
(* (pow x 3) (- 1 (/ 1 (pow x 2))))
(* (pow x 2) (- 1 (/ 1 (pow x 2))))
x
(* x (+ 1 (/ 1 x)))
(* -1 (* (pow x 3) (- (/ 1 (pow x 2)) 1)))

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

rewrite40.0ms (0.7%)

Memory

-9.9MiB live, 34.0MiB allocated; 5ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	8	32
0	11	32
1	50	32
0	344	29

Stop Event

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

Counts

4 → 25

Calls

Call 1

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

Outputs
(.f64 (/.f64 (.f64 #s(approx (+ (* x x) -1) #s(literal -1 binary64)) x) (fma.f64 x x #s(literal -1 binary64))) (-.f64 x #s(literal 1 binary64)))
(.f64 (/.f64 (.f64 #s(approx (+ (* x x) -1) #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))) #s(approx (+ ( x x) -1) #s(literal -1 binary64)))
(.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) (/.f64 x (-.f64 x #s(literal -1 binary64))))
(.f64 x (/.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) (-.f64 x #s(literal -1 binary64))))
(/.f64 (neg.f64 (.f64 (neg.f64 x) #s(approx (+ ( x x) -1) #s(literal -1 binary64)))) (neg.f64 (neg.f64 (-.f64 x #s(literal -1 binary64)))))
(/.f64 (.f64 (neg.f64 x) #s(approx (+ ( x x) -1) #s(literal -1 binary64))) (neg.f64 (-.f64 x #s(literal -1 binary64))))
(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
(neg.f64 (/.f64 (.f64 (neg.f64 x) #s(approx (+ ( x x) -1) #s(literal -1 binary64))) (-.f64 x #s(literal -1 binary64))))
(neg.f64 (/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (neg.f64 (-.f64 x #s(literal -1 binary64)))))
(.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x)
(.f64 x #s(approx (+ ( x x) -1) #s(literal -1 binary64)))
#s(approx (+ (* x x) -1) #s(literal -1 binary64))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 #s(literal 1 binary64) #s(literal 3 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))))
(fma.f64 #s(literal 1 binary64) #s(literal 1 binary64) x)
(fma.f64 #s(literal -1 binary64) #s(literal -1 binary64) x)
(-.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))

eval3.0ms (0.1%)

Memory: 8.0MiB live, 8.0MiB allocated; 0ms collecting garbage
Compiler: Compiled 554 to 94 computations (83% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (0 fresh and 4 done)

	Pruned	Kept	Total
New	33	0	33
Fresh	0	0	0
Picked	0	1	1
Done	0	3	3
Total	33	4	37

Accuracy

100.0%

Counts

37 → 4

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	48.8%	(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
✓	100.0%	(*.f64 x (-.f64 x #s(literal 1 binary64)))
✓	54.0%	#s(approx (* x (- x 1)) (*.f64 x x))
✓	50.2%	#s(approx (* x (- x 1)) (neg.f64 x))

Compiler

Compiled 80 to 47 computations (41.3% saved)

regimes4.0ms (0.1%)

Memory

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

Counts

5 → 1

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
#s(approx (* x (- x 1)) (*.f64 x x))
(*.f64 x (-.f64 x #s(literal 1 binary64)))
(/.f64 (.f64 #s(approx (+ ( x x) -1) #s(literal -1 binary64)) 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:

2.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)

regimes7.0ms (0.1%)

Memory

-37.4MiB live, 9.3MiB allocated; 2ms collecting garbage

Counts

2 → 2

Calls

Call 1

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

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

Calls

2 calls:

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

Results

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

Compiler

Compiled 6 to 5 computations (16.7% saved)

regimes2.0ms (0%)

Memory

5.7MiB live, 5.7MiB 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
50.2%	1	`x`
50.2%	1	`(*.f64 x (-.f64 x #s(literal 1 binary64)))`

Compiler

Compiled 6 to 5 computations (16.7% saved)

bsearch0.0ms (0%)

Memory

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

Algorithm

1×	left-value

Steps

Time	Left	Right
0.0ms	8.867260624725549e-14	996013196747.2114

Compiler

Compiled 8 to 8 computations (0% saved)

simplify53.0ms (1%)

Memory

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

Algorithm

1×	egg-herbie

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	13	38
1	22	38
2	29	38
3	45	38
4	82	38
5	326	38
6	3206	38
7	7190	38

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 3961408125713217/39614081257132168796771975168 binary64)) #s(approx (* x (- x 1)) (neg.f64 x)) #s(approx (* x (- x 1)) (*.f64 x 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 3961408125713217/39614081257132168796771975168 binary64)) #s(approx (* x (- x 1)) (neg.f64 x)) #s(approx (* x (- x 1)) (*.f64 x x)))

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

derivations300.0ms (5.5%)

Memory

-54.5MiB live, 65.2MiB allocated; 28ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	15	26
1	28	26
2	48	26
3	96	26
4	333	26
5	2061	26
6	6597	26
0	8161	26

Stop Event

1×	done
1×	iter limit
1×	node limit

Compiler

Compiled 38 to 14 computations (63.2% saved)

preprocess32.0ms (0.6%)

Memory: 5.1MiB live, 50.1MiB allocated; 3ms collecting garbage
Compiler: Compiled 96 to 42 computations (56.3% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample676.0ms (12.5%)

explain42.0ms (0.8%)

preprocess485.0ms (9%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify635.0ms (11.7%)

localize13.0ms (0.2%)

series1.0ms (0%)

simplify482.0ms (8.9%)

rewrite33.0ms (0.6%)

eval2.0ms (0%)

prune1.0ms (0%)

simplify487.0ms (9%)

localize30.0ms (0.5%)

series5.0ms (0.1%)

simplify400.0ms (7.4%)

rewrite57.0ms (1.1%)

eval12.0ms (0.2%)

prune3.0ms (0%)

simplify1.1s (21.2%)

localize33.0ms (0.6%)

series2.0ms (0%)

simplify420.0ms (7.8%)

rewrite40.0ms (0.7%)

eval3.0ms (0.1%)

prune3.0ms (0.1%)

regimes4.0ms (0.1%)

regimes7.0ms (0.1%)

regimes2.0ms (0%)

bsearch0.0ms (0%)

simplify53.0ms (1%)

derivations300.0ms (5.5%)

preprocess32.0ms (0.6%)

end0.0ms (0%)

Profiling