tplp-planning-benchmark/gc-ta1-tt1/ipc-2006_pathways-propositional-strips_5.out

161 lines
7.1 KiB
Plaintext
Raw Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-5.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-5.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-5.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-5.pddl
Parsing...
Parsing: [0.240s CPU, 0.243s wall-clock]
Normalizing task... [0.040s CPU, 0.040s wall-clock]
Instantiating...
Generating Datalog program... [0.030s CPU, 0.025s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.060s CPU, 0.066s wall-clock]
Preparing model... [0.040s CPU, 0.045s wall-clock]
Generated 687 rules.
Computing model... [0.030s CPU, 0.027s wall-clock]
416 relevant atoms
0 auxiliary atoms
416 final queue length
711 total queue pushes
Completing instantiation... [0.050s CPU, 0.053s wall-clock]
Instantiating: [0.220s CPU, 0.220s wall-clock]
Computing fact groups...
Finding invariants...
148 initial candidates
Time limit reached, aborting invariant generation
Finding invariants: [300.220s CPU, 300.087s wall-clock]
Checking invariant weight... [0.350s CPU, 0.356s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
Choosing groups...
96 uncovered facts
Choosing groups: [0.000s CPU, 0.003s wall-clock]
Building translation key... [0.000s CPU, 0.004s wall-clock]
Computing fact groups: [300.610s CPU, 300.478s 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.002s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.004s wall-clock]
Translating task: [0.080s CPU, 0.073s wall-clock]
106 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
23 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.043s wall-clock]
Reordering and filtering variables...
83 of 119 variables necessary.
0 of 29 mutex groups necessary.
256 of 266 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.020s CPU, 0.022s wall-clock]
Translator variables: 83
Translator derived variables: 0
Translator facts: 172
Translator goal facts: 6
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 256
Translator axioms: 0
Translator task size: 1462
Translator peak memory: 156052 KB
Writing output... [0.030s CPU, 0.033s wall-clock]
Done! [301.290s CPU, 301.162s wall-clock]
planner.py version 0.0.1
Time: 0.06s
Memory: 51MB
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: 51MB (+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: 51MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.03s
Memory: 53MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 53MB (+0MB)
UNSAT
Iteration Time: 0.04s
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: 55.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 0.02s
Memory: 55MB (+2MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 55MB (+0MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 0.04s
Memory: 56MB (+1MB)
Solving...
Solving Time: 0.01s
Memory: 56MB (+0MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 56MB (+0MB)
Answer: 2
occurs(action("choose_ge2_l1_l0"),1) occurs(action("initialize_ge2"),2) occurs(action("choose_e2f13-dp12_l2_l1"),2) occurs(action("choose_sp1_l3_l2"),3) occurs(action("initialize_e2f13-dp12"),3) occurs(action("initialize_sp1"),4) occurs(action("associate_e2f13-dp12_ge2_e2f13-dp12-ge2"),4) occurs(action("choose_p53_l4_l3"),4) occurs(action("synthesize_e2f13-dp12-ge2_c-myc"),5) occurs(action("synthesize_e2f13-dp12-ge2_cyce"),5) occurs(action("synthesize_e2f13-dp12-ge2_p107p1"),5) occurs(action("synthesize_e2f13-dp12-ge2_p107"),5) occurs(action("choose_pcna_l5_l4"),5) occurs(action("initialize_p53"),5) occurs(action("dummy-action-6-2"),6) occurs(action("dummy-action-1-2"),6) occurs(action("associate_sp1_p107_sp1-p107"),6) occurs(action("synthesize_p53_gadd45"),6) occurs(action("initialize_pcna"),6) occurs(action("synthesize_p53_p21"),6) occurs(action("choose_cdk1p1p2_l6_l5"),6) occurs(action("dummy-action-2-2"),7) occurs(action("associate_pcna_p21_pcna-p21"),7) occurs(action("initialize_cdk1p1p2"),7) occurs(action("initialize_sp1"),7) occurs(action("dummy-action-4-1"),8) occurs(action("associate_cdk1p1p2_gadd45_cdk1p1p2-gadd45"),8) occurs(action("associate_sp1_p107p1_sp1-p107p1"),8) occurs(action("initialize_p53"),8) occurs(action("dummy-action-3-2"),9) occurs(action("dummy-action-5-2"),9) occurs(action("initialize_p53"),9) occurs(action("synthesize_p53_gadd45"),10) occurs(action("initialize_sp1"),10) occurs(action("synthesize_p53_p21"),10) occurs(action("initialize_ge2"),10) occurs(action("initialize_e2f13-dp12"),10)
SATISFIABLE
Models : 1+
Calls : 4
Time : 0.160s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.156s
Choices : 426 (Domain: 303)
Conflicts : 9 (Analyzed: 9)
Restarts : 0
Model-Level : 195.5
Problems : 4 (Average Length: 8.25 Splits: 0)
Lemmas : 9 (Deleted: 0)
Binary : 2 (Ratio: 22.22%)
Ternary : 0 (Ratio: 0.00%)
Conflict : 9 (Average Length: 12.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 9 (Average: 9.22 Max: 27 Sum: 83)
Executed : 7 (Average: 6.56 Max: 27 Sum: 59 Ratio: 71.08%)
Bounded : 2 (Average: 12.00 Max: 12 Sum: 24 Ratio: 28.92%)
Rules : 9829 (Original: 8439)
Atoms : 6008
Bodies : 3612 (Original: 2221)
Count : 58 (Original: 244)
Equivalences : 1612 (Atom=Atom: 144 Body=Body: 0 Other: 1468)
Tight : Yes
Variables : 6334 (Eliminated: 0 Frozen: 1167)
Constraints : 22531 (Binary: 85.8% Ternary: 11.1% Other: 3.1%)
Memory Peak : 56MB
Max. Length : 10 steps
Sol. Length : 10 steps
Models : 2