160 lines
6.4 KiB
Plaintext
160 lines
6.4 KiB
Plaintext
|
INFO Running translator.
|
||
|
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-2.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-2.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-2006/domains/pathways-propositional-strips/domains/domain-2.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-2.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.110s CPU, 0.105s wall-clock]
|
||
|
|
Normalizing task... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Generated 197 rules.
|
||
|
|
Computing model... [0.000s CPU, 0.008s wall-clock]
|
||
|
|
152 relevant atoms
|
||
|
|
0 auxiliary atoms
|
||
|
|
152 final queue length
|
||
|
|
211 total queue pushes
|
||
|
|
Completing instantiation... [0.020s CPU, 0.015s wall-clock]
|
||
|
|
Instantiating: [0.070s CPU, 0.074s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
70 initial candidates
|
||
|
|
Finding invariants: [3.970s CPU, 3.957s wall-clock]
|
||
|
|
Checking invariant weight... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
42 uncovered facts
|
||
|
|
Choosing groups: [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Computing fact groups: [3.990s CPU, 3.985s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||
|
|
Building dictionary for full mutex groups... [0.000s CPU, 0.001s 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.010s CPU, 0.001s wall-clock]
|
||
|
|
Translating task: [0.020s CPU, 0.019s wall-clock]
|
||
|
|
28 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
13 propositions removed
|
||
|
|
Detecting unreachable propositions: [0.020s CPU, 0.014s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
35 of 55 variables necessary.
|
||
|
|
0 of 15 mutex groups necessary.
|
||
|
|
67 of 80 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [0.010s CPU, 0.007s wall-clock]
|
||
|
|
Translator variables: 35
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 72
|
||
|
|
Translator goal facts: 2
|
||
|
|
Translator mutex groups: 0
|
||
|
|
Translator total mutex groups size: 0
|
||
|
|
Translator operators: 67
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 411
|
||
|
|
Translator peak memory: 38092 KB
|
||
|
|
Writing output... [0.010s CPU, 0.011s wall-clock]
|
||
|
|
Done! [4.240s CPU, 4.232s 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
|
||
|
|
Expected Memory: 50MB
|
||
|
|
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.02s
|
||
|
|
|
||
|
|
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
|
||
|
|
Expected Memory: 52.0MB
|
||
|
|
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: 52MB (+1MB)
|
||
|
|
SAT
|
||
|
|
Testing...
|
||
|
|
SERIALIZABLE?
|
||
|
|
Testing Time: 0.00s
|
||
|
|
Memory: 52MB (+0MB)
|
||
|
|
Answer: 2
|
||
|
|
occurs(action("choose_ge2_l1_l0"),1) occurs(action("initialize_ge2"),2) occurs(action("choose_e2f13p1-dp12_l2_l1"),2) occurs(action("initialize_e2f13p1-dp12"),3) occurs(action("choose_e2f4-dp12p1_l3_l2"),3) occurs(action("associate_e2f13p1-dp12_ge2_e2f13p1-dp12-ge2"),4) occurs(action("initialize_e2f4-dp12p1"),4) occurs(action("synthesize_e2f13p1-dp12-ge2_cycdp1"),5) occurs(action("synthesize_e2f13p1-dp12-ge2_p107"),5) occurs(action("dummy-action-2-2"),6) occurs(action("associate_p107_e2f4-dp12p1_p107-e2f4-dp12p1"),6) occurs(action("dummy-action-1-1"),7) occurs(action("synthesize_e2f13p1-dp12-ge2_cycdp1"),8) occurs(action("synthesize_e2f13p1-dp12-ge2_cycdp1"),9) occurs(action("synthesize_e2f13p1-dp12-ge2_c-myc"),10) occurs(action("synthesize_e2f13p1-dp12-ge2_p107"),10) occurs(action("initialize_e2f4-dp12p1"),10) occurs(action("initialize_ge2"),10) occurs(action("initialize_e2f13p1-dp12"),10)
|
||
|
|
SATISFIABLE
|
||
|
|
|
||
|
|
Models : 1+
|
||
|
|
Calls : 4
|
||
|
|
Time : 0.073s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
|
CPU Time : 0.064s
|
||
|
|
|
||
|
|
Choices : 140 (Domain: 87)
|
||
|
|
Conflicts : 1 (Analyzed: 1)
|
||
|
|
Restarts : 0
|
||
|
|
Model-Level : 80.0
|
||
|
|
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||
|
|
Lemmas : 1 (Deleted: 0)
|
||
|
|
Binary : 0 (Ratio: 0.00%)
|
||
|
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
|
Conflict : 1 (Average Length: 1.0 Ratio: 100.00%)
|
||
|
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
|
Backjumps : 1 (Average: 16.00 Max: 16 Sum: 16)
|
||
|
|
Executed : 0 (Average: 4.00 Max: 4 Sum: 4 Ratio: 25.00%)
|
||
|
|
Bounded : 1 (Average: 12.00 Max: 12 Sum: 12 Ratio: 75.00%)
|
||
|
|
|
||
|
|
Rules : 2504 (Original: 2430)
|
||
|
|
Atoms : 1820
|
||
|
|
Bodies : 810 (Original: 735)
|
||
|
|
Count : 10 (Original: 47)
|
||
|
|
Equivalences : 545 (Atom=Atom: 62 Body=Body: 0 Other: 483)
|
||
|
|
Tight : Yes
|
||
|
|
Variables : 1766 (Eliminated: 0 Frozen: 270)
|
||
|
|
Constraints : 5379 (Binary: 84.7% Ternary: 12.2% Other: 3.1%)
|
||
|
|
|
||
|
|
Memory Peak : 52MB
|
||
|
|
Max. Length : 10 steps
|
||
|
|
Sol. Length : 10 steps
|
||
|
|
Models : 2
|
||
|
|
|
||
|
|
|