1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_zenotravel-strips-automatic_14.out

135 lines
7.1 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-14.pddl']
INFO translator arguments: []
INFO translator time limit: None
INFO translator memory limit: None
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-14.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.007s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.022s wall-clock]
Preparing model... [0.010s CPU, 0.015s wall-clock]
Generated 40 rules.
Computing model... [0.730s CPU, 0.728s wall-clock]
7138 relevant atoms
1890 auxiliary atoms
9028 final queue length
21113 total queue pushes
Completing instantiation... [2.020s CPU, 2.010s wall-clock]
Instantiating: [2.790s CPU, 2.792s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.060s CPU, 0.059s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.020s CPU, 0.015s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.002s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.010s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.090s CPU, 0.091s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.090s CPU, 0.090s wall-clock]
Translating task: [1.680s CPU, 1.678s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
20 propositions removed
Detecting unreachable propositions: [0.950s CPU, 0.951s wall-clock]
Reordering and filtering variables...
19 of 20 variables necessary.
0 of 20 mutex groups necessary.
6700 of 6800 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.250s CPU, 0.249s wall-clock]
Translator variables: 19
Translator derived variables: 0
Translator facts: 220
Translator goal facts: 12
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 6700
Translator axioms: 0
Translator task size: 32001
Translator peak memory: 58828 KB
Writing output... [0.590s CPU, 0.639s wall-clock]
Done! [6.460s CPU, 6.507s wall-clock]
planner.py version 0.0.1
Time: 1.33s
Memory: 140MB
Iteration 1
Queue: [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Solving...
Solving Time: 0.00s
Memory: 141MB (+1MB)
UNSAT
Iteration Time: 0.01s
Iteration 2
Queue: [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 0
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.42s
Memory: 141MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.04s
Memory: 147MB (+6MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 1.05s
Memory: 147MB (+0MB)
Answer: 1
occurs(action(("fly","plane1","city5","city9","fl2","fl1")),1) occurs(action(("fly","plane3","city4","city7","fl6","fl5")),1) occurs(action(("board","person9","plane3","city4")),1) occurs(action(("fly","plane2","city2","city6","fl6","fl5")),1) occurs(action(("fly","plane4","city8","city0","fl3","fl2")),1) occurs(action(("zoom","plane5","city9","city0","fl4","fl3","fl2")),1) occurs(action(("board","person10","plane3","city7")),2) occurs(action(("board","person3","plane5","city0")),2) occurs(action(("board","person4","plane1","city9")),2) occurs(action(("fly","plane1","city9","city7","fl1","fl0")),2) occurs(action(("board","person5","plane2","city6")),2) occurs(action(("board","person6","plane4","city0")),2) occurs(action(("board","person7","plane3","city7")),2) occurs(action(("board","person8","plane2","city6")),2) occurs(action(("zoom","plane3","city7","city5","fl5","fl4","fl3")),2) occurs(action(("zoom","plane2","city6","city1","fl5","fl4","fl3")),2) occurs(action(("fly","plane4","city0","city6","fl2","fl1")),2) occurs(action(("fly","plane5","city0","city2","fl2","fl1")),2) occurs(action(("debark","person9","plane3","city7")),2) occurs(action(("debark","person3","plane5","city2")),3) occurs(action(("debark","person4","plane1","city7")),3) occurs(action(("debark","person5","plane2","city1")),3) occurs(action(("debark","person6","plane4","city6")),3) occurs(action(("debark","person7","plane3","city5")),3) occurs(action(("debark","person8","plane2","city1")),3) occurs(action(("fly","plane4","city6","city5","fl1","fl0")),3) occurs(action(("fly","plane5","city2","city8","fl1","fl0")),3) occurs(action(("zoom","plane3","city5","city9","fl3","fl2","fl1")),3) occurs(action(("board","person2","plane2","city1")),3) occurs(action(("board","person9","plane1","city7")),3) occurs(action(("zoom","plane2","city1","city8","fl3","fl2","fl1")),3) occurs(action(("refuel","plane1","city7","fl0","fl1")),3) occurs(action(("debark","person10","plane3","city9")),4) occurs(action(("debark","person2","plane2","city8")),4) occurs(action(("fly","plane2","city8","city3","fl1","fl0")),4) occurs(action(("fly","plane3","city9","city3","fl1","fl0")),4) occurs(action(("fly","plane1","city7","city5","fl1","fl0")),4) occurs(action(("debark","person9","plane1","city5")),5)
SATISFIABLE
Models : 1+
Calls : 2
Time : 2.075s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
CPU Time : 2.028s
Choices : 347 (Domain: 325)
Conflicts : 77 (Analyzed: 77)
Restarts : 1 (Average: 77.00 Last: 5)
Model-Level : 118.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 77 (Deleted: 0)
Binary : 3 (Ratio: 3.90%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 77 (Average Length: 107.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 77 (Average: 2.61 Max: 46 Sum: 201)
Executed : 77 (Average: 2.61 Max: 46 Sum: 201 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 102938
Atoms : 102938
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 29039 (Eliminated: 0 Frozen: 948)
Constraints : 169097 (Binary: 99.1% Ternary: 0.4% Other: 0.5%)
Memory Peak : 198MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 1