1
0
Fork 0
tplp-planning-benchmark/fd-pb-es/ipc-1998_mystery-round-1-st...

143 lines
5.9 KiB
Plaintext

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-10.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-10.pddl
Parsing...
Parsing: [0.030s CPU, 0.025s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.008s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.027s wall-clock]
Preparing model... [0.020s CPU, 0.025s wall-clock]
Generated 42 rules.
Computing model... [3.540s CPU, 3.534s wall-clock]
38374 relevant atoms
11225 auxiliary atoms
49599 final queue length
121803 total queue pushes
Completing instantiation... [14.300s CPU, 14.289s wall-clock]
Instantiating: [17.930s CPU, 17.927s wall-clock]
Computing fact groups...
Finding invariants...
12 initial candidates
Finding invariants: [0.230s CPU, 0.225s wall-clock]
Checking invariant weight... [0.000s CPU, 0.004s wall-clock]
Instantiating groups... [0.110s CPU, 0.111s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.008s wall-clock]
Choosing groups...
2 uncovered facts
Choosing groups: [0.030s CPU, 0.023s wall-clock]
Building translation key... [0.010s CPU, 0.014s wall-clock]
Computing fact groups: [0.450s CPU, 0.450s wall-clock]
Building STRIPS to SAS dictionary... [0.010s CPU, 0.007s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.005s wall-clock]
Building mutex information...
Building mutex information: [0.010s CPU, 0.007s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.540s CPU, 0.535s wall-clock]
Translating task: [10.470s CPU, 10.473s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
78 propositions removed
Detecting unreachable propositions: [5.340s CPU, 5.334s wall-clock]
Reordering and filtering variables...
74 of 74 variables necessary.
0 of 74 mutex groups necessary.
36738 of 36738 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.540s CPU, 1.540s wall-clock]
Translator variables: 74
Translator derived variables: 0
Translator facts: 1346
Translator goal facts: 1
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 36738
Translator axioms: 0
Translator task size: 220679
Translator peak memory: 177508 KB
Writing output... [3.420s CPU, 3.770s wall-clock]
Done! [39.660s CPU, 39.991s wall-clock]
planner.py version 0.0.1
Time: 8.22s
Memory: 628MB
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.04s
Memory: 628MB (+0MB)
UNSAT
Iteration Time: 0.04s
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: 3.71s
Memory: 628MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 1.20s
Memory: 656MB (+28MB)
UNSAT
Iteration Time: 7.28s
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: 3.28s
Memory: 707MB (+51MB)
Unblocking actions...
Solving...
Answer: 1
occurs(action(("feast","aesthetics","flounder","kale","surrey","moravia")),1) occurs(action(("overcome","jealousy-16","aesthetics","kale","mars","neptune")),2) occurs(action(("feast","aesthetics","kale","arugula","moravia","quebec")),3) occurs(action(("feast","aesthetics","arugula","beef","surrey","moravia")),4) occurs(action(("succumb","jealousy-16","aesthetics","beef","mars","neptune")),5) occurs(action(("overcome","jealousy-16","aesthetics","beef","mars","neptune")),6) occurs(action(("feast","aesthetics","beef","snickers","surrey","moravia")),7) occurs(action(("feast","aesthetics","snickers","lamb","oregon","alsace")),8) occurs(action(("feast","aesthetics","lamb","tofu","surrey","moravia")),9) occurs(action(("succumb","jealousy-16","aesthetics","tofu","mars","neptune")),10)
Solving Time: 0.59s
Memory: 786MB (+79MB)
SAT
SATISFIABLE
Models : 1+
Calls : 3
Time : 21.803s (Solving: 0.52s 1st Model: 0.45s Unsat: 0.05s)
CPU Time : 21.230s
Choices : 878
Conflicts : 250 (Analyzed: 249)
Restarts : 2 (Average: 124.50 Last: 58)
Model-Level : 20.0
Problems : 3 (Average Length: 7.00 Splits: 0)
Lemmas : 249 (Deleted: 0)
Binary : 46 (Ratio: 18.47%)
Ternary : 14 (Ratio: 5.62%)
Conflict : 249 (Average Length: 263.8 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 249 (Average: 4.69 Max: 46 Sum: 1167)
Executed : 212 (Average: 3.33 Max: 46 Sum: 828 Ratio: 70.95%)
Bounded : 37 (Average: 9.16 Max: 12 Sum: 339 Ratio: 29.05%)
Rules : 664682
Atoms : 664682
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 352221 (Eliminated: 0 Frozen: 337299)
Constraints : 1918712 (Binary: 99.0% Ternary: 0.5% Other: 0.5%)
Memory Peak : 798MB
Max. Length : 10 steps
Sol. Length : 10 steps