Add benchmark result [gc-ta1-tt1 | ipc-2011 | scanalyzer-3d-sequential-satisficing | 1]
This commit is contained in:
135
gc-ta1-tt1/ipc-2011_scanalyzer-3d-sequential-satisficing_1.out
Normal file
135
gc-ta1-tt1/ipc-2011_scanalyzer-3d-sequential-satisficing_1.out
Normal file
@@ -0,0 +1,135 @@
|
||||
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-1.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-1.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.168s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.006s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.045s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.016s wall-clock]
|
||||
Generated 51 rules.
|
||||
Computing model... [5.620s CPU, 5.610s wall-clock]
|
||||
32897 relevant atoms
|
||||
6080 auxiliary atoms
|
||||
38977 final queue length
|
||||
186369 total queue pushes
|
||||
Completing instantiation... [20.740s CPU, 20.736s wall-clock]
|
||||
Instantiating: [26.470s CPU, 26.453s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
5 initial candidates
|
||||
Finding invariants: [0.510s CPU, 0.518s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
|
||||
Instantiating groups... [0.010s 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.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.520s CPU, 0.526s 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.810s CPU, 0.806s wall-clock]
|
||||
Translating task: [15.810s CPU, 15.799s 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: [7.720s CPU, 7.718s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
16 of 16 variables necessary.
|
||||
0 of 8 mutex groups necessary.
|
||||
32736 of 32736 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [3.040s CPU, 3.045s 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: 32736
|
||||
Translator axioms: 0
|
||||
Translator task size: 294864
|
||||
Translator peak memory: 229952 KB
|
||||
Writing output... [4.590s CPU, 5.062s wall-clock]
|
||||
Done! [58.860s CPU, 59.446s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 14.54s
|
||||
Memory: 952MB
|
||||
|
||||
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.06s
|
||||
Memory: 952MB (+0MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.06s
|
||||
|
||||
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: 952MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 4.56s
|
||||
Memory: 952MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.94s
|
||||
Memory: 979MB (+27MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 11.28s
|
||||
Memory: 979MB (+0MB)
|
||||
Answer: 1
|
||||
occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-1a","seg-out-1b","car-in-1a","car-in-1b","car-out-1a","car-out-1b")),1) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-2a","seg-out-2b","car-in-2a","car-in-2b","car-out-2a","car-out-2b")),1) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-1b","car-out-1a","car-out-2b","car-in-2a")),2) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-in-2b","car-out-2a","car-out-1b","car-in-1a")),2) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-1a","car-out-2b","car-in-2a","car-in-1b")),3) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-out-2a","car-out-1b","car-in-1a","car-in-2b")),3) occurs(action(("analyze-4","seg-in-2a","seg-in-2b","seg-out-1a","seg-out-1b","car-out-1b","car-in-1a","car-in-2b","car-out-2a")),4) occurs(action(("analyze-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-out-2b","car-in-2a","car-in-1b","car-out-1a")),4) 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")),5) occurs(action(("rotate-4","seg-in-1a","seg-in-1b","seg-out-2a","seg-out-2b","car-in-2a","car-in-1b","car-out-1a","car-out-2b")),5)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 2
|
||||
Time : 23.622s (Solving: 0.02s 1st Model: 0.01s Unsat: 0.00s)
|
||||
CPU Time : 22.644s
|
||||
|
||||
Choices : 52 (Domain: 42)
|
||||
Conflicts : 4 (Analyzed: 4)
|
||||
Restarts : 0
|
||||
Model-Level : 50.0
|
||||
Problems : 2 (Average Length: 4.50 Splits: 0)
|
||||
Lemmas : 4 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 0 (Ratio: 0.00%)
|
||||
Conflict : 4 (Average Length: 1999.8 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 4 (Average: 2.25 Max: 6 Sum: 9)
|
||||
Executed : 4 (Average: 2.25 Max: 6 Sum: 9 Ratio: 100.00%)
|
||||
Bounded : 0 (Average: 0.00 Max: 0 Sum: 0 Ratio: 0.00%)
|
||||
|
||||
Rules : 851922
|
||||
Atoms : 851922
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 131735 (Eliminated: 0 Frozen: 268)
|
||||
Constraints : 597370 (Binary: 99.9% Ternary: 0.0% Other: 0.1%)
|
||||
|
||||
Memory Peak : 1462MB
|
||||
Max. Length : 5 steps
|
||||
Sol. Length : 5 steps
|
||||
Models : 1
|
||||
|
||||
|
||||
Reference in New Issue
Block a user