110 lines
5.3 KiB
Plaintext
110 lines
5.3 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-16.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-16.pddl
|
||
|
|
Parsing...
|
||
|
|
Parsing: [0.020s CPU, 0.025s wall-clock]
|
||
|
|
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||
|
|
Instantiating...
|
||
|
|
Generating Datalog program... [0.010s CPU, 0.008s wall-clock]
|
||
|
|
Normalizing Datalog program...
|
||
|
|
Normalizing Datalog program: [0.010s CPU, 0.015s wall-clock]
|
||
|
|
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||
|
|
Generated 32 rules.
|
||
|
|
Computing model... [5.900s CPU, 5.896s wall-clock]
|
||
|
|
65075 relevant atoms
|
||
|
|
5792 auxiliary atoms
|
||
|
|
70867 final queue length
|
||
|
|
210833 total queue pushes
|
||
|
|
Completing instantiation... [24.310s CPU, 24.294s wall-clock]
|
||
|
|
Instantiating: [30.310s CPU, 30.292s wall-clock]
|
||
|
|
Computing fact groups...
|
||
|
|
Finding invariants...
|
||
|
|
12 initial candidates
|
||
|
|
Finding invariants: [0.080s CPU, 0.075s wall-clock]
|
||
|
|
Checking invariant weight... [0.000s CPU, 0.005s wall-clock]
|
||
|
|
Instantiating groups... [0.080s CPU, 0.079s wall-clock]
|
||
|
|
Collecting mutex groups... [0.010s CPU, 0.012s wall-clock]
|
||
|
|
Choosing groups...
|
||
|
|
76 uncovered facts
|
||
|
|
Choosing groups: [0.050s CPU, 0.050s wall-clock]
|
||
|
|
Building translation key... [0.020s CPU, 0.020s wall-clock]
|
||
|
|
Computing fact groups: [0.330s CPU, 0.330s wall-clock]
|
||
|
|
Building STRIPS to SAS dictionary... [0.010s CPU, 0.009s 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.030s wall-clock]
|
||
|
|
Translating task...
|
||
|
|
Processing axioms...
|
||
|
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||
|
|
Processing axioms: [1.210s CPU, 1.206s wall-clock]
|
||
|
|
Translating task: [26.310s CPU, 26.301s wall-clock]
|
||
|
|
75150 effect conditions simplified
|
||
|
|
0 implied preconditions added
|
||
|
|
Detecting unreachable propositions...
|
||
|
|
0 operators removed
|
||
|
|
0 axioms removed
|
||
|
|
30 propositions removed
|
||
|
|
Detecting unreachable propositions: [13.320s CPU, 13.312s wall-clock]
|
||
|
|
Reordering and filtering variables...
|
||
|
|
106 of 106 variables necessary.
|
||
|
|
46 of 76 mutex groups necessary.
|
||
|
|
60750 of 60750 operators necessary.
|
||
|
|
0 of 0 axiom rules necessary.
|
||
|
|
Reordering and filtering variables: [5.240s CPU, 5.248s wall-clock]
|
||
|
|
Translator variables: 106
|
||
|
|
Translator derived variables: 0
|
||
|
|
Translator facts: 1532
|
||
|
|
Translator goal facts: 30
|
||
|
|
Translator mutex groups: 46
|
||
|
|
Translator total mutex groups size: 1426
|
||
|
|
Translator operators: 60750
|
||
|
|
Translator axioms: 0
|
||
|
|
Translator task size: 494944
|
||
|
|
Translator peak memory: 327840 KB
|
||
|
|
Writing output... [8.660s CPU, 9.254s wall-clock]
|
||
|
|
Done! [85.210s CPU, 85.786s wall-clock]
|
||
|
|
planner.py version 0.0.1
|
||
|
|
|
||
|
|
Time: 20.07s
|
||
|
|
Memory: 1224MB
|
||
|
|
|
||
|
|
Iteration 1
|
||
|
|
Queue: [(0,70,0,True)]
|
||
|
|
Grounded Until: 0
|
||
|
|
Expected Memory: 1224MB
|
||
|
|
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]), ('check', [70])]
|
||
|
|
*** 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 : 10617MB
|
||
|
|
Max. Length : 0 steps
|
||
|
|
Models : 0
|
||
|
|
|
||
|
|
|