This planner cannot solve any domain with instance

[alachun]

After install this planner, we found that it cannot solve any instance. "Search stopped without finding a solution"

[jendrikseipp]

Thanks for the report! Can you please upload an example benchmark here and paste the command line call and the planner output?

[alachun]

Thanks for the report! Can you please upload an example benchmark here and paste the command line call and the planner output?

Thank you for the reply.

The command line is as follows:
./fast-downward.py
--transform-task preprocess-h2
p1-11-4-15.pddl
--search "astar(scp_online([
projections(sys_scp(max_time=100, max_time_per_restart=10)),
cartesian()],
saturator=perimstar, max_time=1000, interval=10K, orders=greedy_orders()),
pruning=limited_pruning(pruning=atom_centric_stubborn_sets(), min_required_pruning_ratio=0.2))"

The resulting report is as follows:
INFO planner time limit: None
INFO planner memory limit: None

INFO Running translator.
INFO translator stdin: None
INFO translator time limit: None
INFO translator memory limit: None
INFO translator command line string: /usr/bin/python3 '/home/luxury/妗岄潰/planner8-latest/builds/release/bin/translate/translate.py' domain.pddl p1-11-4-15.pddl --sas-file output.sas
Parsing...
Parsing: [0.010s CPU, 0.003s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Creating program......
Creating program...: [0.000s CPU, 0.002s wall-clock]
Computing model...... Saving Datalog program to output.theory
[0.000s CPU, 0.002s wall-clock]
Parsing Clingo model into our model...... [0.000s CPU, 0.000s wall-clock]
Completing instantiation... Model size: 0
Main loop......
iterations: 0
Main loop...: [0.000s CPU, 0.000s wall-clock]
[0.000s CPU, 0.000s wall-clock]
Instantiating: [0.000s CPU, 0.004s wall-clock]
No relaxed solution! Generating unsolvable task...
Translator variables: 1
Translator derived variables: 0
Translator facts: 2
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 0
Translator axioms: 0
Translator task size: 4
Translator peak memory: 34660 KB
Writing output... [0.000s CPU, 0.000s wall-clock]
Done! [0.010s CPU, 0.008s wall-clock]
0

INFO Run task transformation (preprocess-h2).
INFO transform-task stdin: output.sas
INFO transform-task time limit: None
INFO transform-task memory limit: None
INFO transform-task command line string: '/home/luxury/妗岄潰/planner8-latest/builds/release/bin/preprocess-h2' < output.sas
Building causal graph...
The causal graph is acyclic.
1 variables of 1 necessary
0 of 0 mutex groups necessary.
0 of 0 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 2 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1, notReached=1, spurious=2
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=1, notReached=1, spurious=2
0 operators are spurious because were not triggered
Unsolvable task in preprocessor
done
translate exit code: 0

INFO Running search (release).
INFO search stdin: output.sas
INFO search time limit: None
INFO search memory limit: None
INFO search command line string: '/home/luxury/妗岄潰/planner8-latest/builds/release/bin/downward' --search 'astar(scp_online([
projections(sys_scp(max_time=100, max_time_per_restart=10)),
cartesian()],
saturator=perimstar, max_time=1000, interval=10K, orders=greedy_orders()),
pruning=limited_pruning(pruning=atom_centric_stubborn_sets(), min_required_pruning_ratio=0.2))' --internal-plan-file sas_plan < output.sas
[t=6.4392e-05s, 10968 KB] reading input...
[t=0.00019428s, 10968 KB] done reading input!
[t=0.00231186s, 11356 KB] Compute patterns
[t=0.00236336s, 11356 KB] Generating patterns using: sys-SCP pattern collection generator
[t=0.00240354s, 11356 KB] Generate patterns for size 1
[t=0.00242951s, 11356 KB] building causal graph...done! [t=2.4865e-05s]
[t=0.00246233s, 11356 KB] Found 1 SGA patterns.
[t=0.00248748s, 11356 KB] Found 1 interesting patterns.
[t=0.00252786s, 11356 KB] Store 1 patterns of size 1
[t=0.00255335s, 11356 KB] Finished storing patterns of size 1
[t=0.00259051s, 11356 KB] Generated all patterns up to size 2147483647.
[t=0.00261463s, 11356 KB] Patterns: 0, collection size: 0
[t=0.0026363s, 11356 KB] Restart did not add any pattern.
[t=0.00265729s, 11356 KB] Time for computing ordered systematic patterns: 0.000175646s
[t=0.00267911s, 11356 KB] Time for computing ordered systematic projections: 3.642e-06s
[t=0.00270038s, 11356 KB] Time for evaluating ordered systematic projections: 5.359e-06s
[t=0.00272139s, 11356 KB] Ordered systematic pattern evaluations: 1
[t=0.00274152s, 11356 KB] Maximum generated ordered systematic pattern size: 1
[t=0.00276193s, 11356 KB] Selected ordered systematic patterns: 0/1 = 0
[t=0.00278345s, 11356 KB] Systematic dead ends: 1
[t=0.0028036s, 11356 KB] Systematic dead end tree nodes: 2
[t=0.00282698s, 11356 KB] sys-SCP pattern collection generator number of patterns: 0
[t=0.00284847s, 11356 KB] sys-SCP pattern collection generator total PDB size: 0
[t=0.00287855s, 11356 KB] sys-SCP pattern collection generator computation time: 0.000437194s
[t=0.00291559s, 11356 KB] Number of patterns: 0
[t=0.00294533s, 11356 KB] Maximum pattern size: 0
[t=0.00296785s, 11356 KB] Time for computing patterns: 0.000677741s
[t=0.0029906s, 11356 KB] Build projections
[t=0.00301318s, 11356 KB] Time for building projections: 2.0899e-05s
[t=0.00303581s, 11356 KB] Number of projections: 0
[t=0.0030561s, 11356 KB] Number of states in projections: 0
[t=0.00307937s, 11356 KB] Build Cartesian abstractions
[t=0.00314718s, 523360 KB] Start building abstraction.
[t=0.00318308s, 523360 KB] Maximum number of states: 2147483647
[t=0.00322105s, 523360 KB] Maximum number of transitions: 1000000
[t=0.00326702s, 523360 KB] Abstract task is unsolvable.
[t=0.00330487s, 523360 KB] Time for finding abstract traces: 1.435e-06s
[t=0.00334305s, 523360 KB] Time for finding flaws: 0s
[t=0.0033749s, 523360 KB] Time for splitting states: 0s
[t=0.00339769s, 523360 KB] Time for updating goal distances: 0s
[t=0.00341989s, 523360 KB] Done building abstraction.
[t=0.00344095s, 523360 KB] Time for building abstraction: 0.000314692s
[t=0.00346413s, 523360 KB] States: 2
[t=0.00348499s, 523360 KB] Goal states: 1
[t=0.00350602s, 523360 KB] Looping transitions: 0
[t=0.00352679s, 523360 KB] Non-looping transitions: 0
[t=0.00354742s, 523360 KB] Nodes in refinement hierarchy: 3

[t=0.00357913s, 523360 KB] Start building abstraction.
[t=0.00360133s, 523360 KB] Maximum number of states: 2147483645
[t=0.00362222s, 523360 KB] Maximum number of transitions: 1000000
[t=0.00364912s, 523360 KB] Abstract task is unsolvable.
[t=0.00367066s, 523360 KB] Time for finding abstract traces: 1.113e-06s
[t=0.00369317s, 523360 KB] Time for finding flaws: 0s
[t=0.00371427s, 523360 KB] Time for splitting states: 0s
[t=0.00373578s, 523360 KB] Time for updating goal distances: 0s
[t=0.00375677s, 523360 KB] Done building abstraction.
[t=0.00377696s, 523360 KB] Time for building abstraction: 0.000217912s
[t=0.00379952s, 523360 KB] States: 2
[t=0.00381984s, 523360 KB] Goal states: 1
[t=0.00384036s, 523360 KB] Looping transitions: 0
[t=0.00386182s, 523360 KB] Non-looping transitions: 0
[t=0.00388246s, 523360 KB] Nodes in refinement hierarchy: 3

[t=0.0039229s, 523360 KB] Cartesian abstractions: 2
[t=0.00394933s, 523360 KB] Time for building Cartesian abstractions: 0.000890727s
[t=0.00397273s, 523360 KB] Total number of Cartesian states: 4
[t=0.00399308s, 523360 KB] Total number of transitions in Cartesian abstractions: 0
[t=0.00401412s, 523360 KB] Abstractions: 2
[t=0.00403513s, 523360 KB] Abstractions per generator: [0, 2]
[t=0.00406117s, 523360 KB] Initialize greedy order generator
[t=0.00408518s, 523360 KB] Time for computing h values and saturated costs: 4.4388e-05s
[t=0.00410833s, 523360 KB] Done computing surplus costs
[t=0.00412846s, 523360 KB] Compute stolen costs
[t=0.00414968s, 523360 KB] Time for initializing greedy order generator: 0.00010892s
[t=0.00425819s, 523360 KB] Building successor generator...done!
[t=0.0043387s, 523360 KB] peak memory difference for successor generator creation: 0 KB
[t=0.00435998s, 523360 KB] time for successor generation creation: 1.0353e-05s
[t=0.00438353s, 523360 KB] Variables: 1
[t=0.00440477s, 523360 KB] FactPairs: 2
[t=0.00442562s, 523360 KB] Bytes per state: 4
[t=0.00454694s, 523360 KB] Conducting best first search with reopening closed nodes, (real) bound = 2147483647
[t=0.00462566s, 523360 KB] Initial state is a dead end.
[t=0.00465006s, 523360 KB] Initial heuristic value for scp_online(list(projections(sys_scp(max_time = 100, max_time_per_restart = 10)), cartesian), saturator = perimstar, max_time = 1000, interval = 10k, orders = greedy_orders): infinity
[t=0.00467392s, 523360 KB] pruning method: atom-centric stubborn sets
[t=0.0046971s, 523360 KB] pruning method: limited
[t=0.00472036s, 523360 KB] Completely explored state space -- no solution!
[t=0.00474166s, 523360 KB] Actual search time: 4.1981e-05s
[t=0.00476571s, 523360 KB] Expanded 0 state(s).
[t=0.00476571s, 523360 KB] Reopened 0 state(s).
[t=0.00476571s, 523360 KB] Evaluated 1 state(s).
[t=0.00476571s, 523360 KB] Evaluations: 1
[t=0.00476571s, 523360 KB] Generated 0 state(s).
[t=0.00476571s, 523360 KB] Dead ends: 0 state(s).
[t=0.00476571s, 523360 KB] Number of registered states: 1
[t=0.00476571s, 523360 KB] Closed list load factor: 1/1 = 1
[t=0.00476571s, 523360 KB] total successors before pruning: 0
[t=0.00476571s, 523360 KB] total successors after pruning: 0
[t=0.00476571s, 523360 KB] Pruning ratio: 1
[t=0.00476571s, 523360 KB] Search time: 0.000219443s
[t=0.00476571s, 523360 KB] Total time: 0.00476571s
Search stopped without finding a solution.
[t=0.00476571s, 523360 KB] Evaluated states: 0, selected states: 0, stored SCPs: 0, heuristic size: 0 KB, selection time: 0s, diversification time: 1.99e-06s
[t=0.00476571s, 523360 KB] Stored lookup tables: 0
[t=0.00476571s, 523360 KB] Stored values: 0
[t=0.00476571s, 523360 KB] Evaluated states: 0
[t=0.00476571s, 523360 KB] Time for improving heuristic: 1.99e-06s
[t=0.00476571s, 523360 KB] Estimated heuristic size: 0 KB
[t=0.00476571s, 523360 KB] Computed SCPs: 0
[t=0.00476571s, 523360 KB] Stored SCPs: 0
Peak memory: 523360 KB
Remove intermediate file output.sas
search exit code: 12

Driver aborting after search
INFO Planner time: 0.12s

Given any domain and problem files, the results are the same.

[jendrikseipp]

Thanks! According to the log the task is unsolvable.

[abcorrea]

Hi all,

I believe you're using a locally installed version of the planner instead of using the Apptainer image. If so, did you follow the same installation and running steps as the Apptainer image?

In particular, we need to add clingo to the path. It's already in the ext folder of the repo, so doing

export PATH=$PATH:/home/luxury/妗岄潰/planner8-latest/ext/clingo

should work.

Also note that the configuration you ran is from an old submission to the IPC 2018 optimal track (I think). You can see how to run the most recent version in the Apptainer recipe files.

[alachun]

Hi all,

I believe you're using a locally installed version of the planner instead of using the Apptainer image. If so, did you follow the same installation and running steps as the Apptainer image?

In particular, we need to add clingo to the path. It's already in the ext folder of the repo, so doing

export PATH=$PATH:/home/luxury/妗岄潰/planner8-latest/ext/clingo

should work.

Also note that the configuration you ran is from an old submission to the IPC 2018 optimal track (I think). You can see how to run the most recent version in the Apptainer recipe files.

Thanks. That works!!!!

[abcorrea]

Glad to hear! Just another small thing I noticed: you are currently using the "standard" Scorpion config from the README, but this is not the competition one. You can execute this to simulate the competition:

./fast-downward.py \
        --transform-task preprocess-h2 \
        --transform-task-options h2_time_limit,180 \
        --alias seq-sat-maidu \
        --plan-file "$PLANFILE" \
        "$DOMAINFILE" "$PROBLEMFILE"

This will probably solve more tasks, but this might also give you plans that are not optimal. If you do not care about optimality, it is a good tradeoff. If you are only interested in finding plans quickly, there are other parameters you can use to optimize the planner even further. But at this point, it would be perhaps better if we moved it to an email conversation. Just let us know if you need further help!

Apologies for all the confusion with the README. We are creating a pull request to update the instructions. Somehow, we completely forgot about it.