Data.Random.Distribution.Normal:doubleStdNormalZ from random-fu-0.2.6.2

Time bar (total: 4.9s)

start0.0ms (0%)

Memory
0.1MiB live, 0.1MiB allocated; 0ms collecting garbage

analyze0.0ms (0%)

Memory
0.5MiB live, 0.5MiB allocated; 0ms collecting garbage
Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
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)

sample627.0ms (12.8%)

Memory
-11.1MiB live, 749.9MiB allocated; 230ms collecting garbage
Samples
365.0ms8 256×0valid
Precisions
Click to see histograms. Total time spent on operations: 190.0ms
ival-add: 134.0ms (70.6% of total)
ival-sub: 40.0ms (21.1% of total)
ival-true: 5.0ms (2.6% of total)
exact: 5.0ms (2.6% of total)
ival-assert: 3.0ms (1.6% of total)
adjust: 2.0ms (1.1% of total)
Bogosity

explain52.0ms (1.1%)

Memory
24.2MiB live, 71.5MiB allocated; 3ms collecting garbage
FPErrors
Click to see full error table
Ground TruthOverpredictionsExampleUnderpredictionsExampleSubexpression
00-0-(+.f64 x x)
00-0-#s(literal 1 binary64)
00-0-(-.f64 (+.f64 x x) #s(literal 1 binary64))
00-0-x
Confusion
Predicted +Predicted -
+00
-0256
Precision
0/0
Recall
0/0
Confusion?
Predicted +Predicted MaybePredicted -
+000
-00256
Precision?
0/0
Recall?
0/0
Freqs
test
numberfreq
0256
Total Confusion?
Predicted +Predicted MaybePredicted -
+000
-001
Precision?
0/0
Recall?
0/0
Samples
16.0ms512×0valid
Compiler

Compiled 29 to 16 computations (44.8% saved)

Precisions
Click to see histograms. Total time spent on operations: 6.0ms
ival-add: 3.0ms (47.1% of total)
ival-sub: 2.0ms (31.4% of total)
ival-true: 1.0ms (15.7% of total)
adjust: 0.0ms (0% of total)
exact: 0.0ms (0% of total)
ival-assert: 0.0ms (0% of total)

preprocess16.0ms (0.3%)

Memory
-26.1MiB live, 20.8MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
11413
22211
33211
43611
53811
045
065
1125
2155
3175
0175
Stop Event
1×iter limit
1×saturated
1×iter limit
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

eval0.0ms (0%)

Memory
0.1MiB live, 0.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 0 to 1 computations (-∞% saved)

prune0.0ms (0%)

Memory
0.8MiB live, 0.8MiB allocated; 0ms collecting garbage
Alt Table
Click to see full alt table
StatusAccuracyProgram
▶100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Compiler

Compiled 5 to 4 computations (20% saved)

simplify4.0ms (0.1%)

Memory
5.1MiB live, 5.1MiB allocated; 0ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(+.f64 x x)
cost-diff0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0410
0610
11210
21510
31710
01710
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
x
#s(literal 1 binary64)
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x
#s(literal 1 binary64)

localize12.0ms (0.2%)

Memory
21.8MiB live, 21.8MiB allocated; 0ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(-.f64 (+.f64 x x) #s(literal 1 binary64))
accuracy0.0
(+.f64 x x)
Samples
8.0ms256×0valid
Compiler

Compiled 12 to 6 computations (50% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (32.9% of total)
ival-add: 1.0ms (32.9% 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
2 → 5
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
1.0ms
x
@inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@0
((- (+ x x) 1) (+ x x))
0.0ms
x
@-inf
((- (+ x x) 1) (+ x x))

simplify3.0ms (0.1%)

Memory
5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite79.0ms (1.6%)

Memory
-29.4MiB live, 66.7MiB allocated; 15ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
048
068
1348
02908
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 47
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(+.f64 x x)
Outputs
(*.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)) (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)))
(/.f64 (-.f64 (*.f64 x x) (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64)))) (-.f64 x (-.f64 x #s(literal 1 binary64))))
(/.f64 (+.f64 (pow.f64 x #s(literal 3 binary64)) (pow.f64 (-.f64 x #s(literal 1 binary64)) #s(literal 3 binary64))) (fma.f64 x x (-.f64 (*.f64 (-.f64 x #s(literal 1 binary64)) (-.f64 x #s(literal 1 binary64))) (*.f64 x (-.f64 x #s(literal 1 binary64))))))
(/.f64 (neg.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(/.f64 (neg.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))) (neg.f64 (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))
(/.f64 (-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64)) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(expm1.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64))))
(-.f64 (/.f64 (*.f64 #s(literal 2 binary64) x) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))) (/.f64 #s(literal 1 binary64) (fma.f64 #s(literal 2 binary64) x (fma.f64 #s(literal 2 binary64) x #s(literal 1 binary64)))))
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(+.f64 (-.f64 x #s(literal 1 binary64)) x)
(+.f64 x (-.f64 x #s(literal 1 binary64)))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval5.0ms (0.1%)

Memory
11.0MiB live, 11.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 589 to 151 computations (74.4% saved)

prune2.0ms (0%)

Memory
4.8MiB live, 4.8MiB allocated; 0ms collecting garbage
Pruning

2 alts after pruning (1 fresh and 1 done)

PrunedKeptTotal
New51152
Fresh000
Picked011
Done000
Total51253
Accuracy
100.0%
Counts
53 → 2
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶55.3%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 12 to 10 computations (16.7% saved)

simplify4.0ms (0.1%)

Memory
6.4MiB live, 6.4MiB allocated; 0ms collecting garbage
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
cost-diff0
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
068
068
1128
2158
3178
0178
Stop Event
1×iter limit
1×saturated
1×saturated
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(literal -1 binary64)

localize16.0ms (0.3%)

Memory
-26.0MiB live, 21.2MiB allocated; 4ms collecting garbage
Localize:

Found 1 expressions of interest:

NewMetricScoreProgram
accuracy28.625017853262044
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Samples
7.0ms256×0valid
Compiler

Compiled 8 to 7 computations (12.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (33.5% of total)
ival-add: 1.0ms (33.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%)

Memory
0.9MiB live, 0.9MiB allocated; 0ms collecting garbage
Counts
1 → 5
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@inf
((- (+ x x) 1))
0.0ms
x
@-inf
((- (+ x x) 1))
0.0ms
x
@0
((- (+ x x) 1))

simplify4.0ms (0.1%)

Memory
5.4MiB live, 5.4MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite43.0ms (0.9%)

Memory
-1.4MiB live, 46.0MiB allocated; 3ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
067
067
1347
02907
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×saturated
Counts
1 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

eval1.0ms (0%)

Memory
1.3MiB live, 1.3MiB allocated; 0ms collecting garbage
Compiler

Compiled 54 to 20 computations (63% saved)

prune1.0ms (0%)

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

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New415
Fresh000
Picked011
Done011
Total437
Accuracy
100.0%
Counts
7 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶46.7%
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
✓55.3%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 17 computations (19% saved)

simplify4.0ms (0.1%)

Memory
4.4MiB live, 4.4MiB allocated; 0ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(*.f64 #s(literal 2 binary64) x)
cost-diff0
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0714
0814
11514
21614
31814
01814
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
#s(literal 2 binary64)
x

localize14.0ms (0.3%)

Memory
20.0MiB live, 20.0MiB allocated; 0ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(*.f64 #s(literal 2 binary64) x)
accuracy34.11495968707645
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Samples
10.0ms256×0valid
Compiler

Compiled 12 to 8 computations (33.3% saved)

Precisions
Click to see histograms. Total time spent on operations: 5.0ms
ival-mult: 2.0ms (43.1% of total)
ival-sub: 1.0ms (21.5% of total)
ival-add: 1.0ms (21.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%)

Memory
1.6MiB live, 1.6MiB allocated; 0ms collecting garbage
Counts
2 → 5
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@-inf
((- (+ x x) 1) (* 2 x))
0.0ms
x
@inf
((- (+ x x) 1) (* 2 x))
0.0ms
x
@0
((- (+ x x) 1) (* 2 x))

simplify4.0ms (0.1%)

Memory
3.4MiB live, 3.4MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite48.0ms (1%)

Memory
-19.1MiB live, 33.5MiB allocated; 6ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0712
0812
13712
029712
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 39
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 #s(literal 2 binary64) x)
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) #s(literal 2 binary64))
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 (*.f64 x x) #s(literal 4 binary64))
(*.f64 (pow.f64 x #s(literal 3 binary64)) #s(literal 8 binary64))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 x (*.f64 #s(literal 2 binary64) (*.f64 #s(literal 2 binary64) x)))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval4.0ms (0.1%)

Memory
10.2MiB live, 10.2MiB allocated; 0ms collecting garbage
Compiler

Compiled 625 to 133 computations (78.7% saved)

prune2.0ms (0%)

Memory
5.5MiB live, 5.5MiB allocated; 0ms collecting garbage
Pruning

3 alts after pruning (1 fresh and 2 done)

PrunedKeptTotal
New43144
Fresh000
Picked101
Done022
Total44347
Accuracy
100.0%
Counts
47 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
▶46.7%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓55.3%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 21 to 16 computations (23.8% saved)

simplify8.0ms (0.2%)

Memory
-39.8MiB live, 7.5MiB allocated; 3ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
cost-diff0
(+.f64 x x)
cost-diff0
#s(approx (- (+ x x) 1) (+.f64 x x))
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0613
0713
11313
21613
31813
01813
Stop Event
1×iter limit
1×saturated
1×iter limit
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
x
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(+.f64 x x)
(*.f64 #s(literal 2 binary64) x)
x

localize17.0ms (0.4%)

Memory
9.4MiB live, 48.6MiB allocated; 7ms collecting garbage
Localize:

Found 2 expressions of interest:

NewMetricScoreProgram
accuracy0.0
(+.f64 x x)
accuracy34.11495968707645
#s(approx (- (+ x x) 1) (+.f64 x x))
Samples
10.0ms256×0valid
Compiler

Compiled 11 to 6 computations (45.5% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (32.4% of total)
ival-add: 1.0ms (32.4% 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
3.2MiB live, 3.2MiB allocated; 0ms collecting garbage
Counts
2 → 5
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
Outputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Calls

3 calls:

TimeVariablePointExpression
0.0ms
x
@inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@-inf
((- (+ x x) 1) (+ x x))
0.0ms
x
@0
((- (+ x x) 1) (+ x x))

simplify4.0ms (0.1%)

Memory
11.9MiB live, 11.9MiB allocated; 0ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
Stop Event
1×iter limit
1×saturated
Counts
5 → 5
Calls
Call 1
Inputs
-1
(- (* 2 x) 1)
(* 2 x)
(* x (- 2 (/ 1 x)))
(* -1 (* x (- (/ 1 x) 2)))
Outputs
-1
#s(literal -1 binary64)
(- (* 2 x) 1)
(-.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(* 2 x)
(*.f64 #s(literal 2 binary64) x)
(* x (- 2 (/ 1 x)))
(*.f64 (-.f64 #s(literal 2 binary64) (/.f64 #s(literal 1 binary64) x)) x)
(* -1 (* x (- (/ 1 x) 2)))
(*.f64 (neg.f64 x) (-.f64 (/.f64 #s(literal 1 binary64) x) #s(literal 2 binary64)))

rewrite89.0ms (1.8%)

Memory
-9.0MiB live, 83.4MiB allocated; 44ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0612
0712
13512
029112
Stop Event
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
Counts
2 → 35
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) (+.f64 x x))
(+.f64 x x)
Outputs
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64)) x)
(*.f64 #s(literal 4 binary64) (*.f64 x x))
(*.f64 (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)) (pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3/2 binary64)))
(*.f64 (neg.f64 (*.f64 #s(literal 2 binary64) x)) (neg.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 (fabs.f64 (*.f64 #s(literal 2 binary64) x)) (fabs.f64 (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 8 binary64) (pow.f64 x #s(literal 3 binary64)))
(*.f64 #s(literal 2 binary64) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(*.f64 #s(literal 2 binary64) (*.f64 x #s(literal 1 binary64)))
(*.f64 #s(literal 2 binary64) x)
(*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) x))
(*.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 1 binary64))
(*.f64 #s(literal 1 binary64) (*.f64 #s(literal 2 binary64) x))
(*.f64 x #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 2 binary64))
(pow.f64 (*.f64 #s(literal 2 binary64) x) #s(literal 3 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 1 binary64)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) x)) #s(literal 0 binary64))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) x)) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (fma.f64 x x #s(literal 0 binary64)))
(/.f64 (neg.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (neg.f64 (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 #s(literal 0 binary64) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 #s(literal 0 binary64) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 0 binary64)) (*.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 0 binary64)))
(/.f64 (*.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64)))) (*.f64 (fma.f64 x x #s(literal 0 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(/.f64 (pow.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) #s(literal 3 binary64)) (pow.f64 (fma.f64 x x #s(literal 0 binary64)) #s(literal 3 binary64)))
(/.f64 #s(literal 0 binary64) #s(literal 0 binary64))
(/.f64 (*.f64 #s(literal 2 binary64) (pow.f64 x #s(literal 3 binary64))) (fma.f64 x x #s(literal 0 binary64)))
(fma.f64 (*.f64 #s(literal 2 binary64) x) x (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(fma.f64 x (*.f64 #s(literal 2 binary64) x) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(-.f64 (/.f64 (*.f64 x x) #s(literal 0 binary64)) (/.f64 (*.f64 x x) #s(literal 0 binary64)))
(exp.f64 (*.f64 (log.f64 (*.f64 #s(literal 2 binary64) x)) #s(literal 3 binary64)))
(+.f64 (*.f64 x (*.f64 #s(literal 2 binary64) x)) (*.f64 x (*.f64 #s(literal 2 binary64) x)))
(+.f64 (*.f64 (*.f64 #s(literal 2 binary64) x) x) (*.f64 (*.f64 #s(literal 2 binary64) x) x))
(+.f64 (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))) (/.f64 (pow.f64 x #s(literal 3 binary64)) (fma.f64 x x #s(literal 0 binary64))))
(+.f64 x x)

eval4.0ms (0.1%)

Memory
9.0MiB live, 9.0MiB allocated; 0ms collecting garbage
Compiler

Compiled 577 to 122 computations (78.9% saved)

prune3.0ms (0.1%)

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

3 alts after pruning (0 fresh and 3 done)

PrunedKeptTotal
New40040
Fresh000
Picked011
Done022
Total40343
Accuracy
100.0%
Counts
43 → 3
Alt Table
Click to see full alt table
StatusAccuracyProgram
✓100.0%
(-.f64 (+.f64 x x) #s(literal 1 binary64))
✓46.7%
#s(approx (- (+ x x) 1) (+.f64 x x))
✓55.3%
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Compiler

Compiled 51 to 29 computations (43.1% saved)

regimes5.0ms (0.1%)

Memory
14.2MiB live, 14.2MiB allocated; 0ms collecting garbage
Counts
4 → 1
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Calls

3 calls:

2.0ms
x
2.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
100.0%1(+.f64 x x)
100.0%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
100.0%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes29.0ms (0.6%)

Memory
-25.8MiB live, 13.7MiB allocated; 20ms collecting garbage
Counts
3 → 3
Calls
Call 1
Inputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) (*.f64 #s(literal 2 binary64) x))
Outputs
#s(approx (- (+ x x) 1) (+.f64 x x))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
#s(approx (- (+ x x) 1) (+.f64 x x))
Calls

3 calls:

26.0ms
(+.f64 x x)
1.0ms
x
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
98.3%3(+.f64 x x)
98.3%3(-.f64 (+.f64 x x) #s(literal 1 binary64))
98.3%3x
Compiler

Compiled 9 to 7 computations (22.2% saved)

regimes3.0ms (0.1%)

Memory
9.7MiB live, 9.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) #s(literal -1 binary64))
Outputs
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Calls

3 calls:

1.0ms
x
1.0ms
(+.f64 x x)
1.0ms
(-.f64 (+.f64 x x) #s(literal 1 binary64))
Results
AccuracySegmentsBranch
55.3%1(+.f64 x x)
55.3%1(-.f64 (+.f64 x x) #s(literal 1 binary64))
55.3%1x
Compiler

Compiled 9 to 7 computations (22.2% saved)

bsearch30.0ms (0.6%)

Memory
-1.8MiB live, 41.0MiB allocated; 13ms collecting garbage
Algorithm
2×binary-search
Stop Event
1×narrow-enough
1×narrow-enough
Steps
TimeLeftRight
9.0ms
0.0014964165190136693
100.5020989000224
7.0ms
-5.223891374158668
-0.17723766856903214
Samples
7.0ms256×0valid
Compiler

Compiled 264 to 232 computations (12.1% saved)

Precisions
Click to see histograms. Total time spent on operations: 3.0ms
ival-sub: 1.0ms (34.4% of total)
ival-add: 1.0ms (34.4% 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)

simplify3.6s (74.1%)

Memory
-3.6MiB live, 50.0MiB allocated; 4.6s collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01537
12637
23237
34237
45637
58237
613037
724837
848637
955037
1058937
1160537
1261737
1367737
1468637
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))
Outputs
(-.f64 (+.f64 x x) #s(literal 1 binary64))
(if (<=.f64 x #s(literal -1/2 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x)) (if (<=.f64 x #s(literal 1/2 binary64)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)) #s(approx (- (+ x x) 1) (+.f64 x x))))
(if (or (<=.f64 x #s(literal -1/2 binary64)) (not (<=.f64 x #s(literal 1/2 binary64)))) #s(approx (- (+ x x) 1) (+.f64 x x)) #s(approx (- (+ x x) 1) #s(literal -1 binary64)))
#s(approx (- (+ x x) 1) #s(literal -1 binary64))

derivations97.0ms (2%)

Memory
-369.4MiB live, 74.4MiB allocated; 61ms collecting garbage
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
01224
12324
23724
33924
44124
04124
0712
0812
13712
029712
01224
12324
23724
33924
44124
04124
Stop Event
1×done
1×iter limit
1×saturated
1×iter limit
1×iter limit
1×iter limit
1×unsound
1×iter limit
1×iter limit
1×saturated
Compiler

Compiled 37 to 17 computations (54.1% saved)

preprocess28.0ms (0.6%)

Memory
7.9MiB live, 50.9MiB allocated; 12ms collecting garbage
Compiler

Compiled 84 to 42 computations (50% saved)

end0.0ms (0%)

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

Profiling

Loading profile data...