Add benchmark result [gc-ta1-tt1 | ipc-2011 | no-mystery-sequential-satisficing | 9]
This commit is contained in:
		
							
								
								
									
										53
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.env
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										53
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.env
									
									
									
									
									
										Normal file
									
								
							@@ -0,0 +1,53 @@
 | 
			
		||||
command:
 | 
			
		||||
- timeout
 | 
			
		||||
- -m=9216000
 | 
			
		||||
- -t=900
 | 
			
		||||
- python3
 | 
			
		||||
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
 | 
			
		||||
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl
 | 
			
		||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-9.pddl
 | 
			
		||||
- --stats
 | 
			
		||||
- --verbose
 | 
			
		||||
- --print-call
 | 
			
		||||
- -m 8192
 | 
			
		||||
- --translate
 | 
			
		||||
- -B 0.9
 | 
			
		||||
- --parallel=0
 | 
			
		||||
- --shallow
 | 
			
		||||
- --use-heuristic
 | 
			
		||||
- --test-until-not-sat
 | 
			
		||||
- --test=0
 | 
			
		||||
- --test-add=1
 | 
			
		||||
- --test-times=1
 | 
			
		||||
configuration:
 | 
			
		||||
  id: gc-ta1-tt1
 | 
			
		||||
  instanceSets:
 | 
			
		||||
  - lpnmr-first-plan-not-serializable
 | 
			
		||||
  - rintanen-aij-2012
 | 
			
		||||
  options:
 | 
			
		||||
  - --stats
 | 
			
		||||
  - --verbose
 | 
			
		||||
  - --print-call
 | 
			
		||||
  - -m 8192
 | 
			
		||||
  - --translate
 | 
			
		||||
  - -B 0.9
 | 
			
		||||
  - --parallel=0
 | 
			
		||||
  - --shallow
 | 
			
		||||
  - --use-heuristic
 | 
			
		||||
  - --test-until-not-sat
 | 
			
		||||
  - --test=0
 | 
			
		||||
  - --test-add=1
 | 
			
		||||
  - --test-times=1
 | 
			
		||||
exitCode: 0
 | 
			
		||||
instance:
 | 
			
		||||
  domain: no-mystery-sequential-satisficing
 | 
			
		||||
  instance: 9
 | 
			
		||||
  ipc: ipc-2011
 | 
			
		||||
versions:
 | 
			
		||||
  clingo: 5.2.2
 | 
			
		||||
  fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
 | 
			
		||||
  planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
 | 
			
		||||
  plasp: 3.1.1
 | 
			
		||||
  python: 3.6.3
 | 
			
		||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
 | 
			
		||||
 | 
			
		||||
							
								
								
									
										24
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.err
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										24
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.err
									
									
									
									
									
										Normal file
									
								
							@@ -0,0 +1,24 @@
 | 
			
		||||
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
 | 
			
		||||
# instance: {'ipc': 'ipc-2011', 'domain': 'no-mystery-sequential-satisficing', 'instance': 9}
 | 
			
		||||
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-9.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1']
 | 
			
		||||
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
 | 
			
		||||
# exit code: 0
 | 
			
		||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
 | 
			
		||||
  mutexGroup(G)
 | 
			
		||||
 | 
			
		||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
 | 
			
		||||
  contains(G,X,V)
 | 
			
		||||
 | 
			
		||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
 | 
			
		||||
  mutexGroup(G)
 | 
			
		||||
 | 
			
		||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
 | 
			
		||||
  contains(G,X,V)
 | 
			
		||||
 | 
			
		||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
 | 
			
		||||
  contains(G,X,V)
 | 
			
		||||
 | 
			
		||||
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-9.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -m 8192 -B 0.9 --test-until-not-sat  --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1  --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_forall_t.lp --test-once  --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp  -c _shallow=1  -c _closure=3   -c _parallel=0 
 | 
			
		||||
FINISHED CPU 90.46 MEM 33472 MAXMEM 788444 STALE 1 MAXMEM_RSS 729376
 | 
			
		||||
<time name="ALL">90290</time>
 | 
			
		||||
 | 
			
		||||
							
								
								
									
										191
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.out
									
									
									
									
									
										Normal file
									
								
							
							
						
						
									
										191
									
								
								gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_9.out
									
									
									
									
									
										Normal file
									
								
							@@ -0,0 +1,191 @@
 | 
			
		||||
INFO     Running translator.
 | 
			
		||||
INFO     translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-9.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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-9.pddl
 | 
			
		||||
Parsing...
 | 
			
		||||
Parsing: [2.550s CPU, 2.554s wall-clock]
 | 
			
		||||
Normalizing task... [0.060s CPU, 0.062s wall-clock]
 | 
			
		||||
Instantiating...
 | 
			
		||||
Generating Datalog program... [0.660s CPU, 0.661s wall-clock]
 | 
			
		||||
Normalizing Datalog program...
 | 
			
		||||
Normalizing Datalog program: [0.020s CPU, 0.012s wall-clock]
 | 
			
		||||
Preparing model... [5.490s CPU, 5.498s wall-clock]
 | 
			
		||||
Generated 23 rules.
 | 
			
		||||
Computing model... [11.140s CPU, 11.126s wall-clock]
 | 
			
		||||
61711 relevant atoms
 | 
			
		||||
112430 auxiliary atoms
 | 
			
		||||
174141 final queue length
 | 
			
		||||
198822 total queue pushes
 | 
			
		||||
Completing instantiation... [6.200s CPU, 6.205s wall-clock]
 | 
			
		||||
Instantiating: [23.710s CPU, 23.700s wall-clock]
 | 
			
		||||
Computing fact groups...
 | 
			
		||||
Finding invariants...
 | 
			
		||||
9 initial candidates
 | 
			
		||||
Finding invariants: [0.120s CPU, 0.128s wall-clock]
 | 
			
		||||
Checking invariant weight... [0.160s CPU, 0.158s wall-clock]
 | 
			
		||||
Instantiating groups... [0.130s CPU, 0.131s wall-clock]
 | 
			
		||||
Collecting mutex groups... [0.000s CPU, 0.003s wall-clock]
 | 
			
		||||
Choosing groups...
 | 
			
		||||
0 uncovered facts
 | 
			
		||||
Choosing groups: [0.020s CPU, 0.011s wall-clock]
 | 
			
		||||
Building translation key... [0.000s CPU, 0.006s wall-clock]
 | 
			
		||||
Computing fact groups: [0.460s CPU, 0.467s wall-clock]
 | 
			
		||||
Building STRIPS to SAS dictionary... [0.010s CPU, 0.003s wall-clock]
 | 
			
		||||
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
 | 
			
		||||
Building mutex information...
 | 
			
		||||
Building mutex information: [0.000s CPU, 0.003s wall-clock]
 | 
			
		||||
Translating task...
 | 
			
		||||
Processing axioms...
 | 
			
		||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
 | 
			
		||||
Processing axioms: [0.180s CPU, 0.179s wall-clock]
 | 
			
		||||
Translating task: [3.730s CPU, 3.727s wall-clock]
 | 
			
		||||
0 effect conditions simplified
 | 
			
		||||
0 implied preconditions added
 | 
			
		||||
Detecting unreachable propositions...
 | 
			
		||||
0 operators removed
 | 
			
		||||
0 axioms removed
 | 
			
		||||
16 propositions removed
 | 
			
		||||
Detecting unreachable propositions: [2.000s CPU, 2.003s wall-clock]
 | 
			
		||||
Reordering and filtering variables...
 | 
			
		||||
16 of 16 variables necessary.
 | 
			
		||||
0 of 16 mutex groups necessary.
 | 
			
		||||
12794 of 12794 operators necessary.
 | 
			
		||||
0 of 0 axiom rules necessary.
 | 
			
		||||
Reordering and filtering variables: [0.520s CPU, 0.510s wall-clock]
 | 
			
		||||
Translator variables: 16
 | 
			
		||||
Translator derived variables: 0
 | 
			
		||||
Translator facts: 531
 | 
			
		||||
Translator goal facts: 14
 | 
			
		||||
Translator mutex groups: 0
 | 
			
		||||
Translator total mutex groups size: 0
 | 
			
		||||
Translator operators: 12794
 | 
			
		||||
Translator axioms: 0
 | 
			
		||||
Translator task size: 64139
 | 
			
		||||
Translator peak memory: 122856 KB
 | 
			
		||||
Writing output... [1.160s CPU, 1.265s wall-clock]
 | 
			
		||||
Done! [34.360s CPU, 34.461s wall-clock]
 | 
			
		||||
planner.py version 0.0.1
 | 
			
		||||
 | 
			
		||||
Time:	 2.91s
 | 
			
		||||
Memory: 240MB
 | 
			
		||||
 | 
			
		||||
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.01s
 | 
			
		||||
Memory:		 240MB (+0MB)
 | 
			
		||||
UNSAT
 | 
			
		||||
Iteration Time:	 0.01s
 | 
			
		||||
 | 
			
		||||
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: 240MB
 | 
			
		||||
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
 | 
			
		||||
Grounding Time:	 0.95s
 | 
			
		||||
Memory:		 240MB (+0MB)
 | 
			
		||||
Unblocking actions...
 | 
			
		||||
Solving...
 | 
			
		||||
Solving Time:	 0.16s
 | 
			
		||||
Memory:		 251MB (+11MB)
 | 
			
		||||
UNSAT
 | 
			
		||||
Iteration Time:	 1.65s
 | 
			
		||||
 | 
			
		||||
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: 262.0MB
 | 
			
		||||
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
 | 
			
		||||
Grounding Time:	 0.90s
 | 
			
		||||
Memory:		 252MB (+1MB)
 | 
			
		||||
Unblocking actions...
 | 
			
		||||
Solving...
 | 
			
		||||
Solving Time:	 0.18s
 | 
			
		||||
Memory:		 290MB (+38MB)
 | 
			
		||||
UNSAT
 | 
			
		||||
Iteration Time:	 1.61s
 | 
			
		||||
 | 
			
		||||
Iteration 4
 | 
			
		||||
Queue:		 [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
			
		||||
Grounded Until:	 10
 | 
			
		||||
Expected Memory: 329.0MB
 | 
			
		||||
Grounding...	 [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
 | 
			
		||||
Grounding Time:	 1.07s
 | 
			
		||||
Memory:		 316MB (+26MB)
 | 
			
		||||
Unblocking actions...
 | 
			
		||||
Solving...
 | 
			
		||||
Solving Time:	 13.45s
 | 
			
		||||
Memory:		 428MB (+112MB)
 | 
			
		||||
UNSAT
 | 
			
		||||
Iteration Time:	 15.08s
 | 
			
		||||
 | 
			
		||||
Iteration 5
 | 
			
		||||
Queue:		 [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
			
		||||
Grounded Until:	 15
 | 
			
		||||
Expected Memory: 566.0MB
 | 
			
		||||
Grounding...	 [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
 | 
			
		||||
Grounding Time:	 0.94s
 | 
			
		||||
Memory:		 489MB (+61MB)
 | 
			
		||||
Unblocking actions...
 | 
			
		||||
Solving...
 | 
			
		||||
Solving Time:	 26.65s
 | 
			
		||||
Memory:		 644MB (+155MB)
 | 
			
		||||
UNKNOWN
 | 
			
		||||
Iteration Time:	 28.13s
 | 
			
		||||
 | 
			
		||||
Iteration 6
 | 
			
		||||
Queue:		 [(5,25,0,True), (6,30,0,True)]
 | 
			
		||||
Grounded Until:	 20
 | 
			
		||||
Expected Memory: 860.0MB
 | 
			
		||||
Grounding...	 [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
 | 
			
		||||
Grounding Time:	 0.97s
 | 
			
		||||
Memory:		 644MB (+0MB)
 | 
			
		||||
Unblocking actions...
 | 
			
		||||
Solving...
 | 
			
		||||
Solving Time:	 0.48s
 | 
			
		||||
Memory:		 652MB (+8MB)
 | 
			
		||||
SAT
 | 
			
		||||
Testing...
 | 
			
		||||
SERIALIZABLE
 | 
			
		||||
Testing Time:	 2.34s
 | 
			
		||||
Memory:		 652MB (+0MB)
 | 
			
		||||
Answer: 1
 | 
			
		||||
occurs(action(("drive","t0","l1","l2","level303","level3","level306")),1) occurs(action(("load","p7","t0","l1")),1) occurs(action(("drive","t0","l2","l12","level290","level13","level303")),2) occurs(action(("load","p0","t0","l12")),3) occurs(action(("load","p1","t0","l12")),3) occurs(action(("drive","t0","l12","l11","level276","level14","level290")),3) occurs(action(("load","p11","t0","l11")),4) occurs(action(("load","p5","t0","l11")),4) occurs(action(("drive","t0","l11","l12","level262","level14","level276")),4) occurs(action(("drive","t0","l12","l2","level249","level13","level262")),5) occurs(action(("unload","p11","t0","l2")),6) occurs(action(("drive","t0","l2","l0","level231","level18","level249")),6) occurs(action(("unload","p1","t0","l0")),7) occurs(action(("unload","p5","t0","l0")),7) occurs(action(("drive","t0","l0","l4","level221","level10","level231")),7) occurs(action(("unload","p0","t0","l4")),8) occurs(action(("load","p3","t0","l4")),8) occurs(action(("load","p4","t0","l4")),8) occurs(action(("drive","t0","l4","l0","level211","level10","level221")),8) occurs(action(("drive","t0","l0","l10","level202","level9","level211")),9) occurs(action(("drive","t0","l10","l7","level200","level2","level202")),10) occurs(action(("load","p6","t0","l10")),10) occurs(action(("unload","p4","t0","l7")),11) occurs(action(("load","p13","t0","l7")),11) occurs(action(("load","p2","t0","l7")),11) occurs(action(("load","p8","t0","l7")),11) occurs(action(("drive","t0","l7","l9","level195","level5","level200")),11) occurs(action(("drive","t0","l9","l3","level176","level19","level195")),12) occurs(action(("drive","t0","l3","l6","level151","level25","level176")),13) occurs(action(("load","p9","t0","l3")),13) occurs(action(("unload","p3","t0","l6")),14) occurs(action(("unload","p8","t0","l6")),14) occurs(action(("load","p10","t0","l6")),14) occurs(action(("load","p12","t0","l6")),14) occurs(action(("drive","t0","l6","l3","level126","level25","level151")),14) occurs(action(("drive","t0","l3","l9","level107","level19","level126")),15) occurs(action(("drive","t0","l9","l8","level93","level14","level107")),16) occurs(action(("unload","p10","t0","l8")),17) occurs(action(("unload","p2","t0","l8")),17) occurs(action(("drive","t0","l8","l13","level83","level10","level93")),17) occurs(action(("unload","p12","t0","l13")),18) occurs(action(("unload","p13","t0","l13")),18) occurs(action(("drive","t0","l13","l8","level73","level10","level83")),18) occurs(action(("drive","t0","l8","l9","level59","level14","level73")),19) occurs(action(("drive","t0","l9","l0","level58","level1","level59")),20) occurs(action(("unload","p6","t0","l0")),21) occurs(action(("unload","p9","t0","l0")),21) occurs(action(("drive","t0","l0","l10","level49","level9","level58")),21) occurs(action(("drive","t0","l10","l5","level43","level6","level49")),22) occurs(action(("unload","p7","t0","l5")),23) occurs(action(("drive","t0","l5","l10","level37","level6","level43")),23) occurs(action(("drive","t0","l10","l5","level31","level6","level37")),24) occurs(action(("drive","t0","l5","l1","level26","level5","level31")),25)
 | 
			
		||||
SATISFIABLE
 | 
			
		||||
 | 
			
		||||
Models       : 1+
 | 
			
		||||
Calls        : 6
 | 
			
		||||
Time         : 51.487s (Solving: 40.42s 1st Model: 0.38s Unsat: 13.45s)
 | 
			
		||||
CPU Time     : 51.388s
 | 
			
		||||
 | 
			
		||||
Choices      : 42274    (Domain: 42272)
 | 
			
		||||
Conflicts    : 15588    (Analyzed: 15585)
 | 
			
		||||
Restarts     : 179      (Average: 87.07 Last: 119)
 | 
			
		||||
Model-Level  : 410.0   
 | 
			
		||||
Problems     : 6        (Average Length: 14.50 Splits: 0)
 | 
			
		||||
Lemmas       : 15585    (Deleted: 12478)
 | 
			
		||||
  Binary     : 74       (Ratio:   0.47%)
 | 
			
		||||
  Ternary    : 29       (Ratio:   0.19%)
 | 
			
		||||
  Conflict   : 15585    (Average Length: 12290.2 Ratio: 100.00%) 
 | 
			
		||||
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
			
		||||
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
			
		||||
Backjumps    : 15585    (Average:  1.73 Max: 189 Sum:  26937)
 | 
			
		||||
  Executed   : 15557    (Average:  1.70 Max: 189 Sum:  26547 Ratio:  98.55%)
 | 
			
		||||
  Bounded    : 28       (Average: 13.93 Max:  22 Sum:    390 Ratio:   1.45%)
 | 
			
		||||
 | 
			
		||||
Rules        : 205747  
 | 
			
		||||
Atoms        : 205747  
 | 
			
		||||
Bodies       : 1        (Original: 0)
 | 
			
		||||
Tight        : Yes
 | 
			
		||||
Variables    : 318260   (Eliminated:    0 Frozen: 12533)
 | 
			
		||||
Constraints  : 1839517  (Binary:  99.1% Ternary:   0.5% Other:   0.4%)
 | 
			
		||||
 | 
			
		||||
Memory Peak  : 732MB
 | 
			
		||||
Max. Length  : 25 steps
 | 
			
		||||
Sol. Length  : 25 steps
 | 
			
		||||
Models       : 1
 | 
			
		||||
 | 
			
		||||
 | 
			
		||||
		Reference in New Issue
	
	Block a user