1
0
tplp-planning-benchmark/gc-ta1-tt1/ipc-2002_zenotravel-strips-automatic_2.out

135 lines
5.2 KiB
Plaintext

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/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-2002/domains/zenotravel-strips-automatic/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2002/domains/zenotravel-strips-automatic/instances/instance-2.pddl
Parsing...
Parsing: [0.010s CPU, 0.018s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 40 rules.
Computing model... [0.050s CPU, 0.043s wall-clock]
206 relevant atoms
182 auxiliary atoms
388 final queue length
605 total queue pushes
Completing instantiation... [0.040s CPU, 0.047s wall-clock]
Instantiating: [0.130s CPU, 0.134s wall-clock]
Computing fact groups...
Finding invariants...
9 initial candidates
Finding invariants: [0.030s CPU, 0.022s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.002s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
0 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.030s CPU, 0.027s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.002s wall-clock]
Translating task: [0.040s CPU, 0.034s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
5 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.017s wall-clock]
Reordering and filtering variables...
4 of 5 variables necessary.
0 of 5 mutex groups necessary.
129 of 135 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.010s CPU, 0.005s wall-clock]
Translator variables: 4
Translator derived variables: 0
Translator facts: 18
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 129
Translator axioms: 0
Translator task size: 607
Translator peak memory: 36556 KB
Writing output... [0.010s CPU, 0.014s wall-clock]
Done! [0.240s CPU, 0.253s wall-clock]
planner.py version 0.0.1
Time: 0.04s
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
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 0.01s
Memory: 51MB (+1MB)
Unblocking actions...
Solving...
Solving Time: 0.00s
Memory: 51MB (+0MB)
SAT
Testing...
SERIALIZABLE
Testing Time: 0.02s
Memory: 52MB (+1MB)
Answer: 1
occurs(action(("fly","plane1","city0","city2","fl2","fl1")),1) occurs(action(("board","person1","plane1","city2")),2) occurs(action(("fly","plane1","city2","city1","fl1","fl0")),2) occurs(action(("debark","person1","plane1","city1")),3) occurs(action(("refuel","plane1","city1","fl0","fl1")),3) occurs(action(("fly","plane1","city1","city2","fl1","fl0")),4) occurs(action(("refuel","plane1","city2","fl0","fl1")),5)
SATISFIABLE
Models : 1+
Calls : 2
Time : 0.058s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
CPU Time : 0.056s
Choices : 12 (Domain: 9)
Conflicts : 6 (Analyzed: 6)
Restarts : 0
Model-Level : 13.0
Problems : 2 (Average Length: 4.50 Splits: 0)
Lemmas : 6 (Deleted: 0)
Binary : 1 (Ratio: 16.67%)
Ternary : 1 (Ratio: 16.67%)
Conflict : 6 (Average Length: 10.3 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 6 (Average: 1.00 Max: 1 Sum: 6)
Executed : 6 (Average: 1.00 Max: 1 Sum: 6 Ratio: 100.00%)
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
Rules : 1958
Atoms : 1958
Bodies : 1 (Original: 0)
Tight : Yes
Variables : 647 (Eliminated: 0 Frozen: 32)
Constraints : 2782 (Binary: 96.0% Ternary: 1.8% Other: 2.1%)
Memory Peak : 52MB
Max. Length : 5 steps
Sol. Length : 5 steps
Models : 1