tplp-planning-benchmark/gc-ta1-tt1/ipc-2011_scanalyzer-3d-sequential-satisficing_8.out

188 lines
10 KiB
Plaintext
Raw Permalink Normal View History

INFO Running translator.
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-8.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/scanalyzer-3d-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/scanalyzer-3d-sequential-satisficing/instances/instance-8.pddl
Parsing...
Parsing: [0.020s CPU, 0.023s wall-clock]
Normalizing task... [0.000s CPU, 0.002s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.030s CPU, 0.036s wall-clock]
Preparing model... [0.020s CPU, 0.013s wall-clock]
Generated 51 rules.
Computing model... [3.400s CPU, 3.411s wall-clock]
20606 relevant atoms
4328 auxiliary atoms
24934 final queue length
110886 total queue pushes
Completing instantiation... [12.740s CPU, 12.723s wall-clock]
Instantiating: [16.230s CPU, 16.214s wall-clock]
Computing fact groups...
Finding invariants...
5 initial candidates
Finding invariants: [0.350s CPU, 0.354s 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...
8 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.010s CPU, 0.001s wall-clock]
Computing fact groups: [0.360s CPU, 0.361s 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.500s CPU, 0.499s wall-clock]
Translating task: [9.240s CPU, 9.253s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
8 propositions removed
Detecting unreachable propositions: [4.520s CPU, 4.518s wall-clock]
Reordering and filtering variables...
16 of 16 variables necessary.
0 of 8 mutex groups necessary.
20448 of 20448 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [1.770s CPU, 1.766s wall-clock]
Translator variables: 16
Translator derived variables: 0
Translator facts: 80
Translator goal facts: 16
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 20448
Translator axioms: 0
Translator task size: 178128
Translator peak memory: 152732 KB
Writing output... [2.710s CPU, 2.989s wall-clock]
Done! [35.260s CPU, 35.535s wall-clock]
planner.py version 0.0.1
Time: 8.62s
Memory: 594MB
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.03s
Memory: 594MB (+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
Expected Memory: 594MB
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
Grounding Time: 2.51s
Memory: 594MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 0.38s
Memory: 596MB (+2MB)
UNSAT
Iteration Time: 4.27s
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
Expected Memory: 598.0MB
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
Grounding Time: 2.77s
Memory: 596MB (+0MB)
Unblocking actions...
Solving...
Solving Time: 12.58s
Memory: 648MB (+52MB)
UNKNOWN
Iteration Time: 16.49s
Iteration 4
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 10
Expected Memory: 700.0MB
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
Grounding Time: 2.55s
Memory: 740MB (+92MB)
Unblocking actions...
Solving...
Solving Time: 12.68s
Memory: 836MB (+96MB)
UNKNOWN
Iteration Time: 16.47s
Iteration 5
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
Grounded Until: 15
Expected Memory: 1024.0MB
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
Grounding Time: 2.63s
Memory: 902MB (+66MB)
Unblocking actions...
Solving...
Solving Time: 2.96s
Memory: 950MB (+48MB)
SAT
Testing...
NOT SERIALIZABLE
Testing Time: 12.58s
Memory: 1354MB (+404MB)
Solving...
Solving Time: 10.07s
Memory: 1306MB (+-48MB)
SAT
Testing...
SERIALIZABLE?
Testing Time: 0.00s
Memory: 1306MB (+0MB)
Answer: 2
occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-1a","car-in-1b","car-out-2a","car-out-2b")),1) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-2a","car-in-2b","car-out-1a","car-out-1b")),1) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1b","car-out-2a","car-out-1b","car-in-2a")),2) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-2b","car-out-1a","car-out-2b","car-in-1a")),2) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-2a","car-out-1b","car-in-2a","car-in-1b")),3) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-out-1a","car-out-2b","car-in-1a","car-in-2b")),3) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-1b","car-in-2a","car-in-1b","car-out-2a")),4) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-2a","car-in-1b","car-in-2b","car-out-1a")),5) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-1b","car-in-2b","car-out-1a","car-in-2a")),6) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-2b","car-out-1a","car-out-2a","car-out-1b")),7) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-out-2b","car-in-1a","car-in-2a","car-in-1b")),7) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-1a","car-out-2a","car-out-1b","car-in-2b")),8) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-1a","car-in-2a","car-in-1b","car-out-2b")),8) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-2a","car-out-1b","car-out-2b","car-in-1a")),9) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-2a","car-in-1b","car-in-2b","car-out-1a")),9) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-1b","car-in-2b","car-out-1a","car-in-2a")),10) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-1b","car-out-2b","car-in-1a","car-out-2a")),10) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-2b","car-in-1a","car-in-2a","car-in-1b")),11) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1a","car-in-2a","car-in-1b","car-out-2b")),12) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-2a","car-in-1b","car-out-2b","car-in-1a")),13) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-2b","car-out-1a","car-in-1a","car-in-2a")),14) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1b","car-out-2b","car-in-2a","car-in-2b")),15) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-2b","car-in-2a","car-out-2a","car-out-1b")),16) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-out-1a","car-in-1a","car-in-2b","car-in-1b")),16) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-2a","car-out-2a","car-out-1b","car-out-2b")),17) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-2a","car-out-1b","car-in-1b","car-out-1a")),18) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-out-1b","car-in-1b","car-out-1a","car-out-2a")),19) occurs(action(("rotate-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-1a","car-in-2b","car-out-2a","car-out-1b")),20)
SATISFIABLE
Models : 1+
Calls : 6
Time : 68.194s (Solving: 37.12s 1st Model: 12.01s Unsat: 0.00s)
CPU Time : 67.756s
Choices : 64390 (Domain: 64375)
Conflicts : 22476 (Analyzed: 22476)
Restarts : 240 (Average: 93.65 Last: 152)
Model-Level : 149.0
Problems : 6 (Average Length: 13.67 Splits: 0)
Lemmas : 22476 (Deleted: 18702)
Binary : 54 (Ratio: 0.24%)
Ternary : 45 (Ratio: 0.20%)
Conflict : 22476 (Average Length: 6996.9 Ratio: 100.00%)
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
Backjumps : 22476 (Average: 2.50 Max: 80 Sum: 56183)
Executed : 22466 (Average: 2.50 Max: 80 Sum: 56141 Ratio: 99.93%)
Bounded : 10 (Average: 4.20 Max: 17 Sum: 42 Ratio: 0.07%)
Rules : 1919502 (Original: 1919494)
Atoms : 586042
Bodies : 498673 (Original: 498671)
Count : 152 (Original: 156)
Equivalences : 333451 (Atom=Atom: 22 Body=Body: 0 Other: 333429)
Tight : Yes
Variables : 392170 (Eliminated: 0 Frozen: 334608)
Constraints : 5807778 (Binary: 99.9% Ternary: 0.0% Other: 0.0%)
Memory Peak : 1424MB
Max. Length : 20 steps
Sol. Length : 20 steps
Models : 2