tplp-planning-benchmark/fd-pb-e1-sh-h/ipc-1998_mystery-round-1-strips_6.out

143 lines
7.4 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-6.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-1998/domains/mystery-round-1-strips/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-1998/domains/mystery-round-1-strips/instances/instance-6.pddl
Parsing...
Parsing: [0.020s CPU, 0.022s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock]
Preparing model... [0.020s CPU, 0.020s wall-clock]
Generated 42 rules.
Computing model... [1.150s CPU, 1.152s wall-clock]
11303 relevant atoms
5116 auxiliary atoms
16419 final queue length
36991 total queue pushes
Completing instantiation... [3.880s CPU, 3.873s wall-clock]
Instantiating: [5.100s CPU, 5.093s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.080s CPU, 0.077s wall-clock]
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
Instantiating groups... [0.040s CPU, 0.040s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.020s CPU, 0.013s wall-clock]
Building translation key... [0.010s CPU, 0.006s wall-clock]
Computing fact groups: [0.170s CPU, 0.169s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.003s 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.150s CPU, 0.152s wall-clock]
Translating task: [2.870s CPU, 2.867s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
54 propositions removed
Detecting unreachable propositions: [1.510s CPU, 1.512s wall-clock]
Reordering and filtering variables...
46 of 46 variables necessary.
0 of 46 mutex groups necessary.
10539 of 10539 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.450s CPU, 0.444s wall-clock]
Translator variables: 46
Translator derived variables: 0
Translator facts: 552
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 10539
Translator axioms: 0
Translator task size: 62529
Translator peak memory: 73816 KB
Writing output... [0.980s CPU, 1.075s wall-clock]
Done! [11.240s CPU, 11.321s wall-clock]
planner.py version 0.0.1
Time: 2.32s
Memory: 213MB
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.01s
Memory: 213MB (+0MB)
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: 1.23s
Memory: 213MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.14s
Memory: 222MB (+9MB)
UNSAT
Iteration Time: 1.91s
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: 1.21s
Memory: 248MB (+26MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("overcome","anger","rest","popover","mars","saturn")),1) occurs(action(("feast","lubricity","wonderbread","turkey","goias","quebec")),1) occurs(action(("feast","curiosity","potato","snickers","kentucky","alsace")),1) occurs(action(("feast","love","tomato","tuna","kentucky","alsace")),1) occurs(action(("feast","satisfaction","pistachio","onion","kentucky","alsace")),1) occurs(action(("feast","satisfaction","onion","turkey","alsace","goias")),2) occurs(action(("feast","love","tuna","beef","kentucky","alsace")),2) occurs(action(("feast","lubricity","turkey","chicken","kentucky","alsace")),2) occurs(action(("feast","rest","popover","cantelope","bosnia","surrey")),2) occurs(action(("overcome","abrasion","love","beef","venus","neptune")),3) occurs(action(("feast","rest","cantelope","tomato","alsace","goias")),3) occurs(action(("overcome","grief","achievement","chicken","venus","neptune")),4) occurs(action(("feast","love","beef","papaya","surrey","kentucky")),4) occurs(action(("feast","rest","tomato","tuna","surrey","kentucky")),4) occurs(action(("feast","love","papaya","chicken","bosnia","surrey")),5) occurs(action(("feast","rest","tuna","beef","surrey","kentucky")),5) occurs(action(("feast","love","chicken","turkey","surrey","kentucky")),6) occurs(action(("feast","aesthetics","cantelope","tomato","kentucky","alsace")),6) occurs(action(("feast","rest","beef","scallop","bosnia","surrey")),6) occurs(action(("succumb","abrasion","love","turkey","venus","neptune")),7) occurs(action(("feast","aesthetics","tomato","tuna","bosnia","surrey")),7) occurs(action(("feast","rest","scallop","chicken","bosnia","surrey")),7) occurs(action(("feast","curiosity","snickers","turkey","alsace","goias")),8) occurs(action(("feast","rest","chicken","turkey","bosnia","surrey")),8) occurs(action(("feast","aesthetics","tuna","rice","bosnia","surrey")),8) occurs(action(("feast","love","turkey","onion","surrey","kentucky")),8) occurs(action(("succumb","anger","rest","turkey","mars","saturn")),9) occurs(action(("overcome","boils","love","onion","venus","neptune")),9) occurs(action(("feast","satisfaction","turkey","chicken","bosnia","surrey")),9) occurs(action(("feast","love","onion","turkey","kentucky","alsace")),10)
Solving Time: 0.34s
Memory: 278MB (+30MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 6.562s (Solving: 0.29s 1st Model: 0.28s Unsat: 0.00s)
CPU Time : 6.340s
Choices : 5639 (Domain: 5572)
Conflicts : 981 (Analyzed: 980)
Restarts : 10 (Average: 98.00 Last: 91)
Model-Level : 261.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 980 (Deleted: 0)
Binary : 102 (Ratio: 10.41%)
Ternary : 22 (Ratio: 2.24%)
Conflict : 980 (Average Length: 136.0 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 980 (Average: 5.41 Max: 96 Sum: 5304)
Executed : 966 (Average: 5.29 Max: 96 Sum: 5189 Ratio: 97.83%)
Bounded : 14 (Average: 8.21 Max: 12 Sum: 115 Ratio: 2.17%)
Rules : 210594
Atoms : 210594
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 103543 (Eliminated: 0 Frozen: 96317)
Constraints : 652902 (Binary: 98.7% Ternary: 0.6% Other: 0.8%)
Memory Peak : 278MB
Max. Length : 10 steps
Sol. Length : 10 steps