tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_driverlog-strips-automatic_1.out

158 lines
6.1 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-1.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/driverlog-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/driverlog-strips-automatic/instances/instance-1.pddl
Parsing...
Parsing: [0.020s CPU, 0.020s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.024s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 35 rules.
Computing model... [0.040s CPU, 0.035s wall-clock]
174 relevant atoms
150 auxiliary atoms
324 final queue length
400 total queue pushes
Completing instantiation... [0.020s CPU, 0.025s wall-clock]
Instantiating: [0.100s CPU, 0.100s wall-clock]
Computing fact groups...
Finding invariants...
11 initial candidates
Finding invariants: [0.020s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
Instantiating groups... [0.010s CPU, 0.004s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.030s CPU, 0.030s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.000s CPU, 0.001s wall-clock]
Translating task: [0.030s CPU, 0.023s wall-clock]
12 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
6 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.013s wall-clock]
Reordering and filtering variables...
8 of 8 variables necessary.
2 of 8 mutex groups necessary.
88 of 88 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.004s wall-clock]
Translator variables: 8
Translator derived variables: 0
Translator facts: 34
Translator goal facts: 4
Translator mutex groups: 2
Translator total mutex groups size: 6
Translator operators: 88
Translator axioms: 0
Translator task size: 424
Translator peak memory: 36300 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.200s CPU, 0.206s wall-clock]
planner.py version 0.0.1
Time: 0.03s
Memory: 50MB
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: 50MB (+0MB)
UNSAT
Iteration Time: 0.00s
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.01s
Memory: 50MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+1MB)
UNSAT
Iteration Time: 0.01s
Iteration 3
Queue: [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 5
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.01s
Memory: 51MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.02s
Memory: 51MB (+0MB)
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 51MB (+0MB)
Answer: 2
occurs(action(("walk","driver1","s2","p1-2")),1) occurs(action(("walk","driver2","s2","p1-2")),1) occurs(action(("walk","driver1","p1-2","s1")),2) occurs(action(("walk","driver2","p1-2","s1")),2) occurs(action(("walk","driver2","s1","p1-0")),3) occurs(action(("walk","driver2","p1-0","s0")),4) occurs(action(("board-truck","driver2","truck1","s0")),5) occurs(action(("drive-truck","truck1","s0","s1","driver2")),6) occurs(action(("disembark-truck","driver2","truck1","s1")),7) occurs(action(("walk","driver2","s1","p1-2")),8) occurs(action(("walk","driver2","p1-2","s2")),9) occurs(action(("walk","driver2","s2","p1-2")),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.063s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.056s
Choices : 61 (Domain: 55)
Conflicts : 3 (Analyzed: 3)
Restarts : 0
Model-Level : 36.5
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 3 (Deleted: 0)
Binary : 0 (Ratio: 0.00%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 3 (Average Length: 64.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 3 (Average: 4.00 Max: 6 Sum: 12)
Executed : 3 (Average: 4.00 Max: 6 Sum: 12 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 2195 (Original: 2153)
Atoms : 1569
Bodies : 701 (Original: 658)
Count : 30 (Original: 38)
Equivalences : 406 (Atom=Atom: 12 Body=Body: 0 Other: 394)
Tight : Yes
Variables : 1222 (Eliminated: 0 Frozen: 470)
Constraints : 3550 (Binary: 87.2% Ternary: 7.2% Other: 5.6%)
Memory Peak : 51MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2