Metrics for Cancel like terms

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)

sample778.0ms (79.8%)

Memory

14.5MiB live, 374.3MiB allocated; 872ms collecting garbage

Samples

450.0ms	3 887×	1	valid
149.0ms	4 369×	0	valid

Precisions

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

adjust: 57.0ms (47.8% of total)

ival-add!: 36.0ms (30.2% of total)

ival-sub!: 27.0ms (22.6% of total)

Bogosity

preprocess80.0ms (8.2%)

Memory

-2.5MiB live, 46.9MiB allocated; 17ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	16
1	28	3
2	76	3
3	296	3
4	3463	3

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 10 to 8 computations (20% saved)

series4.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	11	28

Stop Event

1×	iter-limit

Counts

4 → 4

Calls

Call 1

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

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

Calls

3 calls:

Time	Variable	Point
0.0ms	x	-inf
0.0ms	x	inf
0.0ms	x	0

rewrite55.0ms (5.6%)

Memory

-1.1MiB live, 42.1MiB allocated; 10ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	4	10
0	6	14
1	46	6
0	532	6

Stop Event

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

Counts

4 → 27

Calls

Call 1

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

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

eval4.0ms (0.5%)

Memory: 6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Compiler: Compiled 307 to 94 computations (69.4% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	27	1	28
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	28	1	29

Accuracy

100.0%

Counts

29 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 7 to 6 computations (14.3% saved)

series1.0ms (0.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	5	7

Stop Event

1×	iter-limit

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Calls

3 calls:

Time	Variable	Point
0.0ms	x	0
0.0ms	x	inf
0.0ms	x	-inf

rewrite41.0ms (4.2%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	8
0	5	8
1	45	4
0	532	4

Stop Event

1×	iter-limit
1×	iter-limit
1×	node-limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))
#s(literal 1 binary64)

eval0.0ms (0%)

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

prune0.0ms (0%)

Memory

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

Pruning

1 alts after pruning (0 fresh and 1 done)

	Kept	Total
New	0	0
Fresh	0	0
Picked	1	1
Done	0	0
Total	1	1

Accuracy

100.0%

Counts

1 → 1

Alt Table

Click to see full alt table

Status	Accuracy	Program
✓	100.0%	#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Compiler

Compiled 7 to 6 computations (14.3% saved)

regimes3.0ms (0.3%)

Memory

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

Accuracy

Total -32.9b remaining (-∞%)

Threshold costs -32.9b (-∞%)

Counts

2 → 1

Calls

Call 1

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

Outputs
#s(approx (- (+ 1 x) x) #s(literal 1 binary64))

Calls

2 calls:

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

Results

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

Compiler

Compiled 18 to 13 computations (27.8% saved)

derivations0.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess7.0ms (0.7%)

Memory: 7.5MiB live, 7.5MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 26 to 22 computations (15.4% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample778.0ms (79.8%)

preprocess80.0ms (8.2%)

series4.0ms (0.4%)

rewrite55.0ms (5.6%)

eval4.0ms (0.5%)

prune1.0ms (0.1%)

series1.0ms (0.1%)

rewrite41.0ms (4.2%)

eval0.0ms (0%)

prune0.0ms (0%)

regimes3.0ms (0.3%)

derivations0.0ms (0%)

preprocess7.0ms (0.7%)

end0.0ms (0%)

Profiling