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.5MiB live, 0.5MiB 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)

sample613.0ms (24.5%)

Memory

41.5MiB live, 740.5MiB allocated; 181ms collecting garbage

Samples

374.0ms

8 256×

valid

Precisions

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

ival-mult: 109.0ms (50.9% of total)

ival-sub: 90.0ms (42% of total)

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

exact: 5.0ms (2.3% of total)

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

adjust: 2.0ms (0.9% of total)

Bogosity

explain92.0ms (3.7%)

Memory

-24.1MiB live, 112.9MiB allocated; 14ms 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

18.0ms

512×

valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

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

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

preprocess286.0ms (11.4%)

Memory

9.3MiB live, 311.9MiB allocated; 39ms 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

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)

simplify148.0ms (5.9%)

Memory

-28.9MiB live, 157.4MiB allocated; 21ms collecting garbage

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	5137	10
0	8310	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.5%)

Memory

23.4MiB live, 23.4MiB 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.01953125	(*.f64 x (-.f64 x #s(literal 1 binary64)))

Samples

9.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 (54.5% of total)

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

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
#s(approx (* x (- x 1)) #s(hole binary64 (* -1 x)))
#s(approx (* x (- x 1)) #s(hole binary64 (* x (- x 1))))
#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 1))
0.0ms	x	@	-inf	((* x (- x 1)) (- x 1))
0.0ms	x	@	0	((* x (- x 1)) (- x 1))

simplify125.0ms (5%)

Memory

2.0MiB live, 90.6MiB allocated; 14ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	24	70
1	37	70
2	57	70
3	105	70
4	331	70
5	2050	70
6	6548	70
0	8070	70

Stop Event

1×	iter limit
1×	node limit

Counts

9 → 9

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 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 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 (1.7%)

Memory

-12.9MiB live, 42.6MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

2 → 14

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))))
(-.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.1%)

Memory: 5.9MiB live, 5.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 207 to 56 computations (72.9% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

4 alts after pruning (3 fresh and 1 done)

	Pruned	Kept	Total
New	17	3	20
Fresh	0	0	0
Picked	0	1	1
Done	0	0	0
Total	17	4	21

Accuracy

100.0%

Counts

21 → 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)

simplify195.0ms (7.8%)

Memory

27.4MiB live, 162.4MiB allocated; 17ms collecting garbage

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	#s(approx (- x 1) x)
cost-diff	0	(*.f64 x #s(approx (- x 1) 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	20	49
1	33	49
2	81	49
3	292	43
4	1005	43
5	5982	43
0	8080	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
(*.f64 x #s(approx (- x 1) x))
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))
x
#s(literal -1 binary64)
(-.f64 x #s(literal -1 binary64))

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

localize53.0ms (2.1%)

Memory

-12.3MiB live, 87.3MiB allocated; 13ms 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.05078125	(*.f64 (fma.f64 x x #s(literal -1 binary64)) x)
accuracy	4.429835992056315	(/.f64 (*.f64 (fma.f64 x x #s(literal -1 binary64)) x) (-.f64 x #s(literal -1 binary64)))
accuracy	0.01953125	(*.f64 x #s(approx (- x 1) x))
accuracy	32.56845774265325	#s(approx (- x 1) x)
accuracy	0.0	(neg.f64 x)
accuracy	30.071466431201348	#s(approx (* x (- x 1)) (neg.f64 x))

Samples

42.0ms

256×

valid

Compiler

Compiled 47 to 13 computations (72.3% saved)

Precisions

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

ival-sub: 20.0ms (68.3% of total)

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

ival-div: 2.0ms (6.8% of total)

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

ival-neg: 1.0ms (3.4% 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)

series4.0ms (0.2%)

Memory

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

Counts

8 → 27

Calls

Call 1

Inputs
#s(approx (* x (- x 1)) (neg.f64 x))
(neg.f64 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))
(-.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 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
1.0ms	x	@	-inf	((* x (- x 1)) (neg x) (* x (- x 1)) (- x 1) (/ (* (+ (* 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 1) (/ (* (+ (* 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 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) (- x -1))

Time

Variable

Point

Expression

1.0ms

-inf

((* x (- x 1)) (neg x) (* x (- x 1)) (- x 1) (/ (* (+ (* 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 1) (/ (* (+ (* 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 1) (/ (* (+ (* x x) -1) x) (- x -1)) (* (+ (* x x) -1) x) (+ (* x x) -1) (- x -1))

simplify165.0ms (6.6%)

Memory

-20.8MiB live, 268.1MiB allocated; 35ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	62	242
1	104	234
2	238	226
3	1139	226
4	5834	226
0	8064	220

Stop Event

1×	iter limit
1×	node limit

Counts

27 → 27

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

rewrite58.0ms (2.3%)

Memory

-1.4MiB live, 55.3MiB allocated; 3ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	13	45
0	20	45
1	69	40
0	477	40

Stop Event

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

Counts

8 → 86

Calls

Call 1

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

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

eval44.0ms (1.8%)

Memory: -20.0MiB live, 24.7MiB allocated; 6ms collecting garbage
Compiler: Compiled 1 433 to 317 computations (77.9% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (1 fresh and 4 done)

	Pruned	Kept	Total
New	99	1	100
Fresh	0	0	0
Picked	0	3	3
Done	0	1	1
Total	99	5	104

Accuracy

100.0%

Counts

104 → 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)

simplify147.0ms (5.9%)

Memory

32.6MiB live, 122.8MiB allocated; 9ms collecting garbage

Localize:

Found 4 expressions of interest:

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

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	9	31
0	12	31
1	21	31
2	64	29
3	183	27
4	503	27
5	2096	27
0	8010	27

Stop Event

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

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 #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)

localize47.0ms (1.9%)

Memory

-2.7MiB live, 49.9MiB allocated; 8ms collecting garbage

Localize:

Found 4 expressions of interest:

New	Metric	Score
accuracy	0.0	(-.f64 x #s(literal -1 binary64))
accuracy	0.0	(neg.f64 x)
accuracy	4.429835992056315	(/.f64 #s(approx (* (+ (* x x) -1) x) (neg.f64 x)) (-.f64 x #s(literal -1 binary64)))
accuracy	30.890676087262754	#s(approx (* (+ (* x x) -1) x) (neg.f64 x))

Samples

41.0ms

256×

valid

Compiler

Compiled 27 to 10 computations (63% saved)

Precisions

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

ival-mult: 29.0ms (84.4% of total)

ival-div: 2.0ms (5.8% of total)

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

ival-sub: 1.0ms (2.9% of total)

ival-neg: 1.0ms (2.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)

series18.0ms (0.7%)

Memory

-39.5MiB live, 5.1MiB allocated; 7ms collecting garbage

Counts

4 → 14

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)
(-.f64 x #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 -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

16.0ms

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

1.0ms

inf

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

1.0ms

-inf

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

simplify150.0ms (6%)

Memory

9.1MiB live, 149.3MiB allocated; 27ms collecting garbage

Iterations

Useful iterations: 3 (0.0ms)

Iter	Nodes	Cost
0	44	158
1	80	146
2	198	134
3	1070	118
4	5565	118
0	8299	118

Stop Event

1×	iter limit
1×	node limit

Counts

14 → 14

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

rewrite52.0ms (2.1%)

Memory

7.1MiB live, 51.1MiB allocated; 13ms collecting garbage

Iterations

Useful iterations: 0 (0.0ms)

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

Stop Event

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

Counts

4 → 19

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)
(-.f64 x #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)
(/.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))

eval3.0ms (0.1%)

Memory: 4.9MiB live, 4.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 509 to 84 computations (83.5% saved)

prune3.0ms (0.1%)

Memory

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

Pruning

5 alts after pruning (0 fresh and 5 done)

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

Accuracy

100.0%

Counts

33 → 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)

regimes4.0ms (0.2%)

Memory

10.5MiB live, 10.5MiB allocated; 0ms 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:

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)

regimes3.0ms (0.1%)

Memory

8.0MiB live, 8.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	(*.f64 x (-.f64 x #s(literal 1 binary64)))
1.0ms	x

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)

regimes43.0ms (1.7%)

Memory

-36.4MiB live, 9.7MiB allocated; 6ms 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:

41.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.8MiB live, 0.8MiB 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)

simplify56.0ms (2.2%)

Memory

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

derivations104.0ms (4.2%)

Memory

-20.4MiB live, 90.1MiB allocated; 87ms collecting garbage

Stop Event

1×

done

Compiler

Compiled 36 to 14 computations (61.1% saved)

preprocess22.0ms (0.9%)

Memory: 30.0MiB live, 73.7MiB allocated; 7ms 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%)

sample613.0ms (24.5%)

explain92.0ms (3.7%)

preprocess286.0ms (11.4%)

eval0.0ms (0%)

prune0.0ms (0%)

simplify148.0ms (5.9%)

localize13.0ms (0.5%)

series1.0ms (0.1%)

simplify125.0ms (5%)

rewrite42.0ms (1.7%)

eval2.0ms (0.1%)

prune2.0ms (0.1%)

simplify195.0ms (7.8%)

localize53.0ms (2.1%)

series4.0ms (0.2%)

simplify165.0ms (6.6%)

rewrite58.0ms (2.3%)

eval44.0ms (1.8%)

prune3.0ms (0.1%)

simplify147.0ms (5.9%)

localize47.0ms (1.9%)

series18.0ms (0.7%)

simplify150.0ms (6%)

rewrite52.0ms (2.1%)

eval3.0ms (0.1%)

prune3.0ms (0.1%)

regimes4.0ms (0.2%)

regimes3.0ms (0.1%)

regimes43.0ms (1.7%)

bsearch0.0ms (0%)

simplify56.0ms (2.2%)

derivations104.0ms (4.2%)

preprocess22.0ms (0.9%)

end0.0ms (0%)

Profiling