Metrics for Commute and associate

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%	99.9%	0.1%	0%	0%	0%	0
100%	99.9%	0%	0.1%	0%	0%	0%	1

Compiler

Compiled 13 to 10 computations (23.1% saved)

sample1.7s (76.3%)

Memory

18.1MiB live, 1 147.1MiB allocated; 787ms collecting garbage

Samples

734.0ms	4 145×	1	valid
634.0ms	4 108×	2	valid
0.0ms	3×	0	valid

Precisions

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

ival-add!: 408.0ms (48% of total)

adjust: 399.0ms (47% of total)

ival-sub!: 42.0ms (4.9% of total)

Bogosity

preprocess47.0ms (2.1%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	39	110
1	163	10
2	744	10
3	2597	10
4	4091	10

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

Status	Accuracy	Program
▶	100.0%	(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))

Symmetry

(abs x)

(abs y)

(abs z)

(negabs x)

(negabs y)

(negabs z)

(sort x y z)

Compiler

Compiled 16 to 16 computations (0% saved)

series8.0ms (0.4%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	88	274

Stop Event

1×	iter-limit

Counts

8 → 22

Calls

Call 1

Inputs
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(+.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z
(+.f64 x (+.f64 y z))
(+.f64 y z)

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

Calls

9 calls:

Time	Variable		Point	Expression
1.0ms	x	@	-inf	((- (+ (+ x y) z) (+ x (+ y z))) (+ (+ x y) z) (+ x y) x y z (+ x (+ y z)) (+ y z))
1.0ms	x	@	inf	((- (+ (+ x y) z) (+ x (+ y z))) (+ (+ x y) z) (+ x y) x y z (+ x (+ y z)) (+ y z))
0.0ms	y	@	-inf	((- (+ (+ x y) z) (+ x (+ y z))) (+ (+ x y) z) (+ x y) x y z (+ x (+ y z)) (+ y z))
0.0ms	z	@	-inf	((- (+ (+ x y) z) (+ x (+ y z))) (+ (+ x y) z) (+ x y) x y z (+ x (+ y z)) (+ y z))
0.0ms	y	@	inf	((- (+ (+ x y) z) (+ x (+ y z))) (+ (+ x y) z) (+ x y) x y z (+ x (+ y z)) (+ y z))

rewrite222.0ms (9.8%)

Memory

-11.3MiB live, 258.5MiB allocated; 43ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	30
0	13	30
1	113	20
2	387	20
3	2512	20
0	9111	20
1	17985	20

Stop Event

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

Counts

8 → 49

Calls

Call 1

Inputs
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))
(+.f64 (+.f64 x y) z)
(+.f64 x y)
x
y
z
(+.f64 x (+.f64 y z))
(+.f64 y z)

Outputs
#s(literal 0 binary64)
(neg.f64 (-.f64 (-.f64 (neg.f64 y) z) x))
(-.f64 (+.f64 z x) (neg.f64 y))
(-.f64 (+.f64 z y) (neg.f64 x))
(-.f64 z (-.f64 (neg.f64 x) y))
(-.f64 (+.f64 y x) (neg.f64 z))
(-.f64 y (-.f64 (neg.f64 x) z))
(-.f64 y (+.f64 (neg.f64 x) (neg.f64 z)))
(-.f64 y (-.f64 (neg.f64 z) x))
(-.f64 x (-.f64 (neg.f64 y) z))
(+.f64 (neg.f64 (neg.f64 x)) (+.f64 z y))
(+.f64 (+.f64 z x) y)
(+.f64 (+.f64 z y) (neg.f64 (neg.f64 x)))
(+.f64 (+.f64 z y) x)
(+.f64 z (+.f64 y x))
(+.f64 (+.f64 y x) z)
(+.f64 y (+.f64 z x))
(+.f64 x (+.f64 z y))
(neg.f64 (-.f64 (neg.f64 x) y))
(-.f64 y (neg.f64 x))
(-.f64 x (neg.f64 y))
(+.f64 y (neg.f64 (neg.f64 x)))
(+.f64 y x)
(+.f64 x y)
x
y
z
(neg.f64 (-.f64 (-.f64 (neg.f64 y) z) x))
(-.f64 (+.f64 z x) (neg.f64 y))
(-.f64 (+.f64 z y) (neg.f64 x))
(-.f64 z (-.f64 (neg.f64 x) y))
(-.f64 (+.f64 y x) (neg.f64 z))
(-.f64 y (-.f64 (neg.f64 x) z))
(-.f64 y (+.f64 (neg.f64 x) (neg.f64 z)))
(-.f64 y (-.f64 (neg.f64 z) x))
(-.f64 x (-.f64 (neg.f64 y) z))
(+.f64 (neg.f64 (neg.f64 x)) (+.f64 z y))
(+.f64 (+.f64 z x) y)
(+.f64 (+.f64 z y) (neg.f64 (neg.f64 x)))
(+.f64 (+.f64 z y) x)
(+.f64 z (+.f64 y x))
(+.f64 (+.f64 y x) z)
(+.f64 y (+.f64 z x))
(+.f64 x (+.f64 z y))
(neg.f64 (-.f64 (neg.f64 y) z))
(-.f64 z (neg.f64 y))
(-.f64 y (neg.f64 z))
(+.f64 z y)
(+.f64 y z)

eval4.0ms (0.2%)

Memory: 9.9MiB live, 9.9MiB allocated; 0ms collecting garbage
Compiler: Compiled 275 to 196 computations (28.7% saved)

prune2.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	48	1	49
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	49	1	50

Accuracy

100.0%

Counts

50 → 1

Alt Table

Click to see full alt table

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

Compiler

Compiled 10 to 10 computations (0% saved)

series1.0ms (0.1%)

Memory

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

Iterations

Useful iterations: 0 (0.0ms)

Iter	Nodes	Cost
0	10	13

Stop Event

1×	iter-limit

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))
#s(literal 0 binary64)

Outputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))

Calls

9 calls:

Time	Variable		Point	Expression
0.0ms	y	@	0	((- (+ (+ x y) z) (+ x (+ y z))) 0)
0.0ms	x	@	0	((- (+ (+ x y) z) (+ x (+ y z))) 0)
0.0ms	x	@	-inf	((- (+ (+ x y) z) (+ x (+ y z))) 0)
0.0ms	y	@	inf	((- (+ (+ x y) z) (+ x (+ y z))) 0)
0.0ms	x	@	inf	((- (+ (+ x y) z) (+ x (+ y z))) 0)

rewrite197.0ms (8.7%)

Memory

-21.9MiB live, 89.3MiB allocated; 34ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	10	14
0	10	14
1	111	4
2	389	4
3	2721	4
0	8658	4
1	20020	4

Stop Event

1×	saturated
1×	node-limit
1×	saturated

Counts

2 → 2

Calls

Call 1

Inputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))
#s(literal 0 binary64)

Outputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))
#s(literal 0 binary64)

eval0.0ms (0%)

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

prune1.0ms (0%)

Memory

0.5MiB live, 0.5MiB 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 (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))

Compiler

Compiled 25 to 25 computations (0% saved)

regimes4.0ms (0.2%)

Memory

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

Accuracy

Total 0.0b remaining (0%)

Threshold costs 0b (0%)

Counts

2 → 1

Calls

Call 1

Inputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))
(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))

Outputs
#s(approx (- (+ (+ x y) z) (+ x (+ y z))) #s(literal 0 binary64))

Calls

4 calls:

1.0ms	z
1.0ms	y
1.0ms	x
1.0ms	(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))

Results

Accuracy	Segments	Branch
100.0%	1	`(-.f64 (+.f64 (+.f64 x y) z) (+.f64 x (+.f64 y z)))`
100.0%	1	`x`
100.0%	1	`y`
100.0%	1	`z`

Compiler

Compiled 11 to 17 computations (-54.5% saved)

derivations1.0ms (0%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 10 to 10 computations (0% saved)

preprocess49.0ms (2.2%)

Memory

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

Remove

(sort x y z)

(negabs z)

(negabs y)

(negabs x)

(abs z)

(abs y)

(abs x)

Compiler

Compiled 158 to 158 computations (0% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample1.7s (76.3%)

preprocess47.0ms (2.1%)

series8.0ms (0.4%)

rewrite222.0ms (9.8%)

eval4.0ms (0.2%)

prune2.0ms (0.1%)

series1.0ms (0.1%)

rewrite197.0ms (8.7%)

eval0.0ms (0%)

prune1.0ms (0%)

regimes4.0ms (0.2%)

derivations1.0ms (0%)

preprocess49.0ms (2.2%)

end0.0ms (0%)

Profiling