Extending by one comparator Keeping only admissible networks N = 21 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 1 Extending by one comparator Keeping only admissible networks N = 20 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 3 Extending by one comparator Keeping only admissible networks N = 57 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 7 Extending by one comparator Keeping only admissible networks N = 126 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 19 Extending by one comparator Keeping only admissible networks N = 322 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 51 Extending by one comparator Keeping only admissible networks N = 811 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 141 Extending by one comparator Keeping only admissible networks N = 2090 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 325 Extending by one comparator Keeping only admissible networks N = 4442 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 564 Extending by one comparator Keeping only admissible networks N = 6969 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 678 Extending by one comparator Keeping only admissible networks N = 7438 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 510 Extending by one comparator Keeping only admissible networks N = 4790 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 280 Extending by one comparator Keeping only admissible networks N = 2155 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 106 Extending by one comparator Keeping only admissible networks N = 625 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 33 Extending by one comparator Keeping only admissible networks N = 134 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 11 Extending by one comparator Keeping only admissible networks N = 22 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 6 Extending by one comparator Keeping only admissible networks N = 6 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 1 Extending by one comparator Keeping only admissible networks N = 0 Marking subsumed networks Checking for cyclic reasoning Pruning marked networks R = 0 SUCCESS real 0m3.097s user 0m4.160s sys 0m0.336s