110 lines
5.5 KiB
Plaintext
110 lines
5.5 KiB
Plaintext
|
INFO Running translator.
|
||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-19.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-2011/domains/parking-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/parking-sequential-satisficing/instances/instance-19.pddl
|
||
|
Parsing...
|
||
|
Parsing: [0.020s CPU, 0.025s wall-clock]
|
||
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||
|
Instantiating...
|
||
|
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||
|
Normalizing Datalog program...
|
||
|
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||
|
Preparing model... [0.020s CPU, 0.020s wall-clock]
|
||
|
Generated 32 rules.
|
||
|
Computing model... [7.090s CPU, 7.088s wall-clock]
|
||
|
78629 relevant atoms
|
||
|
6562 auxiliary atoms
|
||
|
85191 final queue length
|
||
|
254680 total queue pushes
|
||
|
Completing instantiation... [29.450s CPU, 29.438s wall-clock]
|
||
|
Instantiating: [36.660s CPU, 36.649s wall-clock]
|
||
|
Computing fact groups...
|
||
|
Finding invariants...
|
||
|
12 initial candidates
|
||
|
Finding invariants: [0.080s CPU, 0.081s wall-clock]
|
||
|
Checking invariant weight... [0.010s CPU, 0.005s wall-clock]
|
||
|
Instantiating groups... [0.090s CPU, 0.087s wall-clock]
|
||
|
Collecting mutex groups... [0.020s CPU, 0.014s wall-clock]
|
||
|
Choosing groups...
|
||
|
81 uncovered facts
|
||
|
Choosing groups: [0.060s CPU, 0.063s wall-clock]
|
||
|
Building translation key... [0.020s CPU, 0.022s wall-clock]
|
||
|
Computing fact groups: [0.390s CPU, 0.384s wall-clock]
|
||
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.010s wall-clock]
|
||
|
Building dictionary for full mutex groups... [0.020s CPU, 0.021s wall-clock]
|
||
|
Building mutex information...
|
||
|
Building mutex information: [0.030s CPU, 0.036s wall-clock]
|
||
|
Translating task...
|
||
|
Processing axioms...
|
||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
Processing axioms: [1.460s CPU, 1.453s wall-clock]
|
||
|
Translating task: [31.980s CPU, 31.958s wall-clock]
|
||
|
91136 effect conditions simplified
|
||
|
0 implied preconditions added
|
||
|
Detecting unreachable propositions...
|
||
|
0 operators removed
|
||
|
0 axioms removed
|
||
|
32 propositions removed
|
||
|
Detecting unreachable propositions: [16.230s CPU, 16.238s wall-clock]
|
||
|
Reordering and filtering variables...
|
||
|
113 of 113 variables necessary.
|
||
|
49 of 81 mutex groups necessary.
|
||
|
73728 of 73728 operators necessary.
|
||
|
0 of 0 axiom rules necessary.
|
||
|
Reordering and filtering variables: [6.390s CPU, 6.379s wall-clock]
|
||
|
Translator variables: 113
|
||
|
Translator derived variables: 0
|
||
|
Translator facts: 1730
|
||
|
Translator goal facts: 32
|
||
|
Translator mutex groups: 49
|
||
|
Translator total mutex groups size: 1617
|
||
|
Translator operators: 73728
|
||
|
Translator axioms: 0
|
||
|
Translator task size: 600484
|
||
|
Translator peak memory: 389148 KB
|
||
|
Writing output... [10.440s CPU, 11.163s wall-clock]
|
||
|
Done! [103.350s CPU, 104.033s wall-clock]
|
||
|
planner.py version 0.0.1
|
||
|
|
||
|
Time: 24.39s
|
||
|
Memory: 1469MB
|
||
|
|
||
|
Iteration 1
|
||
|
Queue: [(0,80,0,True)]
|
||
|
Grounded Until: 0
|
||
|
Expected Memory: 1469MB
|
||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('check', [80])]
|
||
|
*** Info : (planner): INTERRUPTED by signal!
|
||
|
UNKNOWN
|
||
|
|
||
|
INTERRUPTED : 1
|
||
|
|
||
|
Calls : 1
|
||
|
Time : 0.000s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||
|
CPU Time : 0.000s
|
||
|
|
||
|
Choices : 0
|
||
|
Conflicts : 0 (Analyzed: 0)
|
||
|
Restarts : 0
|
||
|
Problems : 0 (Average Length: 0.00 Splits: 0)
|
||
|
Lemmas : 0 (Deleted: 0)
|
||
|
Binary : 0 (Ratio: 0.00%)
|
||
|
Ternary : 0 (Ratio: 0.00%)
|
||
|
Conflict : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||
|
Backjumps : 0 (Average: 0.00 Max: 0 Sum: 0)
|
||
|
Executed : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||
|
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 100.00%)
|
||
|
|
||
|
Variables : 0 (Eliminated: 0 Frozen: 0)
|
||
|
Constraints : 0 (Binary: 0.0% Ternary: 0.0% Other: 0.0%)i
|
||
|
|
||
|
Memory Peak : 14193MB
|
||
|
Max. Length : 0 steps
|
||
|
Models : 0
|
||
|
|
||
|
|