Add benchmark result [gc-ta1-tt1 | ipc-2006 | pathways-propositional-strips | 3]
This commit is contained in:
159
gc-ta1-tt1/ipc-2006_pathways-propositional-strips_3.out
Normal file
159
gc-ta1-tt1/ipc-2006_pathways-propositional-strips_3.out
Normal file
@@ -0,0 +1,159 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/domains/domain-3.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-3.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-2006/domains/pathways-propositional-strips/domains/domain-3.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/pathways-propositional-strips/instances/instance-3.pddl
|
||||
Parsing...
|
||||
Parsing: [0.100s CPU, 0.105s wall-clock]
|
||||
Normalizing task... [0.020s CPU, 0.015s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.011s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.030s CPU, 0.033s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.018s wall-clock]
|
||||
Generated 294 rules.
|
||||
Computing model... [0.010s CPU, 0.011s wall-clock]
|
||||
219 relevant atoms
|
||||
0 auxiliary atoms
|
||||
219 final queue length
|
||||
315 total queue pushes
|
||||
Completing instantiation... [0.020s CPU, 0.022s wall-clock]
|
||||
Instantiating: [0.090s CPU, 0.097s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
99 initial candidates
|
||||
Finding invariants: [22.350s CPU, 22.335s wall-clock]
|
||||
Checking invariant weight... [0.130s CPU, 0.134s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
|
||||
Choosing groups...
|
||||
57 uncovered facts
|
||||
Choosing groups: [0.000s CPU, 0.002s wall-clock]
|
||||
Building translation key... [0.010s CPU, 0.002s wall-clock]
|
||||
Computing fact groups: [22.500s CPU, 22.483s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.000s CPU, 0.002s wall-clock]
|
||||
Translating task: [0.030s CPU, 0.030s wall-clock]
|
||||
47 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
20 propositions removed
|
||||
Detecting unreachable propositions: [0.020s CPU, 0.021s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
53 of 77 variables necessary.
|
||||
0 of 22 mutex groups necessary.
|
||||
103 of 118 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.010s CPU, 0.011s wall-clock]
|
||||
Translator variables: 53
|
||||
Translator derived variables: 0
|
||||
Translator facts: 108
|
||||
Translator goal facts: 3
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 103
|
||||
Translator axioms: 0
|
||||
Translator task size: 641
|
||||
Translator peak memory: 42732 KB
|
||||
Writing output... [0.020s CPU, 0.016s wall-clock]
|
||||
Done! [22.790s CPU, 22.784s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.02s
|
||||
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
|
||||
Expected Memory: 50MB
|
||||
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)
|
||||
UNSAT
|
||||
Iteration Time: 0.02s
|
||||
|
||||
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: 52.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.01s
|
||||
Memory: 52MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 52MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
NOT SERIALIZABLE
|
||||
Testing Time: 0.02s
|
||||
Memory: 52MB (+0MB)
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 53MB (+1MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE?
|
||||
Testing Time: 0.00s
|
||||
Memory: 53MB (+0MB)
|
||||
Answer: 2
|
||||
occurs(action("choose_gp_l1_l0"),1) occurs(action("initialize_gp"),2) occurs(action("choose_sp1_l2_l1"),2) occurs(action("choose_cdk46p1_l3_l2"),3) occurs(action("initialize_sp1"),3) occurs(action("initialize_cdk46p1"),4) occurs(action("associate_sp1_gp_sp1-gp"),4) occurs(action("synthesize_sp1-gp_cyca"),5) occurs(action("synthesize_sp1-gp_cycd"),5) occurs(action("initialize_gp"),5) occurs(action("initialize_sp1"),5) occurs(action("synthesize_sp1-gp_p107"),5) occurs(action("dummy-action-2-2"),6) occurs(action("associate_cdk46p1_cycd_cdk46p1-cycd"),6) occurs(action("associate_sp1_p107_sp1-p107"),6) occurs(action("dummy-action-3-2"),7) occurs(action("associate_sp1-p107_gp_sp1-p107-gp"),7) occurs(action("dummy-action-1-1"),8) occurs(action("synthesize_sp1-gp_cyca"),9) occurs(action("synthesize_sp1-gp_cycd"),10) occurs(action("initialize_cdk46p1"),10) occurs(action("initialize_gp"),10) occurs(action("synthesize_sp1-gp_p107p1"),10) occurs(action("initialize_sp1"),10) occurs(action("synthesize_sp1-gp_p107"),10)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 4
|
||||
Time : 0.068s (Solving: 0.00s 1st Model: 0.00s Unsat: 0.00s)
|
||||
CPU Time : 0.056s
|
||||
|
||||
Choices : 207 (Domain: 137)
|
||||
Conflicts : 8 (Analyzed: 8)
|
||||
Restarts : 0
|
||||
Model-Level : 106.0
|
||||
Problems : 4 (Average Length: 8.25 Splits: 0)
|
||||
Lemmas : 8 (Deleted: 0)
|
||||
Binary : 0 (Ratio: 0.00%)
|
||||
Ternary : 2 (Ratio: 25.00%)
|
||||
Conflict : 8 (Average Length: 7.5 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 8 (Average: 5.50 Max: 17 Sum: 44)
|
||||
Executed : 5 (Average: 2.38 Max: 17 Sum: 19 Ratio: 43.18%)
|
||||
Bounded : 3 (Average: 8.33 Max: 12 Sum: 25 Ratio: 56.82%)
|
||||
|
||||
Rules : 4102 (Original: 3911)
|
||||
Atoms : 2900
|
||||
Bodies : 1402 (Original: 1210)
|
||||
Count : 10 (Original: 89)
|
||||
Equivalences : 849 (Atom=Atom: 88 Body=Body: 0 Other: 761)
|
||||
Tight : Yes
|
||||
Variables : 2998 (Eliminated: 0 Frozen: 427)
|
||||
Constraints : 9191 (Binary: 84.6% Ternary: 12.3% Other: 3.0%)
|
||||
|
||||
Memory Peak : 53MB
|
||||
Max. Length : 10 steps
|
||||
Sol. Length : 10 steps
|
||||
Models : 2
|
||||
|
||||
|
||||
Reference in New Issue
Block a user