1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_pathways-propositional-strips_7.out

175 lines
9.2 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-7.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-7.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-7.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-7.pddl
Parsing...
Parsing: [0.610s CPU, 0.612s wall-clock]
Normalizing task... [0.090s CPU, 0.092s wall-clock]
Instantiating...
Generating Datalog program... [0.060s CPU, 0.059s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.150s CPU, 0.150s wall-clock]
Preparing model... [0.130s CPU, 0.128s wall-clock]
Generated 1595 rules.
Computing model... [0.050s CPU, 0.056s wall-clock]
861 relevant atoms
0 auxiliary atoms
861 final queue length
1637 total queue pushes
Completing instantiation... [0.130s CPU, 0.132s wall-clock]
Instantiating: [0.530s CPU, 0.534s wall-clock]
Computing fact groups...
Finding invariants...
262 initial candidates
Time limit reached, aborting invariant generation
Finding invariants: [300.460s CPU, 300.328s wall-clock]
Checking invariant weight... [0.140s CPU, 0.138s wall-clock]
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
171 uncovered facts
Choosing groups: [0.000s CPU, 0.004s wall-clock]
Building translation key... [0.000s CPU, 0.006s wall-clock]
Computing fact groups: [300.650s CPU, 300.508s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.003s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.008s wall-clock]
Translating task: [0.170s CPU, 0.172s wall-clock]
208 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
41 propositions removed
Detecting unreachable propositions: [0.100s CPU, 0.094s wall-clock]
Reordering and filtering variables...
143 of 212 variables necessary.
0 of 50 mutex groups necessary.
581 of 597 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.040s CPU, 0.043s wall-clock]
Translator variables: 143
Translator derived variables: 0
Translator facts: 295
Translator goal facts: 11
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 581
Translator axioms: 0
Translator task size: 3237
Translator peak memory: 268084 KB
Writing output... [0.060s CPU, 0.069s wall-clock]
Done! [302.270s CPU, 302.140s wall-clock]
planner.py version 0.0.1
Time: 0.11s
Memory: 53MB
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: 53MB (+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: 53MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.04s
Memory: 57MB (+4MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 58MB (+1MB)
UNSAT
Iteration Time: 0.06s
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: 63.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.04s
Memory: 61MB (+3MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 62MB (+1MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.09s
Memory: 63MB (+1MB)
Solving...
Solving Time: 0.03s
Memory: 63MB (+0MB)
UNSAT
Iteration Time: 0.17s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 68.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 0.07s
Memory: 68MB (+5MB)
Unblocking actions...
Solving...
Solving Time: 0.02s
Memory: 70MB (+2MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 70MB (+0MB)
Answer: 2
occurs(action("choose_e2f13-dp12_l1_l0"),1) occurs(action("initialize_e2f13-dp12"),2) occurs(action("choose_ge2_l2_l1"),2) occurs(action("choose_cdk2_l3_l2"),3) occurs(action("initialize_ge2"),3) occurs(action("initialize_cdk2"),4) occurs(action("associate_e2f13-dp12_ge2_e2f13-dp12-ge2"),4) occurs(action("choose_p53_l4_l3"),4) occurs(action("synthesize_e2f13-dp12-ge2_cyca"),5) occurs(action("synthesize_e2f13-dp12-ge2_c-myc"),5) occurs(action("synthesize_e2f13-dp12-ge2_cyce"),5) occurs(action("initialize_e2f13-dp12"),5) occurs(action("synthesize_e2f13-dp12-ge2_cycdp1"),5) occurs(action("synthesize_e2f13-dp12-ge2_cycep1"),5) occurs(action("initialize_p53"),5) occurs(action("choose_cdk2p1_l5_l4"),5) occurs(action("dummy-action-1-2"),6) occurs(action("associate_cdk2_cyce_cdk2-cyce"),6) occurs(action("synthesize_p53_p21"),6) occurs(action("synthesize_p53_mdm2"),6) occurs(action("choose_p27_l6_l5"),6) occurs(action("initialize_cdk2p1"),6) occurs(action("associate_p21_cdk2-cyce_p21-cdk2-cyce"),7) occurs(action("associate_mdm2_e2f13-dp12_mdm2-e2f13-dp12"),7) occurs(action("associate_cdk2p1_cyca_cdk2p1-cyca"),7) occurs(action("initialize_p27"),7) occurs(action("synthesize_e2f13-dp12-ge2_cyce"),7) occurs(action("initialize_cdk2"),7) occurs(action("choose_max_l7_l6"),7) occurs(action("dummy-action-11-1"),8) occurs(action("dummy-action-9-2"),8) occurs(action("associate_p27_cdk2p1-cyca_p27-cdk2p1-cyca"),8) occurs(action("synthesize_e2f13-dp12-ge2_cyca"),8) occurs(action("initialize_max"),8) occurs(action("synthesize_p53_p21"),8) occurs(action("initialize_cdk2p1"),8) occurs(action("choose_gcdc25a_l8_l7"),8) occurs(action("dummy-action-5-2"),9) occurs(action("associate_c-myc_max_c-myc-max"),9) occurs(action("associate_cdk2p1_cyca_cdk2p1-cyca"),9) occurs(action("initialize_p27"),9) occurs(action("initialize_gcdc25a"),9) occurs(action("choose_cdk46p1_l9_l8"),9) occurs(action("associate_p21_cdk2p1-cyca_p21-cdk2p1-cyca"),10) occurs(action("associate_c-myc-max_gcdc25a_c-myc-max-gcdc25a"),10) occurs(action("initialize_max"),10) occurs(action("synthesize_e2f13-dp12-ge2_c-myc"),10) occurs(action("initialize_p27"),10) occurs(action("initialize_cdk2"),10) occurs(action("initialize_cdk2p1"),10) occurs(action("initialize_cdk46p1"),10) occurs(action("choose_p57_l10_l9"),10) occurs(action("dummy-action-10-2"),11) occurs(action("synthesize_c-myc-max-gcdc25a_cdc25a"),11) occurs(action("associate_c-myc_max_c-myc-max"),11) occurs(action("associate_cdk46p1_cycdp1_cdk46p1-cycdp1"),11) occurs(action("associate_cdk2p1_cyce_cdk2p1-cyce"),11) occurs(action("initialize_p57"),11) occurs(action("dummy-action-2-2"),12) occurs(action("dummy-action-7-2"),12) occurs(action("associate_p27_cdk46p1-cycdp1_p27-cdk46p1-cycdp1"),12) occurs(action("associate_p57_cdk2p1-cyce_p57-cdk2p1-cyce"),12) occurs(action("synthesize_e2f13-dp12-ge2_cyce"),12) occurs(action("initialize_cdk2p1"),12) occurs(action("dummy-action-3-1"),13) occurs(action("dummy-action-4-1"),13) occurs(action("associate_cdk2_cyce_cdk2-cyce"),13) occurs(action("initialize_p27"),13) occurs(action("associate_cdk2p1_cycep1_cdk2p1-cycep1"),13) occurs(action("dummy-action-6-2"),14) occurs(action("associate_p27_cdk2p1-cycep1_p27-cdk2p1-cycep1"),14) occurs(action("dummy-action-8-1"),15) occurs(action("synthesize_p53_p21"),15)
SATISFIABLE
Models : 1+
Calls : 5
Time : 0.405s (Solving: 0.04s 1st Model: 0.02s Unsat: 0.02s)
CPU Time : 0.400s
Choices : 3171 (Domain: 2876)
Conflicts : 454 (Analyzed: 453)
Restarts : 4 (Average: 113.25 Last: 46)
Model-Level : 373.5
Problems : 5 (Average Length: 10.00 Splits: 0)
Lemmas : 453 (Deleted: 0)
Binary : 60 (Ratio: 13.25%)
Ternary : 39 (Ratio: 8.61%)
Conflict : 453 (Average Length: 18.5 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 453 (Average: 5.47 Max: 38 Sum: 2478)
Executed : 448 (Average: 5.36 Max: 38 Sum: 2430 Ratio: 98.06%)
Bounded : 5 (Average: 9.60 Max: 12 Sum: 48 Ratio: 1.94%)
Rules : 19516 (Original: 17857)
Atoms : 12889
Bodies : 5830 (Original: 4170)
Count : 175 (Original: 472)
Equivalences : 3038 (Atom=Atom: 174 Body=Body: 0 Other: 2864)
Tight : Yes
Variables : 17275 (Eliminated: 0 Frozen: 4677)
Constraints : 67509 (Binary: 89.6% Ternary: 7.1% Other: 3.3%)
Memory Peak : 71MB
Max. Length : 15 steps
Sol. Length : 15 steps
Models : 2