Expanding a square

Time bar (total: 3.6s)

analyze0.0ms (0%)

Algorithm
1×search
Search
ProbabilityValidUnknownPreconditionInfiniteDomainCan'tIter
0%0%100%0%0%0%0%0
100%100%0%0%0%0%0%1
Compiler

Compiled 11 to 6 computations (45.5% saved)

sample3.3s (89.6%)

Results
243.0ms4294×0valid-sollya
334.0ms4294×0valid-rival
334.0ms3962×1valid-sollya
651.0ms3962×1valid-rival
Bogosity

preprocess351.0ms (9.6%)

Algorithm
1×egg-herbie
Rules
3207×fma-neg
1104×unsub-neg
506×distribute-neg-in
429×sub-neg
304×fma-define
Iterations

Useful iterations: 3 (0.0ms)

IterNodesCost
015128
151108
214688
348876
4217776
5379276
6493976
7578876
8621376
9645376
10645676
11645676
12657776
13666476
14683776
15683776
Stop Event
1×node limit
Calls
Call 1
Inputs
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64))
(neg.f64 (-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64)))
Outputs
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(*.f64 (+.f64 x #s(literal 2 binary64)) (+.f64 x #s(literal 0 binary64)))
(*.f64 x (+.f64 x #s(literal 2 binary64)))
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64)) #s(literal -1 binary64))
(*.f64 (+.f64 x #s(literal 2 binary64)) (+.f64 x #s(literal 0 binary64)))
(*.f64 x (+.f64 x #s(literal 2 binary64)))
(-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64))
(fma.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (+.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64))
(fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) x) #s(literal -1 binary64))
(*.f64 (neg.f64 x) (-.f64 #s(literal 2 binary64) x))
(*.f64 x (+.f64 x #s(literal -2 binary64)))
(neg.f64 (-.f64 (*.f64 (+.f64 (neg.f64 x) #s(literal 1 binary64)) (+.f64 (neg.f64 x) #s(literal 1 binary64))) #s(literal 1 binary64)))
(neg.f64 (fma.f64 (+.f64 #s(literal 1 binary64) (neg.f64 x)) (+.f64 #s(literal 1 binary64) (neg.f64 x)) #s(literal -1 binary64)))
(neg.f64 (fma.f64 (-.f64 #s(literal 1 binary64) x) (-.f64 #s(literal 1 binary64) x) #s(literal -1 binary64)))
(*.f64 (neg.f64 x) (neg.f64 (-.f64 #s(literal 2 binary64) x)))
(*.f64 x (-.f64 #s(literal 2 binary64) x))
Compiler

Compiled 10 to 5 computations (50% saved)

eval0.0ms (0%)

Compiler

Compiled 1 to 1 computations (0% saved)

prune1.0ms (0%)

Alt Table
Click to see full alt table
StatusAccuracyProgram
52.4%
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
Compiler

Compiled 20 to 10 computations (50% saved)

simplify3.0ms (0.1%)

Algorithm
1×egg-herbie
Rules
3×1-exp
3×+-commutative
2×unsub-neg
2×sub-neg
2×neg-mul-1
Iterations

Useful iterations: 0 (0.0ms)

IterNodesCost
0931
11831
22231
32531
42831
53131
Stop Event
1×saturated
Calls
Call 1
Inputs
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
Outputs
(-.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal 1 binary64))
(+.f64 (*.f64 (+.f64 x #s(literal 1 binary64)) (+.f64 x #s(literal 1 binary64))) #s(literal -1 binary64))

soundness0.0ms (0%)

Stop Event
1×fuel
Compiler

Compiled 10 to 6 computations (40% saved)

preprocess23.0ms (0.6%)

Compiler

Compiled 40 to 22 computations (45% saved)

end0.0ms (0%)

Profiling

Loading profile data...