Metrics for Cancel like terms

start0.0ms (0%)

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

analyze0.0ms (0%)

Memory

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

sample808.0ms (77.4%)

Memory

54.3MiB live, 371.0MiB allocated; 890ms collecting garbage

Samples

541.0ms	3 857×	1	valid
94.0ms	4 399×	0	valid

Precisions

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

ival-add!: 117.0ms (58.4% of total)

adjust: 56.0ms (28% of total)

ival-sub!: 28.0ms (14% of total)

Bogosity

explain54.0ms (5.1%)

Memory

4.7MiB live, 47.8MiB allocated; 7ms collecting garbage

FPErrors

Click to see full error table

Ground Truth	Overpredictions	Example	Example	Subexpression
127	3	(-45194502051.79203)	-	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`
0	0	-	-	`(+.f64 #s(literal 1 binary64) x)`
0	0	-	-	`#s(literal 1 binary64)`
0	0	-	-	`x`

Explanations

Click to see full explanations table

Operator	Subexpression	Explanation	Count
`-.f64`	`(-.f64 (+.f64 #s(literal 1 binary64) x) x)`	cancellation	130	0

Confusion

	Predicted +	Predicted -
+	127	0
-	3	126

Precision

0.9769230769230769

Recall

1.0

Confusion?

	Predicted +	Predicted Maybe	Predicted -
+	127	0	0
-	3	0	126

Precision?

0.9769230769230769

Recall?

1.0

Freqs

test

number	freq
0	126
1	130

Total Confusion?

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

Precision?

1.0

Recall?

1.0

Samples

13.0ms	250×	1	valid
7.0ms	262×	0	valid

Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions

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

adjust: 4.0ms (51.6% of total)

ival-add!: 2.0ms (25.8% of total)

ival-sub!: 2.0ms (25.8% of total)

preprocess47.0ms (4.5%)

Memory

-15.5MiB live, 36.7MiB allocated; 7ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	8	18
1	16	3
2	31	3
3	128	3
4	788	3
5	3523	3

Stop Event

1×	node-limit

Alt Table

Click to see full alt table

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

Symmetry

(abs x)

Compiler

Compiled 10 to 8 computations (20% saved)

series1.0ms (0.1%)

Memory

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

Counts

4 → 6

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(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 1))
#s(approx (+ 1 x) #s(hole binary64 (+ 1 x)))
#s(approx x #s(hole binary64 x))
#s(approx (+ 1 x) #s(hole binary64 x))
#s(approx (+ 1 x) #s(hole binary64 (* x (+ 1 (/ 1 x)))))

Calls

3 calls:

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

rewrite61.0ms (5.9%)

Memory

12.5MiB live, 55.4MiB allocated; 9ms collecting garbage

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	15	48
0	16	40
1	67	36
0	519	36

Stop Event

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

Counts

10 → 28

Calls

Call 1

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

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

eval8.0ms (0.8%)

Memory: -40.5MiB live, 5.3MiB allocated; 5ms collecting garbage
Compiler: Compiled 295 to 88 computations (70.2% saved)

prune1.0ms (0.1%)

Memory

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

Pruning

1 alts after pruning (1 fresh and 0 done)

	Pruned	Kept	Total
New	24	1	25
Fresh	0	0	0
Picked	1	0	1
Done	0	0	0
Total	25	1	26

Accuracy

100.0%

Counts

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

series0.0ms (0%)

Memory

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

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(hole binary64 1))

Calls

3 calls:

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

rewrite51.0ms (4.8%)

Memory

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

Iterations

Useful iterations: 1 (0.0ms)

Iter	Nodes	Cost
0	5	15
0	5	15
1	34	7
0	307	7

Stop Event

1×	iter-limit
1×	iter-limit
1×	iter-limit
1×	unsound
1×	saturated

Counts

3 → 3

Calls

Call 1

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

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

eval0.0ms (0%)

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

prune1.0ms (0.1%)

Memory

0.7MiB live, 0.7MiB 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 19 to 14 computations (26.3% saved)

regimes2.0ms (0.2%)

Memory

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

Accuracy

Total -30.8b remaining (-∞%)

Threshold costs -30.8b (-∞%)

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 6 to 5 computations (16.7% saved)

derivations1.0ms (0.1%)

Memory

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

Stop Event

1×

done

Compiler

Compiled 7 to 6 computations (14.3% saved)

preprocess8.0ms (0.7%)

Memory: 7.7MiB live, 7.7MiB allocated; 0ms collecting garbage
Remove: (abs x)
Compiler: Compiled 38 to 32 computations (15.8% saved)

end0.0ms (0%)

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

start0.0ms (0%)

analyze0.0ms (0%)

sample808.0ms (77.4%)

explain54.0ms (5.1%)

preprocess47.0ms (4.5%)

series1.0ms (0.1%)

rewrite61.0ms (5.9%)

eval8.0ms (0.8%)

prune1.0ms (0.1%)

series0.0ms (0%)

rewrite51.0ms (4.8%)

eval0.0ms (0%)

prune1.0ms (0.1%)

regimes2.0ms (0.2%)

derivations1.0ms (0.1%)

preprocess8.0ms (0.7%)

end0.0ms (0%)

Profiling